How hard is it to control sequential elections via the agenda
暂无分享,去创建一个
[1] Piotr Faliszewski,et al. Llull and Copeland Voting Broadly Resist Bribery and Control , 2007, AAAI.
[2] Ariel D. Procaccia,et al. Complexity of Strategic Behavior in Multi-Winner Elections , 2008, J. Artif. Intell. Res..
[3] Jörg Rothe,et al. Anyone but him: The complexity of precluding an alternative , 2005, Artif. Intell..
[4] Toby Walsh,et al. Dealing with Incomplete Agents' Preferences and an Uncertain Agenda in Group Decision Making via Sequential Majority Voting , 2008, KR.
[5] Ronen I. Brafman,et al. CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements , 2011, J. Artif. Intell. Res..
[6] Jérôme Lang,et al. Vote and Aggregation in Combinatorial Domains with Structured Preferences , 2007, IJCAI.
[7] Emerson M. S. Niou,et al. A Problem with Referendums , 2000 .
[8] Lirong Xia,et al. Sequential voting rules and multiple elections paradoxes , 2007, TARK '07.
[9] A. Tversky,et al. The Disjunction Effect in Choice under Uncertainty , 1992 .
[10] S. Brams,et al. The paradox of multiple elections , 1998 .
[11] David C. Mcgarvey. A THEOREMI ON THE CONSTRUCTION OF VOTING PARADOXES , 1953 .
[12] C. Plott,et al. A Model of Agenda Influence on Committee Decisions , 1978 .
[13] Jörg Rothe,et al. Hybrid Elections Broaden Complexity‐Theoretic Resistance to Control , 2006, IJCAI.
[14] Michael A. Trick,et al. How hard is it to control an election? Math , 1992 .
[15] Vincent Conitzer,et al. Voting on Multiattribute Domains with Cyclic Preferential Dependencies , 2008, AAAI.
[16] David S. Johnson,et al. The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..