Résumé (EN)

Voting on multiple related issues is an importantand difficult problem. The key difficulty is that thenumber of alternatives is exponential in the numberof issues, and hence it is infeasible for the agentsto rank all the alternatives. A simple approach is tovote on the issues one at a time, in sequence; however, a drawback is that the outcome may dependon the order in which the issues are voted upon anddecided, which gives the chairperson some controlover the outcome of the election because she canstrategically determine the order. While this is undeniably a negative feature of sequential voting, inthis paper we temper this judgment by showing thatthe chairperson’s control problem is, in most cases,computationally hard.