|
|
preferences and weighted votes
– Jérôme Lang, Maria Silvia, Pini Francesca Rossi, Domenico Salvagnin, Kristen Brent, Venable Toby Walsh, J. Lang, T. Walsh
- 2011
|
|
1
|
Computational voting theory: Of the agents, by the agents, for the agents
– Ariel D. Procaccia
- 2008
|
|
2
|
Is Computational Complexity a Barrier to Manipulation?
– Toby Walsh
|
|
31
|
A short introduction to computational social choice
– Yann Chevaleyre, Ulle Endriss, Jérôme Lang, Nicolas Maudet
- 2007
|
|
11
|
Dealing with Incomplete Agents ’ Preferences and an Uncertain Agenda in Group Decision Making via Sequential Majority Voting
– Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh
|
|
|
Monotonicity of 'ranking by choosing'
– Denis Bouyssou
- 2003
|
|
9
|
Minimal Stable Sets in Tournaments
– Felix Brandt
- 2009
|
|
|
Complexity results
– M. S. Pini A, F. Rossi A, K. B. Venable A, T. Walsh B
|
|
3
|
Comparing multiagent systems research in combinatorial auctions and voting
– Vincent Conitzer
|
|
51
|
Voting procedures with incomplete preferences
– Kathrin Konczak
- 2005
|
|
34
|
The Complexity of Bribery in Elections
– Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra
- 2006
|
|
14
|
Complexity of Terminating Preference Elicitation
– Toby Walsh
|
|
5
|
Computational Aspects of Covering in Dominance Graphs
– Felix Brandt, Felix Fischer
- 2008
|
|
1
|
On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions
– Felix Brandt, Markus Brill, Hans Georg Seedig
- 2010
|
|
14
|
Computing the minimal covering set
– Felix Brandt, Felix Fischer
- 2007
|
|
4
|
A New Perspective on Implementation by Voting Trees
– Felix Fischer, Ariel D. Procaccia, Alex Samorodnitsky
|
|
3
|
Fundamentals of social choice theory
– Roger B. Myerson
- 1996
|
|
1
|
Completeness in the boolean hierarchy: Exact-Four-Colorability, minimal graph uncolorability, and exact domatic number problems – a survey
– Tobias Riege, Jörg Rothe
- 2006
|
|
|
unknown title
– unknown authors
|
