Finding similar regions in many strings
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Aggregating Partially Ordered Preferences
Journal of Logic and Computation
mCP nets: representing and reasoning with preferences of multiple agents
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Journal of Artificial Intelligence Research
Preference aggregation over restricted ballot languages: sincerity and strategy-proofness
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On the role of distances in defining voting rules
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
An Efficient Procedure for Collective Decision-making with CP-nets
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Aggregating conditionally lexicographic preferences on multi-issue domains
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
Many collective decision making problems have a combinatorial structure: the agents involved must decide on multiple issues and their preferences over one issue may depend on the choices adopted for some of the others. Voting is an attractive method for making collective decisions, but conducting a multi-issue election is challenging. On the one hand, requiring agents to vote by expressing 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. We identify and analyse the problem of generating an agenda for a given election, specifying which issues to vote on together in local elections and in which order to schedule those local elections.