Voting on multiple related issues is an important and difficult problem. The key difficulty is that the number of alternatives is exponential in the number of issues, and hence it is infeasible for the agents to rank all the alternatives. A simple approach is to vote on the issues one at a time, in sequence; however, a drawback is that the outcome may depend on the order in which the issues are voted upon and decided, which gives the chairperson some control over the outcome of the election because she can strategically determine the order. While this is undeniably a negative feature of sequential voting, in this paper we temper this judgment by showing that the chairperson’s control problem is, in most cases, computationally hard.

Authors

• Vincent Conitzer Carnegie Mellon University
• Jérôme Lang CNRS, LAMSADE, Universite Paris-Dauphine, PSL
• Lirong Xia Rensselaer Polytechnic Institute

Keywords

No keywords are indexed for this paper.