We study the possibilities for agenda manipulation under strategic voting for two prominent sequential voting procedures: the amendment procedure and the successive procedure. We show that a well known result for tournaments, namely that the successive procedure is (weakly) more manipulable than...

We study two‐stage collective decision‐making procedures where in the first stage, part of the voters decide what issues will be put in the agenda and in the second stage, the whole set of voters decides on the positions to be adopted regarding the issues that are in the agenda. Using a...

In this paper we prove that the symmetric Nash solution is a risk neutral von Neumann–Morgenstern utility function on the class of pure bargaining games. Our result corrects an error in Roth (Econometrica 46:587–594, 983, 1978) and generalizes Roth’s result to bargaining games with...