24 June 2011, Computational Social Choice Seminar, Ulle Endriss
Conducting a multi-issue election is challenging: On the one hand, requiring voters to express their preferences over all combinations of issues is computationally infeasible; on the other, decomposing the problem into several elections on smaller sets of issues can lead to paradoxical outcomes. Any pragmatic method for running a multi-issue election will have to balance these two concerns. In this talk I will introduce and discuss the agenda choice problem: the problem of choosing an agenda for a given election, determining which issues to vote on together in local elections and in which order to schedule those local elections.
This is joint work with Stéphane Airiau, Umberto Grandi, Daniele Porello and Joel Uckelman.