Some properties of paths in a dynamic voting problem

The McKelvy theorem [1] is extended to the case where in the voting in an «Election» game the «$k$-majority» procedure is used. Depending on the number of voters and the dimension of the space of programs the values of $k$ are determined with which the paths approach some specified region in this space.