Handbook of Computational Social Choice

The rapidly growing field of computational social choice, at the intersection of computer science and economics, deals with the computational aspects of collective decision making. This handbook, written by thirty-six prominent members of the computational social choice community, covers the field comprehensively. Chapters devoted to each of the field's major themes offer detailed introductions. Topics include voting theory (such as the computational complexity of winner determination and manipulation in elections), fair allocation (such as algorithms for dividing divisible and indivisible goods), coalition formation (such as matching and hedonic games), and many more. Graduate students, researchers, and professionals in computer science, economics, mathematics, political science, and philosophy will benefit from this accessible and self-contained book.

[1]  Ryszard Kowalczyk,et al.  Majority-rule-based preference aggregation on multi-attribute domains with CP-nets , 2011, AAMAS.

[2]  Jeffrey S. Banks,et al.  Voting games, indifference, and consistent sequential choice rules , 1988 .

[3]  Jonathan K. Hodge,et al.  The potential of iterative voting to solve the separability problem in referendum elections , 2013, Theory and Decision.

[4]  Jörg Rothe,et al.  Control complexity in Bucklin and fallback voting: An experimental analysis , 2015, J. Comput. Syst. Sci..

[5]  Piotr Faliszewski,et al.  Possible Winners in Noisy Elections , 2012, AAAI.

[6]  Piotr Faliszewski,et al.  Probabilistic Possible Winner Determination , 2010, AAAI.

[7]  Felix Brandt,et al.  On Popular Random Assignments , 2013, SAGT.

[8]  Ulrich Endriss,et al.  Conditional Importance Networks: A Graphical Language for Representing Ordinal, Monotonic Preferences over Sets of Goods , 2009, IJCAI.

[9]  B. Peleg,et al.  Introduction to the Theory of Cooperative Games , 1983 .

[10]  Kevin Leyton-Brown,et al.  Proceedings of the 13th ACM Conference on Electronic Commerce, EC 2012, Valencia, Spain, June 4-8, 2012 , 2012, EC.

[11]  Nadja Betzler,et al.  Parameterized complexity of candidate control in elections and related digraph problems , 2008, Theor. Comput. Sci..

[12]  Jérôme Lang,et al.  Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity , 2005, IJCAI.

[13]  Piotr Faliszewski,et al.  Achieving fully proportional representation is easy in practice , 2013, AAMAS.

[14]  Andrea Scozzari,et al.  The give-up problem for blocked regional lists with multi-winners , 2011, Math. Soc. Sci..

[15]  Fuad Aleskerov,et al.  Degree of manipulability of social choice procedures , 1999 .

[16]  Amartya Sen,et al.  A Possibility Theorem on Majority Decisions , 1966 .

[17]  Noga Alon,et al.  Ranking Tournaments , 2006, SIAM J. Discret. Math..

[18]  Makoto Yokoo,et al.  False-name-proof mechanism design without money , 2011, AAMAS.

[19]  José Alcalde,et al.  Top dominance and the possibility of strategy-proof stable solutions to matching problems , 1994 .

[20]  Yoram Bachrach,et al.  Reliability Weighted Voting Games , 2013, SAGT.

[21]  Toby Walsh,et al.  Restricted Manipulation in Iterative Voting: Condorcet Efficiency and Borda Score , 2013, ADT.

[22]  Sylvain Bouveret,et al.  Characterizing conflicts in fair division of indivisible goods using a scale of criteria , 2016, Autonomous Agents and Multi-Agent Systems.

[23]  Felix Brandt,et al.  A tournament of order 24 with two disjoint TEQ-retentive sets , 2013, ArXiv.

[24]  Steven J. Brams,et al.  The win-win solution - guaranteeing fair shares to everybody , 1999 .

[25]  Gabriella Pigozzi,et al.  Judgment aggregation rules based on minimization , 2011, TARK XIII.

[26]  Peter C. Fishburn,et al.  Monotonicity paradoxes in the theory of elections , 1982, Discret. Appl. Math..

[27]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

[28]  Michel Balinski,et al.  Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) , 2000, Discret. Appl. Math..

[29]  James M. Buchanan,et al.  Social Choice, Democracy, and Free Markets , 1954, Journal of Political Economy.

[30]  Alvin E. Roth,et al.  The Economics of Matching: Stability and Incentives , 1982, Math. Oper. Res..

[31]  J. Moon,et al.  On Generalized Tournament Matrices , 1970 .

[32]  Felix A. Fischer,et al.  Computing the minimal covering set , 2008, Math. Soc. Sci..

[33]  Toby Walsh,et al.  Lot-based voting rules , 2012, AAMAS.

[34]  Dinko Dimitrov,et al.  Computational Complexity in Additive Hedonic Games , 2010 .

[35]  Noam Nisan,et al.  Elections Can be Manipulated Often , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[36]  Chi-Jen Lu,et al.  Communication Requirements for Stable Marriages , 2010, CIAC.

[37]  Dominique Lepelley,et al.  Borda rule, Copeland method and strategic manipulation , 2002 .

[38]  Nicholas R. Jennings,et al.  Cooperative Games with Overlapping Coalitions , 2010, J. Artif. Intell. Res..

[39]  Peter J. Coughlan,et al.  A social choice function implementable via backward induction with values in the ultimate uncovered set , 1999 .

[40]  Dennis Leech,et al.  Computing Power Indices for Large Voting Games , 2003, Manag. Sci..

[41]  John R. Chamberlin,et al.  Representative Deliberations and Representative Decisions: Proportional Representation and the Borda Rule , 1983, American Political Science Review.

[42]  William Thomson,et al.  ON THE AXIOMATICS OF RESOURCE ALLOCATION: INTERPRETING THE CONSISTENCY PRINCIPLE , 2012, Economics and Philosophy.

[43]  Salvador Barberà,et al.  A Note on the Impossibility of a Satisfactory Concept of Stability for Coalition Formation Games , 2005 .

[44]  John J. Bartholdi,et al.  Single transferable vote resists strategic voting , 2015 .

[45]  William Thomson,et al.  Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: An update , 2015, Math. Soc. Sci..

[46]  Jörg Rothe,et al.  Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach , 2012, SEA.

[47]  Thierry Marchant,et al.  AND DECISION MODELS : Stepping stones for the analyst , 2003 .

[48]  Vincent Conitzer,et al.  Computational criticisms of the revelation principle , 2004, EC '04.

[49]  Ariel D. Procaccia,et al.  Failure-aware kidney exchange , 2013, EC '13.

[50]  Vincent Conitzer.  Eliciting single-peaked preferences using comparison queries , 2007, AAMAS '07.

[51]  Nicolas de Condorcet.  Essai Sur L'Application de L'Analyse a la Probabilite Des Decisions Rendues a la Pluralite Des Voix , 2009 .

[52]  Rafael Pass,et al.  Approximately Strategy-Proof Voting , 2011, IJCAI.

[53]  Edith Hemaspaandra,et al.  The complexity of Kemeny elections , 2005, Theor. Comput. Sci..

[54]  Vincent Conitzer,et al.  A Maximum Likelihood Approach towards Aggregating Partial Orders , 2011, IJCAI.

[55]  P. Fishburn.  Probabilistic Social Choice Based on Simple Voting Comparisons , 1984 .

[56]  Larry Samuelson,et al.  Matching with Incomplete Information , 2012 .

[57]  Keith Dowding,et al.  In Praise of Manipulation , 2007, British Journal of Political Science.

[58]  C. List,et al.  Aggregating Sets of Judgments: An Impossibility Result , 2002, Economics and Philosophy.

[59]  T. Driessen.  Cooperative Games, Solutions and Applications , 1988 .

[60]  Jörg Rothe,et al.  Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods , 2014, Discret. Appl. Math..

[61]  I. Milchtaich,et al.  Congestion Games with Player-Specific Payoff Functions , 1996 .

[62]  Marina Meila,et al.  Dirichlet Process Mixtures of Generalized Mallows Models , 2010, UAI.

[63]  Yves Sprumont.  The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule , 1991 .

[64]  K. Ladha.  Information pooling through majority-rule voting: Condorcet's jury theorem with correlated votes , 1995 .

[65]  Tobias Nipkow,et al.  Social Choice Theory in HOL , 2009, Journal of Automated Reasoning.

[66]  Lewis A. Kornhauser,et al.  Voting Simply in the Election of Assemblies , 1991 .

[67]  Piotr Faliszewski,et al.  Coalitional Voting Manipulation: A Game-Theoretic Perspective , 2011, IJCAI.

[68]  A. A. J. Marley,et al.  Behavioral Social Choice - Probabilistic Models, Statistical Inference, and Applications , 2006 .

[69]  Lin Zhou.  On a conjecture by gale about one-sided matching problems , 1990 .

[70]  Shimon Even,et al.  A note on cake cutting , 1984, Discret. Appl. Math..

[71]  Katarína Cechlárová,et al.  Stability in coalition formation games , 2000, Int. J. Game Theory.

[72]  Piotr Faliszewski,et al.  Rationalizations of Condorcet-consistent rules via distances of hamming type , 2010, Soc. Choice Welf..

[73]  Kurt Mehlhorn,et al.  Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem , 2007, TALG.

[74]  Francesca Rossi,et al.  Multi-Agent Soft Constraint Aggregation via Sequential Voting , 2011, IJCAI.

[75]  Eric McDermid.  A 3/2-Approximation Algorithm for General Stable Marriage , 2009, ICALP.

[76]  K. Arrow.  A Difficulty in the Concept of Social Welfare , 1950, Journal of Political Economy.

[77]  J. Marden.  Analyzing and Modeling Rank Data , 1996 .

[78]  William Thomson,et al.  The Fair Division of a Fixed Supply Among a Growing Population , 1983, Math. Oper. Res..

[79]  Gerhard J. Woeginger,et al.  Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard , 2011, IJCAI.

[80]  Yonatan Aumann,et al.  The Efficiency of Fair Division with Connected Pieces , 2010, WINE.

[81]  Vincent Conitzer,et al.  A scheduling approach to coalitional manipulation , 2010, EC '10.

[82]  Katarína Cechlárová.  Stable Partition Problem , 2016, Encyclopedia of Algorithms.

[83]  L. Shapley,et al.  College Admissions and the Stability of Marriage , 1962 .

[84]  W. Thomson.  Fair Allocation Rules , 2011 .

[85]  Jörg Rothe,et al.  Computational complexity and approximability of social welfare optimization in multiagent resource allocation , 2012, Autonomous Agents and Multi-Agent Systems.

[86]  M. Balinski,et al.  Majority Judgment: Measuring, Ranking, and Electing , 2011 .

[87]  Ronen I. Brafman,et al.  CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements , 2011, J. Artif. Intell. Res..

[88]  Elchanan Mossel,et al.  On approximately fair allocations of indivisible goods , 2004, EC '04.

[89]  Shigehiro Serizawa,et al.  An impossibility theorem for matching problems , 2010, Soc. Choice Welf..

[90]  Bhaskar Dutta,et al.  Comparison functions and choice correspondences , 1999 .

[91]  G. Debreu.  Mathematical Economics: Representation of a preference ordering by a numerical function , 1983 .

[92]  Zajj Daugherty,et al.  An Introduction to Voting Theory , 2004 .

[93]  Lirong Xia,et al.  Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains , 2012, CP.

[94]  Ilan Nehama,et al.  Approximately classic judgement aggregation , 2010, Annals of Mathematics and Artificial Intelligence.

[95]  Ronald R. Yager,et al.  On ordered weighted averaging aggregation operators in multicriteria decision-making , 1988 .

[96]  Washington Dc,et al.  A MODEL OF STRATEGIC APPROVAL VOTING IN A LARGE ELECTORATE , 2009 .

[97]  Robert W. Irving,et al.  The Complexity of Counting Stable Marriages , 1986, SIAM J. Comput..

[98]  Piotr Faliszewski,et al.  Good Rationalizations of Voting Rules , 2010, AAAI.

[99]  S. Shapiro,et al.  Mathematics without Numbers , 1993 .

[100]  Lirong Xia,et al.  Generalized scoring rules: a framework that reconciles Borda and Condorcet , 2013, SECO.

[101]  R. L. Keeney,et al.  Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[102]  Jerry S. Kelly,et al.  STRATEGY-PROOFNESS AND SOCIAL CHOICE FUNCTIONS WITHOUT SINGLEVALUEDNESS , 1977 .

[103]  Felix A. Fischer,et al.  The Price of Neutrality for the Ranked Pairs Method , 2012, AAAI.

[104]  Toby Walsh,et al.  Manipulating two stage voting rules , 2013, AAMAS.

[105]  Bruno Simeone,et al.  Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment , 2012, Networks.

[106]  Arunava Sen,et al.  Ordinally Bayesian incentive compatible voting rules , 2004 .

[107]  Jana Hajduková,et al.  Coalition Formation Games: a Survey , 2006, IGTR.

[108]  Eytan Ronn,et al.  NP-Complete Stable Matching Problems , 1990, J. Algorithms.

[109]  Lane A. Hemaspaandra,et al.  Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control , 2015, Annals of Mathematics and Artificial Intelligence.

[110]  Emerson M. S. Niou.  A note on Nanson's rule , 1987 .

[111]  David P. Williamson,et al.  Deterministic pivoting algorithms for constrained ranking and clustering problems , 2007, SODA '07.

[112]  Curtis Menton,et al.  Normalized Range Voting Broadly Resists Control , 2010, Theory of Computing Systems.

[113]  Shlomo Weber,et al.  Gamson’s law and hedonic games , 2007, Soc. Choice Welf..

[114]  Georges Bordes,et al.  Consistency, Rationality and Collective Choice , 1976 .

[115]  Ariel D. Procaccia,et al.  Algorithms for strategyproof classification , 2012, Artif. Intell..

[116]  R. Graham,et al.  Spearman's Footrule as a Measure of Disarray , 1977 .

[117]  Christian List,et al.  The theory of judgment aggregation: an introductory review , 2012, Synthese.

[118]  Toby Walsh,et al.  Fair assignment of indivisible objects under ordinal preferences , 2013, AAMAS.

[119]  Donald G. Saari,et al.  Condorcet Domains: A Geometric Perspective , 2007, The Mathematics of Preference, Choice and Order.

[120]  Moshe Tennenholtz,et al.  Approximate mechanism design without money , 2009, EC '09.

[121]  Andrea Pacifici,et al.  On multi-agent knapsack problems , 2009 .

[122]  Maria Silvia Pini,et al.  Bribery in Voting Over Combinatorial Domains Is Easy , 2012, ISAIM.

[123]  H. Moulin.  Uniform externalities: Two axioms for fair allocation , 1990 .

[124]  Bettina Klaus,et al.  Strategy-Proofness Makes the Difference: Deferred-Acceptance with Responsive Priorities , 2012, Math. Oper. Res..

[125]  Craig Boutilier,et al.  The unavailable candidate model: a decision-theoretic view of social choice , 2010, EC '10.

[126]  Vahab S. Mirrokni,et al.  Uncoordinated Two-Sided Matching Markets , 2011, SIAM J. Comput..

[127]  Jörg Rothe,et al.  Preference Aggregation by Voting , 2016, Economics and Computation.

[128]  Ying Wang,et al.  Cutting a Cake for Five People , 2009, AAIM.

[129]  Patrice Perny,et al.  LP Solvable Models for Multiagent Fair Allocation Problems , 2010, ECAI.

[130]  R. Aumann,et al.  Game theoretic analysis of a bankruptcy problem from the Talmud , 1985 .

[131]  David Manlove,et al.  Hard variants of stable marriage , 2002, Theor. Comput. Sci..

[132]  Makoto Yokoo,et al.  The effect of false-name bids in combinatorial auctions: new fraud in internet auctions , 2004, Games Econ. Behav..

[133]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[134]  Jörg Rothe,et al.  The complexity of voter partition in Bucklin and fallback voting: solving three open problems , 2011, AAMAS.

[135]  Edith Elkind,et al.  Manipulation under voting rule uncertainty , 2012, AAMAS.

[136]  Lirong Xia,et al.  Deciphering Young’s interpretation of Condorcet’s model , 2014 .

[137]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[138]  Ariel D. Procaccia,et al.  Truth, justice, and cake cutting , 2010, Games Econ. Behav..

[139]  Moshe Tennenholtz,et al.  Incentive compatible ranking systems , 2007, AAMAS '07.

[140]  Yann Chevaleyre,et al.  New Candidates Welcome! Possible Winners with respect to the Addition of New Candidates , 2011, Math. Soc. Sci..

[141]  M. Utku Ünver,et al.  Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration , 2006, Int. J. Game Theory.

[142]  Narges Simjour.  Improved Parameterized Algorithms for the Kemeny Aggregation Problem , 2009, IWPEC.

[143]  Xiaotie Deng,et al.  On the complexity of equilibria , 2002, STOC '02.

[144]  Vincent Conitzer,et al.  Nonexistence of Voting Rules That Are Usually Hard to Manipulate , 2006, AAAI.

[145]  Bhaskar Dutta.  Covering sets and a new condorcet choice correspondence , 1988 .

[146]  Alvin E. Roth,et al.  Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis , 1990 .

[147]  Evangelos Markakis,et al.  Approximating power indices: theoretical and empirical analysis , 2010, Autonomous Agents and Multi-Agent Systems.

[148]  Piotr Faliszewski,et al.  On the role of distances in defining voting rules , 2010, AAMAS.

[149]  Felix Brandt,et al.  Minimal stable sets in tournaments , 2008, J. Econ. Theory.

[150]  Atila Abdulkadiroglu,et al.  RANDOM SERIAL DICTATORSHIP AND THE CORE FROM RANDOM ENDOWMENTS IN HOUSE ALLOCATION PROBLEMS , 1998 .

[151]  Felix Brandt,et al.  Necessary and sufficient conditions for the strategyproofness of irresolute social choice functions , 2011, TARK XIII.

[152]  Michel Truchon.  Borda and the maximum likelihood approach to vote aggregation , 2008, Math. Soc. Sci..

[153]  Lirong Xia,et al.  Computing the margin of victory for various voting rules , 2012, EC '12.

[154]  David A. Freedman,et al.  Machiavelli and the Gale-Shapley Algorithm , 1981 .

[155]  Felix Brandt,et al.  Finding strategyproof social choice functions via SAT solving , 2014, AAMAS.

[156]  Jérôme Monnot,et al.  Fair solutions for some multiagent optimization problems , 2013, Autonomous Agents and Multi-Agent Systems.

[157]  A. Roth.  The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.

[158]  Patrice Perny,et al.  Preference Aggregation with Graphical Utility Models , 2008, AAAI.

[159]  Xiaotie Deng,et al.  On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..

[160]  J. Banks,et al.  Positive Political Theory I: Collective Preference , 1998 .

[161]  Yan Yu,et al.  Strategic divide and choose , 2008, Games Econ. Behav..

[162]  Karine Van der Straeten,et al.  Vote Au Pluriel: How People Vote When Offered to Vote Under Different Rules? , 2013 .

[163]  Dmitry Ryvkin,et al.  The selection efficiency of tournaments , 2010, Eur. J. Oper. Res..

[164]  Nadja Betzler,et al.  Towards a dichotomy for the Possible Winner problem in elections based on scoring rules , 2009, J. Comput. Syst. Sci..

[165]  M. Satterthwaite.  Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions , 1975 .

[166]  Andreas Björklund,et al.  Fourier meets möbius: fast subset convolution , 2006, STOC '07.

[167]  Edith Elkind,et al.  Complexity of Safe Strategic Voting , 2010, SAGT.

[168]  Toby Walsh,et al.  Complexity of and Algorithms for Borda Manipulation , 2011, AAAI.

[169]  Jack M. Robertson,et al.  Cake-cutting algorithms - be fair if you can , 1998 .

[170]  Ayzerman,et al.  Theory of choice , 1995 .

[171]  Piotr Faliszewski,et al.  Combinatorial voter control in elections , 2014, Theor. Comput. Sci..

[172]  Ariel D. Procaccia,et al.  Voting almost maximizes social welfare despite limited communication , 2010, Artif. Intell..

[173]  Vincent Conitzer,et al.  Stackelberg Voting Games: Computational Aspects and Paradoxes , 2010, AAAI.

[174]  M. Kendall.  A NEW MEASURE OF RANK CORRELATION , 1938 .

[175]  Parag A. Pathak,et al.  The New York City High School Match , 2005 .

[176]  Manabu Toda,et al.  Monotonicity and Consistency in Matching Markets , 2006, Int. J. Game Theory.

[177]  Jim Kadin,et al.  P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP , 1989, J. Comput. Syst. Sci..

[178]  Paul D. Seymour,et al.  A counterexample to a conjecture of Schwartz , 2013, Soc. Choice Welf..

[179]  Felix Brandt,et al.  Extending tournament solutions , 2014, Social Choice and Welfare.

[180]  S. Berg.  Condorcet's jury theorem, dependency among jurors , 1993 .

[181]  Bernard Monjardet.  Statement of precedence and a comment on IIA terminology , 2008, Games Econ. Behav..

[182]  Szilvia Pápai,et al.  Unique stability in simple coalition formation games , 2000, Games Econ. Behav..

[183]  R. Forthofer,et al.  Rank Correlation Methods , 1981 .

[184]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[185]  Craig Boutilier,et al.  CP-nets: a tool for represent-ing and reasoning with conditional ceteris paribus state-ments , 2004 .

[186]  Arunava Sen,et al.  Strategy-proof Social Choice Correspondences , 2001, J. Econ. Theory.

[187]  Toby Walsh,et al.  Manipulation of Nanson's and Baldwin's Rules , 2011, AAAI.

[188]  Piotr Faliszewski,et al.  How Hard is Control in Single-Crossing Elections? , 2014, ECAI.

[189]  Yann Chevaleyre,et al.  Compiling the votes of a subelectorate , 2009, IJCAI 2009.

[190]  Vincent Conitzer,et al.  Dominating Manipulations in Voting with Partial Information , 2011, AAAI.

[191]  Jörg Rothe,et al.  Exact Complexity of the Winner Problem for Young Elections , 2001, Theory of Computing Systems.

[192]  Gerhard J. Woeginger,et al.  Banks winners in tournaments are difficult to recognize , 2003, Soc. Choice Welf..

[193]  Sara L. Uckelman,et al.  Strategy and Manipulation in Medieval Elections , 2008 .

[194]  Andrea Scozzari,et al.  Weighted Voronoi region algorithms for political districting , 2008, Math. Comput. Model..

[195]  Olivier Spanjaard,et al.  Bounded Single-Peaked Width and Proportional Representation , 2012, ECAI.

[196]  Elchanan Mossel,et al.  Truthful Fair Division , 2010, SAGT.

[197]  Marco Schaerf,et al.  Arbitration (or How to Merge Knowledge Bases) , 1998, IEEE Trans. Knowl. Data Eng..

[198]  Jörg Rothe,et al.  Bribery in multiple-adversary path-disruption games is hard for the second level of the polynomial hierarchy , 2014, AAMAS.

[199]  Xiaotie Deng,et al.  Algorithmic Solutions for Envy-Free Cake Cutting , 2012, Oper. Res..

[200]  Gerhard J. Woeginger,et al.  Vote trading and subset sums , 2015, Oper. Res. Lett..

[201]  Eric Bauer,et al.  An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants , 1999, Machine Learning.

[202]  B. Debord.  Caractérisation des matrices des préférences nettes et méthodes d'agrégation associées , 1987 .

[203]  Ulrich Pferschy,et al.  Maximizing the minimum voter satisfaction on spanning trees , 2009, Math. Soc. Sci..

[204]  H. Peyton Young,et al.  Individual Strategy and Social Structure , 2020 .

[205]  Fahiem Bacchus,et al.  Graphical models for preference and utility , 1995, UAI.

[206]  Geoffrey Pritchard,et al.  Approximability of Dodgson’s rule , 2008, Soc. Choice Welf..

[207]  Eric Budish,et al.  The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.

[208]  Piotr Faliszewski,et al.  Cloning in Elections: Finding the Possible Winners , 2011, J. Artif. Intell. Res..

[209]  Piotr Faliszewski,et al.  How hard is control in single-crossing elections? , 2014, Autonomous Agents and Multi-Agent Systems.

[210]  Vincent Conitzer,et al.  How hard is it to control sequential elections via the agenda , 2009, IJCAI 2009.

[211]  Noam Nisan,et al.  Incentive Compatible Two Player Cake Cutting , 2012, WINE.

[212]  Thomas Schwartz.  Cyclic tournaments and cooperative majority voting: A solution , 1990 .

[213]  Lirong Xia,et al.  How Many Vote Operations Are Needed to Manipulate A Voting System? , 2012, ArXiv.

[214]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[215]  William S. Zwicker,et al.  Which Scoring Rule Maximizes Condorcet Efficiency Under Iac? , 2005 .

[216]  H. Moulin.  Axioms of Cooperative Decision Making , 1988 .

[217]  Bettina Klaus,et al.  Median Stable Matching for College Admissions , 2006, Int. J. Game Theory.

[218]  Ariel D. Procaccia,et al.  Average-case tractability of manipulation in voting via the fraction of manipulators , 2007, AAMAS '07.

[219]  Jesús Mario Bilbao,et al.  Voting power in the European Union enlargement , 2002, Eur. J. Oper. Res..

[220]  Douglas Muzzio,et al.  APPROVAL VOTING , 1983 .

[221]  Sarit Kraus,et al.  On the evaluation of election outcomes under uncertainty , 2008, Artif. Intell..

[222]  Klaus Nehring,et al.  The Structure of Strategy-Proof Social Choice Part II: Non-Dictatorship, Anonymity and Neutrality * , 2005 .

[223]  Piotr Faliszewski,et al.  Multimode Control Attacks on Elections , 2009, IJCAI.

[224]  Ariel D. Procaccia,et al.  Junta distributions and the average-case complexity of manipulating elections , 2006, AAMAS '06.

[225]  Arkadii Slinko,et al.  Approximability and Computational Feasibility of Dodgson's Rule , 2006 .

[226]  Moni Naor,et al.  Rank aggregation methods for the Web , 2001, WWW '01.

[227]  Vincent Conitzer,et al.  Voting on Multiattribute Domains with Cyclic Preferential Dependencies , 2008, AAAI.

[228]  Piotr Faliszewski,et al.  AI's War on Manipulation: Are We Winning? , 2010, AI Mag..

[229]  Piotr Faliszewski,et al.  The complexity of fully proportional representation for single-crossing electorates , 2013, Theor. Comput. Sci..

[230]  Vincent Conitzer,et al.  Strategic Voting and Strategic Candidacy , 2015, AAAI.

[231]  William S. Zwicker,et al.  Monotonicity properties and their adaptation to irresolute social choice rules , 2012, Soc. Choice Welf..

[232]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[233]  Toby Walsh,et al.  A Social Welfare Optimal Sequential Allocation Procedure , 2013, IJCAI.

[234]  Ramanathan V. Guha,et al.  Propagation of trust and distrust , 2004, WWW '04.

[235]  H. Young.  Optimal Voting Rules , 1995 .

[236]  Alvin E. Roth.  Deferred acceptance algorithms: history, theory, practice, and open questions , 2008, Int. J. Game Theory.

[237]  Piotr Faliszewski,et al.  Clone structures in voters' preferences , 2011, EC '12.

[238]  Dan S. Felsenthal,et al.  The measurement of voting power , 1998 .

[239]  Toby Walsh,et al.  Local Search Approaches in Stable Matching Problems , 2013, Algorithms.

[240]  Piotr Faliszewski,et al.  On distance rationalizability of some voting rules , 2009, TARK '09.

[241]  Rolf Niedermeier,et al.  Fixed-parameter algorithms for Kemeny rankings , 2009, Theor. Comput. Sci..

[242]  Vincent Conitzer,et al.  Anonymity-Proof Voting Rules , 2008, WINE.

[243]  Edith Elkind,et al.  Condorcet winning sets , 2015, Soc. Choice Welf..

[244]  Costas Busch,et al.  Cake-Cutting Is Not a Piece of Cake , 2003, STACS.

[245]  Marco Dall'Aglio,et al.  Maximin share and minimax envy in fair-division problems , 2003 .

[246]  Ulrich Endriss,et al.  Ontology Merging as Social Choice , 2011, CLIMA.

[247]  Nadja Betzler,et al.  On the Computation of Fully Proportional Representation , 2011, J. Artif. Intell. Res..

[248]  William Thomson.  Notions of equal, or equivalent, opportunities , 1994 .

[249]  Ning Chen,et al.  Optimal Proportional Cake Cutting with Connected Pieces , 2012, AAAI.

[250]  Craig Boutilier,et al.  Social Choice : From Consensus to Personalized Decision Making , 2011 .

[251]  David Manlove,et al.  The Hospitals/Residents Problem with Ties , 2000, SWAT.

[252]  Nicholas R. Miller.  A New Solution Set for Tournaments and Majority Voting: Further Graph- Theoretical Approaches to the Theory of Voting , 1980 .

[253]  Sébastien Konieczny,et al.  Merging Information Under Constraints: A Logical Framework , 2002, J. Log. Comput..

[254]  Felix Brandt,et al.  Set-rationalizable choice and self-stability , 2009, J. Econ. Theory.

[255]  Sandy Scott,et al.  A Study Of Stable Marriage Problems With Ties , 2005 .

[256]  Edith Elkind,et al.  Games Gibbard – Satterthwaite Manipulators Play , 2014 .

[257]  S. Berg.  Paradox of voting under an urn model: The effect of homogeneity , 1985 .

[258]  Jon Rokne,et al.  Encyclopedia of Social Network Analysis and Mining , 2014, Springer New York.

[259]  Mark A. Schulze,et al.  A New Monotonic and Clone-Independent Single-Winner Election Method , 2003 .

[260]  Felix Brandt,et al.  On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice , 2014, AAAI.

[261]  Gerhard J. Woeginger,et al.  Two hardness results for core stability in hedonic coalition formation games , 2013, Discret. Appl. Math..

[262]  Avinatan Hassidim,et al.  Computing socially-efficient cake divisions , 2012, AAMAS.

[263]  Parag A. Pathak,et al.  Appendix to "Incentives and Stability in Large Two-Sided Matching Markets" , 2009 .

[264]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[265]  Felix A. Fischer,et al.  Cooperative Information Agents XI , 2008 .

[266]  Haris Aziz.  Stable marriage and roommate problems with individual-based stability , 2013, AAMAS.

[267]  Yoshiko Wakabayashi.  The Complexity of Computing Medians of Relations , 1998 .

[268]  Tamás Fleiner,et al.  Egerváry Research Group on Combinatorial Optimization on the Stable B-matching Polytope on the Stable B-matching Polytope , 2022 .

[269]  Jörg Rothe,et al.  The complexity of probabilistic lobbying , 2014, Discret. Optim..

[270]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[271]  Mehmet Karakaya,et al.  Hedonic coalition formation games: A new stability notion , 2011, Math. Soc. Sci..

[272]  Denis Bouyssou,et al.  Monotonicity of ‘ranking by choosing’: A progress report , 2004, Soc. Choice Welf..

[273]  A. Roth,et al.  Random paths to stability in two-sided matching , 1990 .

[274]  Hervé Moulin,et al.  Fair division and collective welfare , 2003 .

[275]  Moshe Tennenholtz,et al.  An axiomatic approach to personalized ranking systems , 2007, JACM.

[276]  Yann Chevaleyre,et al.  Compilation and communication protocols for voting rules with a dynamic set of candidates , 2011, TARK XIII.

[277]  Haris Aziz,et al.  A note on the undercut procedure , 2013, AAMAS.

[278]  Lars-Gunnar Svensson.  Strategy-proof allocation of indivisible goods , 1999 .

[279]  Gérard Verfaillie,et al.  Exploiting a Common Property Resource under a Fairness Constraint: a Case Study , 1999, IJCAI.

[280]  F. Klijn,et al.  A Many-to-Many 'Rural Hospital Theorem' , 2014 .

[281]  Franz Dietrich,et al.  A generalised model of judgment aggregation , 2007, Soc. Choice Welf..

[282]  D. Herreiner,et al.  Envy Freeness in Experimental Fair Division Problems , 2009 .

[283]  Nicolas Maudet,et al.  On the Communication Complexity of Multilateral Trading: Extended Report , 2005, Autonomous Agents and Multi-Agent Systems.

[284]  A. Gibbard.  Manipulation of Schemes That Mix Voting with Chance , 1977 .

[285]  Jérôme Lang,et al.  Expressive Power and Succinctness of Propositional Languages for Preference Representation , 2004, KR.

[286]  Piotr Faliszewski,et al.  Boolean combinations of weighted voting games , 2009, AAMAS.

[287]  D. Gale,et al.  Fair Allocation of Indivisible Goods and Criteria of Justice , 1991 .

[288]  Kishan G. Mehrotra,et al.  A Game Theoretic Framework for Community Detection , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[289]  David S. Ahn,et al.  Combinatorial Voting ∗ , 2008 .

[290]  Leonard J. Savage,et al.  The Theory of Statistical Decision , 1951 .

[291]  S. Brams,et al.  Better Ways to Cut a Cake , 2006 .

[292]  Jörg Rothe,et al.  Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols , 2009, WINE.

[293]  Dirk van Dalen,et al.  Logic and structure , 1980 .

[294]  Rolf Niedermeier,et al.  A Multivariate Complexity Analysis of Lobbying in Multiple Referenda , 2012, AAAI.

[295]  Josep Freixas,et al.  Anonymous yes-no voting with abstention and multiple levels of approval , 2009, Games Econ. Behav..

[296]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[297]  Piotr Faliszewski,et al.  An NTU Cooperative Game Theoretic View of Manipulating Elections , 2011, WINE.

[298]  Peter J. Hammond,et al.  Interpersonal Comparisons of Well-being: Interpersonal comparisons of utility: Why and how they are and should be made , 1990 .

[299]  Gerhard J. Woeginger,et al.  Are there any nicely structured preference profiles nearby? , 2013, Math. Soc. Sci..

[300]  Zizhuo Wang,et al.  A unified framework for dynamic pari-mutuel information market design , 2009, EC '09.

[301]  Peter Z. Revesz,et al.  On the Semantics of Arbitration , 1997, Int. J. Algebra Comput..

[302]  H. Young.  Condorcet's Theory of Voting , 1988, American Political Science Review.

[303]  Jonathan K. Hodge,et al.  Separable discrete preferences , 2005, Math. Soc. Sci..

[304]  Lirong Xia,et al.  Voting in Combinatorial Domains , 2016, Handbook of Computational Social Choice.

[305]  John Duggan,et al.  Mixed refinements of Shapley's saddles and weak tournaments , 2001, Soc. Choice Welf..

[306]  A. Roth,et al.  School Choice , 2022, SSRN Electronic Journal.

[307]  Stephen Gordon,et al.  Social choice, optimal inference and figure skating , 2008, Soc. Choice Welf..

[308]  Donald G. Saari,et al.  A geometric examination of Kemeny's rule , 2000, Soc. Choice Welf..

[309]  Craig Boutilier,et al.  Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs , 2011, ADT.

[310]  Jörg Rothe,et al.  A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation , 2013, Annals of Mathematics and Artificial Intelligence.

[311]  Tim Roughgarden,et al.  Proceedings of the 12th ACM conference on Electronic commerce , 2011, EC 2011.

[312]  P. Pettit.  Deliberative Democracy and the Discursive Dilemma , 2001 .

[313]  Robert W. Irving.  An Efficient Algorithm for the "Stable Roommates" Problem , 1985, J. Algorithms.

[314]  Gary W. Cox,et al.  Making Votes Count: Strategic Coordination in the World's Electoral Systems , 1997 .

[315]  Jeffrey Richelson.  Some Further Results on Consistency, Rationality and Collective Choice , 1978 .

[316]  Andrea Scozzari,et al.  Bidimensional allocation of seats via zero-one matrices with given line sums , 2014, Ann. Oper. Res..

[317]  Hervé Moulin,et al.  A New Solution to the Random Assignment Problem , 2001, J. Econ. Theory.

[318]  David C. Fisher,et al.  Optimal strategies for random tournament games , 1995 .

[319]  Felix Brandt,et al.  A note on the McKelvey uncovered set and Pareto optimality , 2016, Soc. Choice Welf..

[320]  Bettina Klaus,et al.  Resource-monotonicity for house allocation problems , 2004, Int. J. Game Theory.

[321]  Elchanan Mossel,et al.  A quantitative Gibbard-Satterthwaite theorem without neutrality , 2011, STOC '12.

[322]  Eric McDermid,et al.  Popular matchings: structure and algorithms , 2011, J. Comb. Optim..

[323]  R. Shepard.  Stimulus and response generalization: A stochastic model relating generalization to distance in psychological space , 1957 .

[324]  Edith Elkind,et al.  The Complexity of Safe Manipulation under Scoring Rules , 2011, IJCAI.

[325]  Shmuel Nitzan,et al.  Optimal Decision Rules in Uncertain Dichotomous Choice Situations , 1982 .

[326]  Jean Lainé,et al.  Condorcet choice and the Ostrogorski paradox , 2009, Soc. Choice Welf..

[327]  Tuomas Sandholm.  Agents in Electronic Commerce: Component Technologies for Automated Negotiation and Coalition Formation , 2004, Autonomous Agents and Multi-Agent Systems.

[328]  Carlos Guestrin,et al.  Riffled Independence for Ranked Data , 2009, NIPS.

[329]  Toby Walsh,et al.  How Hard Is It to Control an Election by Breaking Ties? , 2013, ECAI.

[330]  Michael Wooldridge,et al.  Computational Aspects of Cooperative Game Theory , 2011, KES-AMSTA.

[331]  David Schmeidler,et al.  Fair Net Trades , 1972 .

[332]  Ulrich Endriss,et al.  Iterated Majority Voting , 2009, ADT.

[333]  P. Fishburn,et al.  Condorcet's paradox and anonymous preference profiles , 1976 .

[334]  Mihalis Yannakakis,et al.  Equilibria, Fixed Points, and Complexity Classes , 2008, STACS.

[335]  H. Peyton Young,et al.  Equity - in theory and practice , 1994 .

[336]  Felix Brandt,et al.  Minimal retentive sets in tournaments , 2014, Soc. Choice Welf..

[337]  H. Chernoff.  Rational Selection of Decision Functions , 1954 .

[338]  T. Schwartz.  Rationality and the Myth of the Maximum , 1972 .

[339]  Jerry R. Green,et al.  Assent-maximizing social choice , 2013, Soc. Choice Welf..

[340]  Walid Saad,et al.  Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents , 2010, IEEE Transactions on Mobile Computing.

[341]  Haris Aziz,et al.  Existence of stability in hedonic coalition formation games , 2012, AAMAS.

[342]  Peter C. Fishburn,et al.  Utility theory for decision making , 1970 .

[343]  Shmuel Nitzan,et al.  The Optimal Decision Rule for Fixed-Size Committees in Dichotomous Choice Situations: The General Result , 1997 .

[344]  Irène Charon,et al.  A survey on the linear ordering problem for weighted or unweighted tournaments , 2007, 4OR.

[345]  Olivier Hudry,et al.  On the complexity of Slater's problems , 2010, Eur. J. Oper. Res..

[346]  Vincent Conitzer,et al.  Paradoxes of Multiple Elections: An Approximation Approach , 2012, KR.

[347]  Ariel D. Procaccia,et al.  On Maxsum Fair Cake Divisions , 2012, AAAI.

[348]  J. Laffont.  Aggregation and revelation of preferences , 1979 .

[349]  Stefan Burr,et al.  The Mathematics of networks , 1982 .

[350]  Toby Walsh,et al.  Winner determination in voting trees with incomplete preferences and weighted votes , 2011, Autonomous Agents and Multi-Agent Systems.

[351]  Noga Alon,et al.  Bundling Attacks in Judgment Aggregation , 2013, AAAI.

[352]  André Blais,et al.  Direct presidential elections: a world summary , 1997 .

[353]  Franz Dietrich.  Scoring rules for judgment aggregation , 2014, Soc. Choice Welf..

[354]  Murat R. Sertel,et al.  Strong equilibrium outcomes of voting games ¶are the generalized Condorcet winners , 2004, Soc. Choice Welf..

[355]  Simina Brânzei,et al.  Simultaneous Cake Cutting , 2014, AAAI.

[356]  Nicholas Mattei,et al.  Empirical Evaluation of Voting Rules with Strictly Ordered Preference Data , 2011, ADT.

[357]  Raffaele Mosca,et al.  How to allocate hard candies fairly , 2007, Math. Soc. Sci..

[358]  Piotr Faliszewski,et al.  Using complexity to protect elections , 2010, Commun. ACM.

[359]  Haris Aziz,et al.  Complexity of coalition structure generation , 2011, AAMAS.

[360]  John G. Kemeny,et al.  Mathematical models in the social sciences , 1964 .

[361]  Craig Boutilier,et al.  Elicitation and Approximately Stable Matching with Partial Preferences , 2013, IJCAI.

[362]  Parag A. Pathak,et al.  The Mechanism Design Approach to Student Assignment , 2011 .

[363]  L. Shapley,et al.  Optimizing group judgmental accuracy in the presence of interdependencies , 1984 .

[364]  Sean M. Horan,et al.  Implementation of Majority Voting Rules , 2013 .

[365]  Yoav Shoham,et al.  Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .

[366]  Shmuel Nitzan,et al.  Collective Preference and Choice , 2009 .

[367]  Edith Elkind,et al.  Equilibria of plurality voting with abstentions , 2010, EC '10.

[368]  Aranyak Mehta,et al.  Some results on approximating the minimax solution in approval voting , 2007, AAMAS '07.

[369]  Alex Pentland,et al.  Time-Critical Social Mobilization , 2010, Science.

[370]  Tobias Nipkow,et al.  Social Choice Theory in HOL Arrow and Gibbard-Satterthwaite , 2009 .

[371]  Rajmohan Rajaraman,et al.  Reducibility among Fractional Stability Problems , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[372]  Nicolas Houy,et al.  Still more on the Tournament Equilibrium Set , 2009, Soc. Choice Welf..

[373]  David C. Mcgarvey.  A THEOREMI ON THE CONSTRUCTION OF VOTING PARADOXES , 1953 .

[374]  H. Moulin.  Priority Rules and Other Asymmetric Rationing Methods , 2000 .

[375]  Nick Baigent.  Metric rationalisation of social choice functions according to principles of social choice , 1987 .

[376]  M. Breton,et al.  Separable preferences, strategyproofness, and decomposability , 1999 .

[377]  Piotr Faliszewski,et al.  The shield that never was: Societies with single-peaked preferences are more open to manipulation and control , 2011, Inf. Comput..

[378]  Dinko Dimitrov,et al.  On Myopic Stability Concepts for Hedonic Games , 2007 .

[379]  Alex D. Scott,et al.  The minimal covering set in large tournaments , 2012, Soc. Choice Welf..

[380]  Robert W. Irving.  Stable Marriage and Indifference , 1994, Discret. Appl. Math..

[381]  Lisa Fleischer,et al.  Simple sybil-proof mechanisms for multi-level marketing , 2012, INFOCOM Workshops.

[382]  A. Laruelle,et al.  A critical reappraisal of some voting power paradoxes , 2005 .

[383]  Olivier Hudry,et al.  NP-hardness results for the aggregation of linear orders into median orders , 2008, Ann. Oper. Res..

[384]  T. Tideman,et al.  Complete independence of clones in the ranked pairs rule , 1989 .

[385]  Yonatan Aumann,et al.  Throw One's Cake - and Eat It Too , 2011, SAGT.

[386]  Craig Boutilier,et al.  Computational Decision Support: Regret-based Models for Optimization and Preference Elicitation , 2012 .

[387]  Marco Scarsini.  A strong paradox of multiple elections , 1998 .

[388]  Jérôme Lang,et al.  Allocation of indivisible goods: a general model and some complexity results , 2005, AAMAS '05.

[389]  J. Deegan,et al.  A new index of power for simplen-person games , 1978 .

[390]  Svetlana Obraztsova,et al.  On the Complexity of Voting Manipulation under Randomized Tie-Breaking , 2011, IJCAI.

[391]  R. Zeckhauser,et al.  The Efficient Allocation of Individuals to Positions , 1979, Journal of Political Economy.

[392]  Ariel D. Procaccia,et al.  Incentive compatible regression learning , 2008, SODA '08.

[393]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[394]  Katarína Cechlárová,et al.  Stability Of Partitions Under WB-Preferences And BW-Preferences , 2004, Int. J. Inf. Technol. Decis. Mak..

[395]  P. Gärdenfors.  Match making: Assignments based on bilateral preferences , 1975 .

[396]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[397]  Rahul Savani,et al.  Computing stable outcomes in hedonic games with voting-based deviations , 2011, AAMAS.

[398]  K. Arrow,et al.  Social Choice and Multicriterion Decision-Making , 1986 .

[399]  Andreas Ortmann,et al.  The Predictive Power of Three Prominent Tournament Formats , 2008, Manag. Sci..

[400]  J. Kelly,et al.  A strategy-proofness characterization of majority rule , 2003 .

[401]  Rudolf Vetschera,et al.  A general branch-and-bound algorithm for fair division problems , 2010, Comput. Oper. Res..

[402]  Arto Salomaa,et al.  ICALP'88: Proceedings of the 15th International Colloquium on Automata, Languages and Programming , 1988 .

[403]  Ulrich Endriss,et al.  Reduction of economic inequality in combinatorial domains , 2013, AAMAS.

[404]  P. Gärdenfors.  A REPRESENTATION THEOREM FOR VOTING WITH LOGICAL CONSEQUENCES , 2006, Economics and Philosophy.

[405]  Maria Polukarov,et al.  New Results on Equilibria in Strategic Candidacy , 2013, SAGT.

[406]  Nicholas R. Miller,et al.  Graph- Theoretical Approaches to the Theory of Voting* , 1977 .

[407]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[408]  Evangelos Markakis,et al.  Approximation Algorithms and Mechanism Design for Minimax Approval Voting , 2010, AAAI.

[409]  Andrew Postlewaite,et al.  Weak Versus Strong Domination in a Market with Indivisible Goods , 1977 .

[410]  Irène Charon,et al.  A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments , 2006, Discret. Appl. Math..

[411]  Toby Walsh,et al.  Aggregating Partially Ordered Preferences , 2009, J. Log. Comput..

[412]  Toby Walsh,et al.  Manipulation complexity and gender neutrality in stable marriage procedures , 2009, Autonomous Agents and Multi-Agent Systems.

[413]  Irène Charon,et al.  An updated survey on the linear ordering problem for weighted or unweighted tournaments , 2010, Ann. Oper. Res..

[414]  Ariel D. Procaccia,et al.  When do noisy votes reveal the truth? , 2013, EC '13.

[415]  Peter Winkler,et al.  Counting linear extensions is #P-complete , 1991, STOC '91.

[416]  Felix Brandt,et al.  Pareto optimality in coalition formation , 2011, Games Econ. Behav..

[417]  William S. Zwicker.  Consistency without neutrality in voting rules: When is a vote an average? , 2008, Math. Comput. Model..

[418]  Philippe De Donder,et al.  Choosing from a weighted tournament , 2000, Math. Soc. Sci..

[419]  Robert A. Connolly,et al.  Tournament Qualification, Seeding and Selection Effciency: An Analysis of the PGA TOUR's FedExCup , 2011 .

[420]  Felix Brandt,et al.  Computing Dominance-Based Solution Concepts , 2012, EC '12.

[421]  Itai Ashlagi,et al.  Stability in Large Matching Markets with Complementarities , 2014, Oper. Res..

[422]  B. Peleg,et al.  Strategy-proof voting schemes with continuous preferences , 1990 .

[423]  Gábor Erdélyi,et al.  Control Complexity in Fallback Voting , 2010, CATS.

[424]  Yoram Singer,et al.  Learning to Order Things , 1997, NIPS.

[425]  Ronald R. Yager,et al.  On ordered weighted averaging aggregation operators in multicriteria decisionmaking , 1988, IEEE Trans. Syst. Man Cybern..

[426]  A. Roth.  The college admissions problem is not equivalent to the marriage problem , 1985 .

[427]  Gabrielle Demange,et al.  The strategy structure of some coalition formation games , 2009, Games Econ. Behav..

[428]  Vincent Conitzer,et al.  Generalized scoring rules and the frequency of coalitional manipulability , 2008, EC '08.

[429]  Felix Brandt,et al.  Incentives for Participation and Abstention in Probabilistic Social Choice , 2015, AAMAS.

[430]  Olivier Hudry.  On the computation of median linear orders, of median complete preorders and of median weak orders , 2012, Math. Soc. Sci..

[431]  Jean-François Laslier,et al.  Tournament Solutions And Majority Voting , 1997 .

[432]  Vincent Conitzer,et al.  A sufficient condition for voting rules to be frequently manipulable , 2008, EC '08.

[433]  William S. Zwicker,et al.  One-way monotonicity as a form of strategy-proofness , 2009, Int. J. Game Theory.

[434]  Jana Hajduková,et al.  Stable partitions with W -preferences , 2004, Discret. Appl. Math..

[435]  Gabriella Pigozzi,et al.  Judgment Aggregation: A Primer , 2014, Judgment Aggregation.

[436]  Ariel D. Procaccia,et al.  Optimal Envy-Free Cake Cutting , 2011, AAAI.

[437]  L. Moser,et al.  On the representation of directed graphs as unions of orderings , 1964 .

[438]  Toby Walsh,et al.  Uncertainty in Preference Elicitation and Aggregation , 2007, AAAI.

[439]  Matthias Messner,et al.  Strong and coalition-proof political equilibria under plurality and runoff rule , 2007, Int. J. Game Theory.

[440]  Atila Abdulkadiroglu,et al.  School Choice: A Mechanism Design Approach , 2003 .

[441]  Pierluigi Crescenzi,et al.  Introduction to the theory of complexity , 1994, Prentice Hall international series in computer science.

[442]  Robert W. Irving,et al.  Stable matching with couples: An empirical study , 2011, JEAL.

[443]  Steven J. Brams,et al.  Voting Systems that Combine Approval and Preference , 2009, The Mathematics of Preference, Choice and Order.

[444]  Guy Kindler,et al.  The geometry of manipulation — A quantitative proof of the Gibbard-Satterthwaite theorem , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[445]  Tomomi Matsui,et al.  NP-completeness for calculating power indices of weighted majority games , 2001, Theor. Comput. Sci..

[446]  Biung-Ghi Ju,et al.  A characterization of strategy-proof voting rules for separable weak orderings , 2003, Soc. Choice Welf..

[447]  Fangzhen Lin,et al.  Computer-Aided Proofs of Arrow's and Other Impossibility Theorems , 2008, AAAI.

[448]  Lane A. Hemaspaandra,et al.  Kolmogorov Characterizations of Complexity Classes , 1991, Theor. Comput. Sci..

[449]  M. Utku Ünver,et al.  Credible group stability in many-to-many matching problems , 2006, J. Econ. Theory.

[450]  Toby Walsh,et al.  Combining Voting Rules Together , 2012, ECAI.

[451]  David Austen-Smith,et al.  Positive Political Theory II: Strategy and Structure , 2005 .

[452]  Peter C. Fishburn,et al.  Even-chance lotteries in social choice theory , 1972 .

[453]  José Alcalde,et al.  Researching with whom? Stability and manipulation , 2004 .

[454]  William Thomson,et al.  Consistent Solutions to the Problem of Fair Division When Preferences Are Single-Peaked , 1994 .

[455]  Jérôme Monnot,et al.  Possible winners when new alternatives join: new results coming up! , 2011, AAMAS.

[456]  Steven J. Brams,et al.  Proportional Representation , 1998 .

[457]  Gerhard J. Woeginger,et al.  Two hardness results for Gamson’s game , 2014, Soc. Choice Welf..

[458]  Bezalel Peleg,et al.  Extending the Condorcet Jury Theorem to a general dependent jury , 2012, Soc. Choice Welf..

[459]  Rohit Parikh,et al.  Knowledge-Theoretic Properties of Strategic Voting , 2004, JELIA.

[460]  Michael A. Trick,et al.  Recognizing single-peaked preferences on a tree , 1989 .

[461]  Kirk Pruhs,et al.  Balanced Allocations of Cake , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[462]  Jérôme Lang,et al.  Logical Preference Representation and Combinatorial Vote , 2004, Annals of Mathematics and Artificial Intelligence.

[463]  Imma Curiel,et al.  Cooperative game theory and applications , 1997 .

[464]  Benjamin C. Pierce,et al.  Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software , 2001 .

[465]  Steven J. Brams,et al.  Mathematics And Democracy , 2008 .

[466]  Lirong Xia,et al.  Sequential composition of voting rules in multi-issue domains , 2009, Math. Soc. Sci..

[467]  Christian List,et al.  Majority voting on restricted domains , 2010, J. Econ. Theory.

[468]  Edith Hemaspaandra,et al.  Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP , 1998, Inf. Process. Lett..

[469]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[470]  Aseem Agrawal,et al.  Polynomial time algorithm for an optimal stable assignment with multiple partners , 2007, Theor. Comput. Sci..

[471]  Jörg Rothe,et al.  Raising NP lower bounds to parallel NP lower bounds , 1997, SIGA.

[472]  Peter C. Fishburn,et al.  Coincidence probabilities for simple majority and positional voting rules , 1978 .

[473]  Hong Liu,et al.  Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems , 2013, Theor. Comput. Sci..

[474]  J. Drèze,et al.  HEDONIC COALITIONS: OPTIMALITY AND STABILITY , 1980 .

[475]  N. Jennings,et al.  Computational Coalition Formation , 2013 .

[476]  Katarzyna E. Paluch.  Faster and Simpler Approximation of Stable Matchings , 2014, Algorithms.

[477]  P. Gärdenfors.  Manipulation of social choice functions , 1976 .

[478]  Tuomas Sandholm,et al.  Finding approximate competitive equilibria: efficient and fair course allocation , 2010, AAMAS.

[479]  Lane A. Hemaspaandra,et al.  The Complexity Theory Companion , 2002, Texts in Theoretical Computer Science An EATCS Series.

[480]  J. Nash.  THE BARGAINING PROBLEM , 1950, Classics in Game Theory.

[481]  P.-C.-F. Daunou,et al.  Mémoire sur les élections au scrutin , 1803 .

[482]  Elisha A. Pazner,et al.  Egalitarian Equivalent Allocations: A New Concept of Economic Equity , 1978 .

[483]  Luc De Raedt,et al.  Proceedings of the 20th European Conference on Artificial Intelligence , 2012 .

[484]  Richard Matthew McCutchen.  The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences , 2008, LATIN.

[485]  L. A. Hemaspaandra,et al.  Computational Aspects of Approval Voting , 2010 .

[486]  Vijay V. Vazirani,et al.  Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs , 1999, SIAM J. Comput..

[487]  Lihi Naamani Dery.  Iterative voting under uncertainty for group recommender systems , 2010, RecSys '10.

[488]  Ariel D. Procaccia,et al.  Towards More Expressive Cake Cutting , 2011, IJCAI.

[489]  Sébastien Konieczny,et al.  DA2 merging operators , 2004, Artif. Intell..

[490]  Michel Grabisch,et al.  K-order Additive Discrete Fuzzy Measures and Their Representation , 1997, Fuzzy Sets Syst..

[491]  B. Weingast,et al.  Uncovered Sets and Sophisticated Voting Outcomes with Implications for Agenda Institutions , 1984 .

[492]  Jerry S. Kelly,et al.  NP-completeness of some problems concerning voting games , 1990 .

[493]  Dominique Henriet,et al.  The Copeland choice function an axiomatic characterization , 1985 .

[494]  Tamás Fleiner,et al.  On a lemma of Scarf , 2003, J. Comb. Theory, Ser. B.

[495]  Lane A. Hemaspaandra,et al.  SIGACT News Complexity Theory Column 76: an atypical survey of typical-case heuristic algorithms , 2012, SIGA.

[496]  John R. Douceur,et al.  Lottery trees: motivational deployment of networked systems , 2007, SIGCOMM '07.

[497]  M. Fleurbaey,et al.  A Theory of Fairness and Social Welfare , 2011 .

[498]  Kurt Mehlhorn,et al.  Pareto Optimality in House Allocation Problems , 2005, ISAAC.

[499]  Steven J. Brams,et al.  A minimax procedure for electing committees , 2007 .

[500]  Piotr Faliszewski,et al.  Copeland voting: ties matter , 2008, AAMAS.

[501]  Rosa Camps,et al.  Social choice rules driven by propositional logic , 2011, Annals of Mathematics and Artificial Intelligence.

[502]  Sanjeev Khanna,et al.  Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games , 2010, EC '10.

[503]  Jacob Goldberger,et al.  Distilling the wisdom of crowds: weighted aggregation of decisions on multiple issues , 2009, Autonomous Agents and Multi-Agent Systems.

[504]  Alan D. Taylor,et al.  Mathematics and politics : strategy, voting, power and proof , 1997 .

[505]  Vincent Conitzer,et al.  Compilation Complexity of Common Voting Rules , 2010, AAAI.

[506]  Flip Klijn,et al.  Matching with couples: a Multidisciplinary Survey , 2013, IGTR.

[507]  Craig Boutilier,et al.  Robust Approximation and Incremental Elicitation in Voting Protocols , 2011, IJCAI.

[508]  D. Felsenthal,et al.  Electoral systems : paradoxes, assumptions, and procedures , 2012 .

[509]  Klaus Nehring,et al.  The structure of strategy-proof social choice - Part I: General characterization and possibility results on median spaces , 2007, J. Econ. Theory.

[510]  F. Dietrich,et al.  Judgment Aggregation By Quota Rules , 2007 .

[511]  U. Endriss.  Logic and Social Choice Theory , 2011 .

[512]  Josep Freixas,et al.  Computation of several power indices by generating functions , 2012, Appl. Math. Comput..

[513]  Piotr Faliszewski,et al.  How Hard Is Bribery in Elections? , 2006, J. Artif. Intell. Res..

[514]  C. Hillinger,et al.  The Case for Utilitarian Voting , 2005 .

[515]  Jean-François Laslier,et al.  Interpretation of electoral mixed strategies , 2000, Soc. Choice Welf..

[516]  Mihalis Yannakakis,et al.  How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[517]  Ildikó Schlotter,et al.  Multivariate Complexity Analysis of Swap Bribery , 2010, Algorithmica.

[518]  J. Kelly.  Almost all social choice rules are highly manipulable, but a few aren't , 1993 .

[519]  Jérôme Monnot,et al.  A Matroid Approach to the Worst Case Allocation of Indivisible Goods , 2013, IJCAI.

[520]  Edith Elkind,et al.  Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS) , 2015 .

[521]  Inon Zuckerman,et al.  Universal Voting Protocol Tweaks to Make Manipulation Hard , 2003, IJCAI.

[522]  Michael Wooldridge,et al.  Proceedings of the 21st International Joint Conference on Artificial Intelligence , 2009 .

[523]  Nicholas R. Jennings,et al.  On the Convergence of Iterative Voting: How Restrictive Should Restricted Dynamics Be? , 2015, AAAI.

[524]  Jana Hajduková,et al.  Computational complexity of stable partitions with B-preferences , 2003, Int. J. Game Theory.

[525]  Haris Aziz,et al.  A Generalization of Probabilistic Serial to Randomized Social Choice , 2014, AAAI.

[526]  Yann Chevaleyre,et al.  Learning conditionally lexicographic preference relations , 2010, ECAI.

[527]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[528]  Gerhard J. Woeginger,et al.  The complexity of economic equilibria for house allocation markets , 2003, Inf. Process. Lett..

[529]  Felix Brandt,et al.  Set-monotonicity implies Kelly-strategyproofness , 2010, Soc. Choice Welf..

[530]  F. Echenique,et al.  A Theory of Stability in Many-to-Many Matching Markets , 2004 .

[531]  Gabriella Pigozzi,et al.  On judgment aggregation in abstract argumentation , 2009, Autonomous Agents and Multi-Agent Systems.

[532]  Ivona Bezáková,et al.  Allocating indivisible goods , 2005, SECO.

[533]  Jrg Rothe,et al.  Economics and Computation, An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division , 2015, Economics and Computation.

[534]  Jörg Rothe,et al.  Hybrid Elections Broaden Complexity‐Theoretic Resistance to Control , 2006, IJCAI.

[535]  Ariel D. Procaccia,et al.  The learnability of voting rules , 2009, Artif. Intell..

[536]  Toby Walsh,et al.  Stability in Matching Problems with Weighted Preferences , 2011, ICAART.

[537]  Yoav Shoham,et al.  Marginal contribution nets: a compact representation scheme for coalitional games , 2005, EC '05.

[538]  R. Luce,et al.  Individual Choice Behavior: A Theoretical Analysis. , 1960 .

[539]  Cong Yu,et al.  Group Recommendation: Semantics and Efficiency , 2009, Proc. VLDB Endow..

[540]  Meena Mahajan,et al.  Parameterizing above or below guaranteed values , 2009, J. Comput. Syst. Sci..

[541]  Daniel Eckert,et al.  Guilbaud's 1952 theorem on the logical problem of aggregation , 2010 .

[542]  Patrice Perny,et al.  GAI Networks for Utility Elicitation , 2004, KR.

[543]  Svetlana Obraztsova,et al.  Plurality Voting with Truth-Biased Agents , 2013, SAGT.

[544]  Craig Boutilier,et al.  Multi-Winner Social Choice with Incomplete Preferences , 2013, IJCAI.

[545]  Agnieszka Wiszniewska-Matyszkiel,et al.  Game theory and mathematical economics , 2006 .

[546]  Martin Olsen,et al.  A general view on computing communities , 2013, Math. Soc. Sci..

[547]  Edith Hemaspaandra,et al.  Solving hard problems in election systems , 2012 .

[548]  Graciela Chichilnisky,et al.  The Walrasian Mechanism from Equal Division is Not Monotonic with Respect to Variations in the Number of Consumers , 1987 .

[549]  Isabelle Stanton,et al.  The structure, efficacy, and manipulation of double-elimination tournaments , 2013 .

[550]  William S. Zwicker,et al.  A Moving-Knife Solution to the Four-Person Envy-Free Cake-Division Problem , 1995 .

[551]  E. Lazear,et al.  Rank-Order Tournaments as Optimum Labor Contracts , 1979, Journal of Political Economy.

[552]  Toby Walsh,et al.  Winner Determination in Sequential Majority Voting , 2007, IJCAI.

[553]  Nicholas R. Jennings,et al.  A linear approximation method for the Shapley value , 2008, Artif. Intell..

[554]  Moshe Tennenholtz,et al.  On the Axiomatic Foundations of Ranking Systems , 2005, IJCAI.

[555]  Felix Brandt,et al.  The Computational Complexity of Random Serial Dictatorship , 2013, WINE.

[556]  D. Foley.  Resource allocation and the public sector , 1967 .

[557]  Jean-Pierre Benoît,et al.  Only a dictatorship is efficient , 2010, Games Econ. Behav..

[558]  Vincent Conitzer,et al.  Computing Slater Rankings Using Similarities among Candidates , 2006, AAAI.

[559]  Carmelo Rodríguez-Álvarez,et al.  Strategy-proof coalition formation , 2009, Int. J. Game Theory.

[560]  Benjamin Hindman,et al.  Dominant Resource Fairness: Fair Allocation of Multiple Resource Types , 2011, NSDI.

[561]  Olivier Spanjaard,et al.  Kemeny Elections with Bounded Single-Peaked or Single-Crossing Width , 2013, IJCAI.

[562]  Vincent Conitzer,et al.  Strategic sequential voting in multi-issue domains and multiple-election paradoxes , 2011, EC '11.

[563]  Jon Kleinberg,et al.  Authoritative sources in a hyperlinked environment , 1999, SODA '98.

[564]  Vincent Conitzer,et al.  Common Voting Rules as Maximum Likelihood Estimators , 2005, UAI.

[565]  Ariel D. Procaccia,et al.  Dynamic Social Choice with Evolving Preferences , 2013, AAAI.

[566]  H. Moulin,et al.  Can everyone benefit from growth?: Two difficulties , 1988 .

[567]  S. Rassenti,et al.  A Combinatorial Auction Mechanism for Airport Time Slot Allocation , 1982 .

[568]  Jörg Rothe,et al.  The Margin of Victory in Schulze, Cup, and Copeland Elections: Complexity of the Regular and Exact Variants , 2014, STAIRS.

[569]  Coralio Ballester,et al.  NP-completeness in hedonic games , 2004, Games Econ. Behav..

[570]  Richard Stong,et al.  Collective choice under dichotomous preferences , 2005, J. Econ. Theory.

[571]  Toby Walsh,et al.  Where are the hard manipulation problems? , 2010, J. Artif. Intell. Res..

[572]  Edith Elkind,et al.  Multiwinner Elections Under Preferences That Are Single-Peaked on a Tree , 2013, IJCAI.

[573]  William Thomson,et al.  Group order preservation and the proportional rule for the adjudication of conflicting claims , 2002, Math. Soc. Sci..

[574]  H. Moulin.  Choosing from a tournament , 1986 .

[575]  Dimitris Bertsimas,et al.  The Price of Fairness , 2011, Oper. Res..

[576]  Robert B. Wilson.  On the theory of aggregation , 1975 .

[577]  David Manlove,et al.  Strong Stability in the Hospitals/Residents Problem , 2003, STACS.

[578]  Roie Zivan,et al.  Can trust increase the efficiency of cake cutting algorithms? , 2011, AAMAS.

[579]  M. de Klerk,et al.  The Dutch algorithm for allocation in living donor kidney exchange. , 2005, Transplantation proceedings.

[580]  Sarit Kraus,et al.  How to Change a Group's Collective Decision? , 2013, IJCAI.

[581]  Lawrence G. Sager,et al.  The One and the Many: Adjudication in Collegial Courts , 1993 .

[582]  Noam Nisan,et al.  Fair allocation without trade , 2012, AAMAS.

[583]  P. E. Dunne,et al.  Extremal Behaviour in Multiagent Contract Negotiation , 2011, J. Artif. Intell. Res..

[584]  Geoffrey Pritchard,et al.  Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour , 2009, Math. Soc. Sci..

[585]  Ulrich Endriss,et al.  Lifting integrity constraints in binary aggregation , 2013, Artif. Intell..

[586]  Nicole Immorlica,et al.  Marriage, honesty, and stability , 2005, SODA '05.

[587]  Marc Pauly,et al.  Logical Constraints on Judgement Aggregation , 2006, J. Philos. Log..

[588]  Barteld Kooi,et al.  Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems , 2011, Adaptive Agents and Multi-Agent Systems.

[589]  William S. Zwicker,et al.  Simple games - desirability relations, trading, pseudoweightings , 1999 .

[590]  John G. Kemeny,et al.  Mathematical models in the social sciences , 1964 .

[591]  Marek Karpinski,et al.  Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament , 2010, ISAAC.

[592]  Yusufcan Masatlioglu,et al.  A foundation for strategic agenda voting , 2014, Games Econ. Behav..

[593]  Kurt Mehlhorn,et al.  Rank-maximal matchings , 2004, TALG.

[594]  Vincent Conitzer,et al.  Hypercubewise Preference Aggregation in Multi-Issue Domains , 2011, IJCAI.

[595]  A. Roth.  Stability and Polarization of Interests in Job Matching , 1984 .

[596]  Yi Mao,et al.  Non-parametric Modeling of Partially Ranked Data , 2007, NIPS.

[597]  Jörg Rothe,et al.  Anyone but him: The complexity of precluding an alternative , 2005, Artif. Intell..

[598]  Piotr Faliszewski,et al.  The complexity of manipulative attacks in nearly single-peaked electorates , 2014, Artif. Intell..

[599]  Tyrel Russell,et al.  A Computational Study of Problems in Sports , 2010 .

[600]  Edith Hemaspaandra,et al.  Dodgson's Rule and Young's Rule , 2016, Handbook of Computational Social Choice.

[601]  Felix Brandt,et al.  Bounds on the disparity and separation of tournament solutions , 2015, Discret. Appl. Math..

[602]  Piotr Faliszewski,et al.  Swap Bribery , 2009, SAGT.

[603]  Shmuel Nitzan,et al.  Some general results on the metric rationalization for social decision rules , 1985 .

[604]  W. Bossert,et al.  Ranking Sets of Objects , 2001 .

[605]  Sébastien Konieczny,et al.  Counting votes for aggregating judgments , 2014, AAMAS.

[606]  Edith Elkind,et al.  Electing the Most Probable Without Eliminating the Irrational: Voting Over Intransitive Domains , 2014, UAI.

[607]  Walter Stromquist,et al.  Envy-Free Cake Divisions Cannot be Found by Finite Protocols , 2008, Electron. J. Comb..

[608]  M. Remzi Sanver,et al.  Approval as an Intrinsic Part of Preference , 2010 .

[609]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[610]  Pedro Barahona,et al.  PSICO: Solving Protein Structures with Constraint Programming and Optimization , 2002, Constraints.

[611]  Mark Fey,et al.  Choosing from a large tournament , 2008, Soc. Choice Welf..

[612]  Pedro Rey-Biel,et al.  Does uncertainty lead to sincerity? Simple and complex voting mechanisms , 2009, Soc. Choice Welf..

[613]  Eithan Ephrati,et al.  Multi-Agent Planning as a Dynamic Search for Social Consensus , 1993, IJCAI.

[614]  H. Moulin.  Condorcet's principle implies the no show paradox , 1988 .

[615]  Ariel D. Procaccia,et al.  Complexity of Strategic Behavior in Multi-Winner Elections , 2008, J. Artif. Intell. Res..

[616]  M. Kendall,et al.  The Problem of $m$ Rankings , 1939 .

[617]  Kristiaan M. Glorie,et al.  Kidney Exchange with Long Chains: An Efficient Pricing Algorithm for Clearing Barter Exchanges with Branch-and-Price , 2014, Manuf. Serv. Oper. Manag..

[618]  Arkadii Slinko,et al.  Non-dictatorial Social Choice Rules Are Safely Manipulable , 2008 .

[619]  Shao Chin Sung,et al.  Top responsiveness and Nash stability in coalition formation games , 2006, Kybernetika.

[620]  P. Slater.  Inconsistencies in a schedule of paired comparisons , 1961 .

[621]  Akihisa Tamura,et al.  Transformation from Arbitrary Matchings to Stable Matchings , 1993, J. Comb. Theory, Ser. A.

[622]  J. Kadane.  On division of the question , 1972 .

[623]  Shmuel Nitzan,et al.  Social compromise and social metrics , 1986 .

[624]  Toby Walsh,et al.  mCP Nets: Representing and Reasoning with Preferences of Multiple Agents , 2004, AAAI.

[625]  Julie A. Adams,et al.  Communication complexity of approximating voting rules , 2012, AAMAS.

[626]  Jörg Rothe,et al.  Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP , 1997, JACM.

[627]  David Gale,et al.  Some remarks on the stable matching problem , 1985, Discret. Appl. Math..

[628]  Preetjot Singh,et al.  Control Complexity of Schulze Voting , 2013, IJCAI.

[629]  Zoltán Király.  Linear Time Local Approximation Algorithm for Maximum Stable Marriage , 2013, Algorithms.

[630]  David C. Parkes,et al.  A Complexity-of-Strategic-Behavior Comparison between Schulze's Rule and Ranked Pairs , 2012, AAAI.

[631]  David Manlove,et al.  Stable Marriage with Incomplete Lists and Ties , 1999, ICALP.

[632]  Simina Brânzei,et al.  Equilibrium analysis in cake cutting , 2013, AAMAS.

[633]  Ömer Eğecioğlu,et al.  The Impartial, Anonymous, and Neutral Culture Model: A Probability Model for Sampling Public Preference Structures , 2013 .

[634]  S. Brams,et al.  Voting on Referenda: The Separability Problem and Possible Solutions , 1997 .

[635]  L. Beineke,et al.  Selected Topics in Graph Theory 2 , 1985 .

[636]  Toby Walsh,et al.  Is computational complexity a barrier to manipulation? , 2010, Annals of Mathematics and Artificial Intelligence.

[637]  V. Crawford,et al.  Job Matching, Coalition Formation, and Gross Substitutes , 1982 .

[638]  Vincent Conitzer,et al.  Improved Bounds for Computing Kemeny Rankings , 2006, AAAI.

[639]  L. Shapley,et al.  On cores and indivisibility , 1974 .

[640]  Piotr Faliszewski,et al.  Weighted electoral control , 2013, AAMAS.

[641]  Christian List,et al.  Arrow’s theorem in judgment aggregation , 2005, Soc. Choice Welf..

[642]  Jörg Rothe,et al.  Control complexity in Bucklin and fallback voting: A theoretical analysis , 2015, J. Comput. Syst. Sci..

[643]  Michel Gendreau,et al.  Combinatorial auctions , 2007, Ann. Oper. Res..

[644]  A. Gibbard.  Manipulation of Voting Schemes: A General Result , 1973 .

[645]  Steven J. Brams,et al.  Fair division - from cake-cutting to dispute resolution , 1998 .

[646]  Peter C. Fishburn,et al.  Interval orders and interval graphs : a study of partially ordered sets , 1985 .

[647]  Jörg Rothe,et al.  Einführung in Computational Social Choice: Individuelle Strategien und kollektive Entscheidungen beim Spielen, Wählen und Teilen , 2011 .

[648]  Jennifer Ryan,et al.  Tournament games and positive tournaments , 1995, J. Graph Theory.

[649]  Carmen Beviá,et al.  Fair allocation in a general model with indivisible goods , 1998 .

[650]  Rachel J. Johnson,et al.  Early Experience of Paired Living Kidney Donation in the United Kingdom , 2008, Transplantation.

[651]  Jörg Rothe,et al.  Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules , 2010, Inf. Process. Lett..

[652]  Jörg Rothe,et al.  Sincere‐Strategy Preference‐Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control , 2008, Math. Log. Q..

[653]  John Duggan,et al.  Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized , 2000, Soc. Choice Welf..

[654]  Daniela Sabán,et al.  The Complexity of Computing the Random Priority Allocation Matrix , 2013, Math. Oper. Res..

[655]  Toby Walsh,et al.  Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies , 2010, Artif. Intell..

[656]  Ariel D. Procaccia,et al.  Modal Ranking: A Uniquely Robust Voting Rule , 2014, AAAI.

[657]  Michel Balinski,et al.  Algorithms for proportional matrices in reals and integers , 1989, Math. Program..

[658]  Sarvapali D. Ramchurn,et al.  Trust-based mechanism design , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[659]  Piotr Faliszewski,et al.  Homogeneity and monotonicity of distance-rationalizable voting rules , 2011, AAMAS.

[660]  Craig Boutilier,et al.  Robust Winners and Winner Determination Policies under Candidate Uncertainty , 2014, AAAI.

[661]  Jörg Rothe,et al.  The Complexity of Computing Minimal Unidirectional Covering Sets , 2009, Theory of Computing Systems.

[662]  D. Black.  The theory of committees and elections , 1959 .

[663]  Jérôme Lang,et al.  Single-peaked consistency and its complexity , 2008, ECAI.

[664]  Jean-François Laslier,et al.  More on the tournament equilibrium set , 1993 .

[665]  Yoav Shoham,et al.  Broadening the Scope of Optimal Seeding Analysis in Knockout Tournaments ∗ † , 2010 .

[666]  Rolf Niedermeier,et al.  Parameterized computational complexity of Dodgson and Young elections , 2010, Inf. Comput..

[667]  Gerhard J. Woeginger,et al.  Group Activity Selection Problem , 2012, WINE.

[668]  Edith Hemaspaandra,et al.  Dichotomy for voting systems , 2005, J. Comput. Syst. Sci..

[669]  Donald G. Saari,et al.  The Sum of the Parts Can Violate the Whole , 2001, American Political Science Review.

[670]  Faruk Gul,et al.  Generalized Median Voter Schemes and Committees , 1993 .

[671]  Piotr Faliszewski,et al.  Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting , 2013, Autonomous Agents and Multi-Agent Systems.

[672]  R. Duncan Luce,et al.  Individual Choice Behavior: A Theoretical Analysis , 1979 .

[673]  Hyungjun Kim.  Population monotonic rules for fair allocation problems , 2004, Soc. Choice Welf..

[674]  M. Breton,et al.  The Bipartisan Set of a Tournament Game , 1993 .

[675]  D. Black.  On the Rationale of Group Decision-making , 1948, Journal of Political Economy.

[676]  Bernard Monjardet,et al.  The median procedure in cluster analysis and social choice theory , 1981, Math. Soc. Sci..

[677]  Dimitris Magos,et al.  Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem , 2012, INFORMS J. Comput..

[678]  Manabu Toda,et al.  Consistency and characterization of the core of two-sided matching problems , 1992 .

[679]  Ariel D. Procaccia,et al.  The Computational Rise and Fall of Fairness , 2014, AAAI.

[680]  Elchanan Mossel,et al.  A Smooth Transition from Powerlessness to Absolute Power , 2012, J. Artif. Intell. Res..

[681]  Sarvapali D. Ramchurn,et al.  An Anytime Algorithm for Optimal Coalition Structure Generation , 2014, J. Artif. Intell. Res..

[682]  L. A. Goodman,et al.  Social Choice and Individual Values , 1951 .

[683]  Hong Liu,et al.  Parameterized computational complexity of control problems in voting systems , 2009, Theor. Comput. Sci..

[684]  Dominique Lepelley,et al.  Some Further Results on the Manipulability of Social Choice Rules , 2006, Soc. Choice Welf..

[685]  Michael Wooldridge,et al.  Hedonic coalition nets , 2009, AAMAS.

[686]  Ariel D. Procaccia,et al.  A Maximum Likelihood Approach For Selecting Sets of Alternatives , 2012, UAI.

[687]  M. Remzi Sanver,et al.  Ensuring Pareto Optimality by Referendum Voting , 2006, Soc. Choice Welf..

[688]  M. Newman.  Mathematics of networks , 2018, Oxford Scholarship Online.

[689]  Piotr Faliszewski,et al.  Campaigns for lazy voters: truncated ballots , 2012, AAMAS.

[690]  Felix A. Fischer,et al.  The Computational Complexity of Choice Sets , 2009, Math. Log. Q..

[691]  Ioannis Mourtos,et al.  Finding a minimum-regret many-to-many Stable Matching , 2013 .

[692]  Ronen I. Brafman,et al.  Reasoning With Conditional Ceteris Paribus Preference Statements , 1999, UAI.

[693]  Jeff Horen,et al.  Comparing Draws for Single Elimination Tournaments , 1985, Oper. Res..

[694]  Atila Abdulkadiroglu,et al.  HOUSE ALLOCATION WITH EXISTING TENANTS , 1999 .

[695]  Omer Lev,et al.  Empirical analysis of plurality election equilibria , 2013, AAMAS.

[696]  Marc Pauly.  Can strategizing in round-robin subtournaments be avoided? , 2014, Soc. Choice Welf..

[697]  A. Sen,et al.  Collective Choice and Social Welfare , 2017 .

[698]  Philip A. Schrodt,et al.  The Logic of Collective Choice. , 1986 .

[699]  Ulrich Endriss,et al.  Voter response to iterated poll information , 2012, AAMAS.

[700]  Matthias Kräkel,et al.  Optimal seedings in elimination tournaments revisited , 2014 .

[701]  Vanessa Teague,et al.  On The Complexity of Manipulating Elections , 2007, CATS.

[702]  Atri Rudra,et al.  Ordering by weighted number of wins gives a good ranking for weighted tournaments , 2006, SODA '06.

[703]  Ronen I. Brafman,et al.  On Graphical Modeling of Preference and Importance , 2011, J. Artif. Intell. Res..

[704]  Jörg Rothe,et al.  False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time , 2013, LATIN.

[705]  Felix Brandt,et al.  Some Remarks on Dodgson's Voting Rule , 2009, Math. Log. Q..

[706]  Edith Elkind,et al.  Hybrid Voting Protocols and Hardness of Manipulation , 2005, ISAAC.

[707]  Vincent Conitzer,et al.  On the Axiomatic Characterization of Runoff Voting Rules , 2014, AAAI.

[708]  Manfred J. Holler,et al.  Power, freedom, and voting , 2008 .

[709]  Simina Brânzei,et al.  Social Distance Games , 2011, IJCAI.

[710]  Craig Boutilier,et al.  Optimal social choice functions: A utilitarian view , 2015, Artif. Intell..

[711]  Ariel D. Procaccia,et al.  Algorithms for the coalitional manipulation problem , 2008, SODA '08.

[712]  Rolf Niedermeier,et al.  Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation , 2014, Autonomous Agents and Multi-Agent Systems.

[713]  Barry O'Neill,et al.  A problem of rights arbitration from the Talmud , 1982, Math. Soc. Sci..

[714]  N. Nisan.  Introduction to Mechanism Design (for Computer Scientists) , 2007 .

[715]  Ron Holzman,et al.  Aggregation of binary evaluations , 2010, J. Econ. Theory.

[716]  Paul Harrenstein,et al.  Individual-based stability in hedonic games depending on the best or worst players , 2011, AAMAS.

[717]  J. H. Smith.  AGGREGATION OF PREFERENCES WITH VARIABLE ELECTORATE , 1973 .

[718]  Toshihide Ibaraki,et al.  On-Line Computation of Transitive Closures of Graphs , 1983, Inf. Process. Lett..

[719]  P. Mongin.  Judgment Aggregation , 2011 .

[720]  Craig Boutilier,et al.  A Dynamic Rationalization of Distance Rationalizability , 2012, AAAI.

[721]  Craig Boutilier,et al.  Bayesian Vote Manipulation: Optimal Strategies and Impact on Welfare , 2012, UAI.

[722]  Yann Chevaleyre,et al.  Simple negotiation schemes for agents with simple preferences: sufficiency, necessity and maximality , 2010, Autonomous Agents and Multi-Agent Systems.

[723]  Ariel D. Procaccia,et al.  The Distortion of Cardinal Preferences in Voting , 2006, CIA.

[724]  A. Roth,et al.  The Effects of the Change in the NRMP Matching Algorithm , 1997 .

[725]  Piotr Faliszewski,et al.  Nonuniform Bribery , 2007, AAMAS.

[726]  Toby Walsh,et al.  Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote , 2013, AAAI.

[727]  Arnold B. Urken,et al.  Classics of social choice , 1995 .

[728]  T. Matsui,et al.  A SURVEY OF ALGORITHMS FOR CALCULATING POWER INDICES OF WEIGHTED MAJORITY GAMES , 2000 .

[729]  Steven J. Brams,et al.  Critical Strategies Under Approval Voting: Who Gets Ruled In And Ruled Out , 2006 .

[730]  Vincent Conitzer,et al.  Finite Local Consistency Characterizes Generalized Scoring Rules , 2009, IJCAI.

[731]  Forming Coalitions and Measuring Voting Power , 1982 .

[732]  Felix A. Fischer,et al.  A computational analysis of the tournament equilibrium set , 2008, Soc. Choice Welf..

[733]  Christian List,et al.  STRATEGY-PROOF JUDGMENT AGGREGATION* , 2005, Economics and Philosophy.

[734]  Jonathan L. Gross,et al.  Handbook of graph theory , 2007, Discrete mathematics and its applications.

[735]  Burt L. Monroe,et al.  Fully Proportional Representation , 1995, American Political Science Review.

[736]  Ulrich Endriss,et al.  Empirical Analysis of Aggregation Methods for Collective Annotation , 2014, COLING.

[737]  S. Pápai,et al.  Strategy-proofness and population-monotonicity for house allocation problems , 2002 .

[738]  Bhaskar Dutta,et al.  On Nicely Consistent Voting Systems , 1978 .

[739]  Jörg Rothe,et al.  Online Voter Control in Sequential Elections , 2012, ECAI.

[740]  Piotr Faliszewski,et al.  Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) Manipulating the Quota in Weighted Voting Games , 2022 .

[741]  Vittorio Bilò,et al.  Nash Stability in Fractional Hedonic Games , 2014, WINE.

[742]  Andrew Klapper,et al.  On the complexity of bribery and manipulation in tournaments with uncertain information , 2012, J. Appl. Log..

[743]  Nikhil Bansal,et al.  The Santa Claus problem , 2006, STOC '06.

[744]  Lirong Xia.  Statistical Properties of Social Choice Mechanisms , 2014 .

[745]  Ariel D. Procaccia,et al.  No agent left behind: dynamic fair division of multiple resources , 2013, AAMAS.

[746]  David Hartvigsen,et al.  Vote trading in public elections , 2006, Math. Soc. Sci..

[747]  Piotr Faliszewski,et al.  Elections with Few Voters: Candidate Control Can Be Easy , 2014, AAAI.

[748]  Kate Saenko,et al.  Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013 , 2013, AAAI 2013.

[749]  Lirong Xia,et al.  A Dichotomy Theorem on the Existence of Efficient or Neutral Sequential Voting Correspondences , 2009, IJCAI.

[750]  Ulrich Endriss,et al.  Binary Aggregation by Selection of the Most Representative Voters , 2014, AAAI.

[751]  A. Litman,et al.  On covering problems of codes , 1997, Theory of Computing Systems.

[752]  Julián Mestre,et al.  Parametrized algorithms for random serial dictatorship , 2014, Math. Soc. Sci..

[753]  K. R. Apt.  Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), Groningen, The Netherlands, July 12-14, 2011 , 2011, TARK.

[754]  Bruno Zanuttini,et al.  Learning conditional preference networks , 2010, Artif. Intell..

[755]  Fedor V. Fomin,et al.  Exact exponential algorithms , 2013, CACM.

[756]  Piotr Faliszewski,et al.  Approximability of Manipulating Elections , 2008, AAAI.

[757]  John Duggan,et al.  Dutta's Minimal Covering Set and Shapley's Saddles , 1996 .

[758]  Edith Elkind,et al.  False-Name Manipulations in Weighted Voting Games , 2014, J. Artif. Intell. Res..

[759]  Alan D. Taylor,et al.  Social choice and the mathematics of manipulation , 2005 .

[760]  Salvador Barberà,et al.  Voting by Committees , 1991 .

[761]  I. Good.  A note on condorcet sets , 1971 .

[762]  H. Young.  Social Choice Scoring Functions , 1975 .

[763]  Craig Boutilier,et al.  Efficient Vote Elicitation under Candidate Uncertainty , 2013, IJCAI.

[764]  H. Young.  Extending Condorcet's rule , 1977 .

[765]  W. Gehrlein.  Condorcet's paradox , 1983 .

[766]  Chrysanthos Dellarocas,et al.  Cooperation Without Enforcement? A Comparative Analysis of Litigation and Online Reputation as Quality Assurance Mechanisms , 2003, ICIS.

[767]  William S. Zwicker.  The voters' paradox, spin, and the Borda count , 1991 .

[768]  Shao Chin Sung,et al.  On core membership testing for hedonic coalition formation games , 2007, Oper. Res. Lett..

[769]  Telikepalli Kavitha,et al.  Popular mixed matchings , 2009, Theor. Comput. Sci..

[770]  Vincent Conitzer,et al.  Vote elicitation: complexity and strategy-proofness , 2002, AAAI/IAAI.

[771]  M. Utku Ünver,et al.  Matching, Allocation, and Exchange of Discrete Resources , 2009 .

[772]  Ulrich Endriss,et al.  Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods , 2010, ECAI.

[773]  Craig Boutilier,et al.  Bidding Languages for Combinatorial Auctions , 2001, IJCAI.

[774]  R. McKelvey,et al.  A multistage game representation of sophisticated voting for binary procedures , 1978 .

[775]  Edith Elkind,et al.  On Detecting Nearly Structured Preference Profiles , 2014, AAAI.

[776]  Jörg Rothe,et al.  The Possible Winner Problem with Uncertain Weights , 2012, ECAI.

[777]  M. Balinski,et al.  A Tale of Two Mechanisms: Student Placement , 1999 .

[778]  Jörg Rothe,et al.  Controlling Candidate-Sequential Elections , 2012, ECAI.

[779]  Vincent Conitzer,et al.  When are elections with few candidates hard to manipulate? , 2007, J. ACM.

[780]  Piotr Faliszewski,et al.  Approximation Algorithms for Campaign Management , 2010, WINE.

[781]  Felix Brandt,et al.  Group-Strategyproof Irresolute Social Choice Functions , 2010, IJCAI.

[782]  Nicole Immorlica,et al.  Two-sided matching with partial information , 2013, EC '13.

[783]  Jörg Rothe,et al.  Bribery in Path-Disruption Games , 2011, ADT.

[784]  J. Banks,et al.  Information Aggregation, Rationality, and the Condorcet Jury Theorem , 1996, American Political Science Review.

[785]  D. Manlove,et al.  Keeping partners together: algorithmic results for the hospitals/residents problem with couples , 2010, J. Comb. Optim..

[786]  Ariel D. Procaccia,et al.  On the approximability of Dodgson and Young elections , 2009, Artif. Intell..

[787]  Jörg Rothe,et al.  Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey , 2013, Annals of Mathematics and Artificial Intelligence.

[788]  K. Ladha.  The Condorcet Jury Theorem, Free Speech and Correlated Votes , 1992 .

[789]  Yoav Shoham,et al.  Optimal seeding in knockout tournaments , 2010, AAMAS.

[790]  Lane A. Hemaspaandra,et al.  Guarantees for the success frequency of an algorithm for finding Dodgson-election winners , 2005, J. Heuristics.

[791]  Rolf Niedermeier,et al.  Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective , 2012, The Multivariate Algorithmic Revolution and Beyond.

[792]  C. List,et al.  Judgment aggregation: A survey , 2009 .

[793]  Jinpeng Ma.  Strategy-proofness and the strict core in a market with indivisibilities , 1994 .

[794]  Gabriella Pigozzi,et al.  Belief merging and the discursive dilemma: an argument-based account to paradoxes of judgment aggregation , 2006, Synthese.

[795]  P. Pardalos,et al.  Pareto optimality, game theory and equilibria , 2008 .

[796]  Craig Boutilier,et al.  Learning Mallows Models with Pairwise Preferences , 2011, ICML.

[797]  Nicholas R. Jennings,et al.  Convergence to Equilibria in Plurality Voting , 2010, AAAI.

[798]  Andrea Scozzari,et al.  Network flow methods for electoral systems , 2012, Networks.

[799]  Felix Brandt,et al.  Identifying k-Majority Digraphs via SAT Solving , 2014 .

[800]  Ming-Yang Kao,et al.  Encyclopedia of Algorithms , 2016, Springer New York.

[801]  Olivier Hudry.  A note on “Banks winners in tournaments are difficult to recognize” by G. J. Woeginger , 2004, Soc. Choice Welf..

[802]  B. Klaus,et al.  Stable Many-to-Many Matchings with Contracts , 2008 .

[803]  M. Trick,et al.  Voting schemes for which it can be difficult to tell who won the election , 1989 .

[804]  Klaus W. Wagner.  More Complicated Questions About Maxima and Minima, and Some Closures of NP , 1987, Theor. Comput. Sci..

[805]  Uwe Sunde,et al.  Optimal seedings in elimination tournaments , 2012 .

[806]  A. Roth.  Incentive compatibility in a market with indivisible goods , 1982 .

[807]  Toby Walsh,et al.  Eliminating the Weakest Link: Making Manipulation Intractable? , 2012, AAAI.

[808]  Jean-François Laslier,et al.  Social-Choice Mediators , 1994 .

[809]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[810]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[811]  Jordi Massó,et al.  An algorithm to compute the full set of many-to-many stable matchings , 2004, Math. Soc. Sci..

[812]  Ariel D. Procaccia,et al.  On the complexity of achieving proportional representation , 2008, Soc. Choice Welf..

[813]  H. Ergin.  Consistency in house allocation problems , 2000 .

[814]  C. Papadimitriou,et al.  Segmentation problems , 2004 .

[815]  Felix Brandt,et al.  On the Discriminative Power of Tournament Solutions , 2014, OR.

[816]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

[817]  Rolf Niedermeier,et al.  Invitation to data reduction and problem kernelization , 2007, SIGA.

[818]  Piotr Faliszewski,et al.  Recognizing 1-Euclidean Preferences: An Alternative Approach , 2014, SAGT.

[819]  Vincent Conitzer,et al.  Aggregating preferences in multi-issue domains by using maximum likelihood estimators , 2010, AAMAS.

[820]  P. Fishburn.  Condorcet Social Choice Functions , 1977 .

[821]  Toby Walsh,et al.  Controlling Elections by Replacing Candidates: Theoretical and Experimental Results , 2014, MPREF@AAAI.

[822]  C. L. Mallows.  NON-NULL RANKING MODELS. I , 1957 .

[823]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[824]  É. Marchand.  On the comparison between standard and random knockout tournaments , 2002 .

[825]  Walter Bossert,et al.  Consistency, Choice, and Rationality , 2010 .

[826]  E. Maskin.  Nash Equilibrium and Welfare Optimality , 1999 .

[827]  Jayant Kalagnanam,et al.  A Computational Study of the Kemeny Rule for Preference Aggregation , 2004, AAAI.

[828]  Shin Sato,et al.  Informational requirements of social choice rules , 2009, Math. Soc. Sci..

[829]  Yann Chevaleyre,et al.  Issues in Multiagent Resource Allocation , 2006, Informatica.

[830]  F. Kojima,et al.  Random Paths to Pairwise Stability in Many-to-Many Matching Problems: A Study on Market Equilibration , 2006 .

[831]  Paul Resnick,et al.  Trust among strangers in internet transactions: Empirical analysis of eBay' s reputation system , 2002, The Economics of the Internet and E-commerce.

[832]  Sara Cohen,et al.  An Axiomatic Approach to Link Prediction , 2015, AAAI.

[833]  Xiaotie Deng,et al.  Algorithmic Cooperative Game Theory , 2008 .

[834]  KohaviRon,et al.  An Empirical Comparison of Voting Classification Algorithms , 1999 .

[835]  Piotr Faliszewski,et al.  The complexity of power-index comparison , 2008, Theor. Comput. Sci..

[836]  A. Roth,et al.  The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design , 1999, The American economic review.

[837]  David Lee,et al.  Triadic Consensus - A Randomized Algorithm for Voting in a Crowd , 2012, WINE.

[838]  Alan D. Taylor.  Mathematics And Politics , 1995 .

[839]  Andrew V. Goldberg,et al.  Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management , 2009 .

[840]  Piotr Faliszewski,et al.  Llull and Copeland Voting Computationally Resist Bribery and Constructive Control , 2009, J. Artif. Intell. Res..

[841]  Lane A. Hemachandra,et al.  The strong exponential hierarchy collapses , 1989 .

[842]  Jérôme Lang,et al.  Voting procedures with incomplete preferences , 2005 .

[843]  Tayfun Sönmez,et al.  Core in a simple coalition formation game , 2001, Soc. Choice Welf..

[844]  Marina Meila,et al.  Experiments with Kemeny ranking: What works when? , 2012, Math. Soc. Sci..

[845]  Marcus Pivato,et al.  Voting rules as statistical estimators , 2013, Soc. Choice Welf..

[846]  Omer Lev,et al.  Convergence of iterative voting , 2012, AAMAS.

[847]  Felix Brandt,et al.  Tournament Solutions Extensions of Maximality and their Applications to Decision-Making , 2009 .

[848]  Ryszard Kowalczyk,et al.  An Efficient Majority-Rule-Based Approach for Collective Decision Making with CP-Nets , 2010, KR.

[849]  Michael Wooldridge,et al.  Boolean Hedonic Games , 2015, KR.

[850]  Ariel D. Procaccia,et al.  Socially desirable approximations for Dodgson's voting rule , 2010, EC '10.

[851]  Onn Shehory,et al.  Coalition structure generation with worst case guarantees , 2022 .

[852]  P. Fishburn,et al.  Voting Procedures , 2022 .

[853]  A. Roth.  On the Allocation of Residents to Rural Hospitals: A General Property of Two-Sided Matching Markets , 1986 .

[854]  Steven J. Brams,et al.  N-Person Cake-Cutting: There May Be No Perfect Division , 2011, Am. Math. Mon..

[855]  Piotr Faliszewski,et al.  Finding a collective set of items: From proportional multirepresentation to group recommendation , 2014, Artif. Intell..

[856]  Michel Le Breton,et al.  On the Uniqueness of Equilibrium in Symmetric Two-Player Zero-Sum Games with Integer Payoffs , 2007 .

[857]  Felix Brandt,et al.  On the Fixed-Parameter Tractability of Composition-Consistent Tournament Solutions , 2011, IJCAI.

[858]  Felix Brandt,et al.  Characterization of dominance relations in finite coalitional games , 2010 .

[859]  P. Fishburn,et al.  The Mathematics Of Preference Choice And Order Essays In Honor Of Peter C Fishburn , 2009 .

[860]  Marilda Sotomayor.  Three remarks on the many-to-many stable matching problem , 1999 .

[861]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[862]  Sarit Kraus,et al.  How to Rig Elections and Competitions , 2008 .

[863]  Rolf Niedermeier,et al.  Weighted Tournament Solutions , 2016, Handbook of Computational Social Choice.

[864]  Yoav Shoham,et al.  On the complexity of schedule control problems for knockout tournaments , 2009, AAMAS.

[865]  Y. Chevaleyre,et al.  Allocation of Indivisible Goods , 2015 .

[866]  Felix Brandt,et al.  Optimal Partitions in Additively Separable Hedonic Games , 2011, IJCAI.

[867]  Felix A. Fischer,et al.  PageRank as a Weak Tournament Solution , 2007, WINE.

[868]  William Thomson,et al.  Monotonicity properties of bargaining solutions when applied to economics , 1988 .

[869]  Yoav Shoham,et al.  Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.

[870]  Moshe Tennenholtz,et al.  Mechanisms for multi-level marketing , 2011, EC '11.

[871]  Jörg Rothe,et al.  Computational Aspects of Manipulation and Control in Judgment Aggregation , 2013, ADT.

[872]  W. Gehrlein.  Condorcet's paradox and the likelihood of its occurrence: different perspectives on balanced preferences* , 2002 .

[873]  Kenneth O. May,et al.  A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision , 1952 .

[874]  J. Banks.  Sophisticated voting outcomes and agenda control , 1984 .

[875]  Edith Hemaspaandra,et al.  Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates , 2010, AAAI.

[876]  Yen-Liang Chen,et al.  A group recommendation system with consideration of interactions among group members , 2008, Expert Syst. Appl..

[877]  Felix Brandt,et al.  Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities , 2015, IJCAI.

[878]  H. Daniels.  Round-robin tournament scores , 1969 .

[879]  Hans-Peter Kriegel,et al.  Proceedings of the 6th GI-Conference on Theoretical Computer Science , 1983 .

[880]  L. Shapley.  A Value for n-person Games , 1988 .

[881]  M. Trick,et al.  The computational difficulty of manipulating an election , 1989 .

[882]  Christian List,et al.  A Model of Jury Decisions where all Jurors have the same Evidence , 2004, Synthese.

[883]  Vincent Conitzer,et al.  Communication complexity of common voting rules , 2005, EC '05.

[884]  Felix Brandt,et al.  On the tradeoff between economic efficiency and strategy proofness in randomized social choice , 2013, AAMAS.

[885]  Onur Kesten.  School Choice with Consent , 2010 .

[886]  Shao Chin Sung,et al.  On top responsiveness and strict core stability , 2007 .

[887]  Amin Saberi,et al.  An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods , 2010, SIAM J. Comput..

[888]  E. Leher.  An axiomatization of the Banzhaf value , 1988 .

[889]  H. Young,et al.  A Consistent Extension of Condorcet’s Election Principle , 1978 .

[890]  Felix A. Fischer,et al.  Possible and necessary winners of partial tournaments , 2012, AAMAS.

[891]  Ariel D. Procaccia,et al.  Frequent Manipulability of Elections: The Case of Two Voters , 2008, WINE.

[892]  Clemens Puppe,et al.  A simple procedure for finding equitable allocations of indivisible goods , 2002, Soc. Choice Welf..

[893]  Paul Resnick,et al.  Reputation systems , 2000, CACM.

[894]  Jean Lainé,et al.  Pareto efficiency in multiple referendum , 2012 .

[895]  Olivier Hudry,et al.  A survey on the complexity of tournament solutions , 2009, Math. Soc. Sci..

[896]  Michel Truchon,et al.  Maximum likelihood approach to vote aggregation with variable probabilities , 2004, Soc. Choice Welf..

[897]  Ariel D. Procaccia.  A note on the query complexity of the Condorcet winner problem , 2008, Inf. Process. Lett..

[898]  Pradeep Dubey,et al.  Mathematical Properties of the Banzhaf Power Index , 1979, Math. Oper. Res..

[899]  Eitan Muller,et al.  The equivalence of strong positive association and strategy-proofness , 1977 .

[900]  Ariel D. Procaccia,et al.  How to Cut a Cake Before the Party Ends , 2013, AAAI.

[901]  Parag A. Pathak,et al.  The Boston Public School Match , 2005 .

[902]  Hannu Nurmi,et al.  Closeness Counts in Social Choice , 2008 .

[903]  Moshe Babaioff,et al.  On bitcoin and red balloons , 2011, EC '12.

[904]  Andreas Darmann,et al.  Popular Spanning Trees , 2013, Int. J. Found. Comput. Sci..

[905]  F. Brandt,et al.  Computational Social Choice: Prospects and Challenges , 2011, FET.

[906]  Jinpeng Ma,et al.  On randomized matching mechanisms , 1996 .

[907]  Georges-Théodule Guilbaud.  Les théories de l'intérêt général et le problème logique de l'agrégation , 2012 .

[908]  Jesús Mario Bilbao,et al.  Computing power indices in weighted multiple majority games , 2003, Math. Soc. Sci..

[909]  Shmuel Nitzan,et al.  The Borda Rule and Pareto Stability: A Comment , 1979 .

[910]  Nicolas Maudet,et al.  Negotiating Socially Optimal Allocations of Resources , 2011, J. Artif. Intell. Res..

[911]  Michael Wooldridge,et al.  On the computational complexity of weighted voting games , 2009, Annals of Mathematics and Artificial Intelligence.

[912]  Gerhard Weiss,et al.  Multiagent Systems , 1999 .

[913]  Haris Aziz,et al.  Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations , 2013, WINE.

[914]  A. Roth,et al.  New Challenges in Multihospital Kidney Exchange. , 2012, The American economic review.

[915]  Ronald Fagin,et al.  Efficient similarity search and classification via rank aggregation , 2003, SIGMOD '03.

[916]  Yingqian Zhang,et al.  On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences , 2009, ADT.

[917]  H. Peyton Young,et al.  On Dividing an Amount According to Individual Claims or Liabilities , 1987, Math. Oper. Res..

[918]  Chandler Jake,et al.  Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) , 2016 .

[919]  M. Jackson,et al.  Strategic Candidacy and Voting Procedures , 2001 .

[920]  C. Puppe,et al.  The Handbook of Rational and Social Choice , 2009 .

[921]  G. Owen.  Multilinear extensions and the banzhaf value , 1975 .

[922]  Matthew O. Jackson,et al.  The Stability of Hedonic Coalition Structures , 2002, Games Econ. Behav..

[923]  Ioannis Caragiannis,et al.  The Efficiency of Fair Division , 2009, Theory of Computing Systems.

[924]  W. Wallis.  The Theory of Voting , 2012 .

[925]  S. Berg.  Condorcet's jury theorem revisited , 1993 .

[926]  William Thomson,et al.  Welfare-domination under preference-replacement: A survey and open questions , 1999 .

[927]  Xiaotie Deng,et al.  On the complexity of crossings in permutations , 2009, Discret. Math..

[928]  William A. Gamson,et al.  A theory of coalition formation , 1961 .

[929]  Nir Dagan,et al.  A Note on Thomson's Characterizations of the Uniform Rule , 1996 .

[930]  Pavel Yu. Chebotarev,et al.  Characterizations of scoring methodsfor preference aggregation , 1998, Ann. Oper. Res..

[931]  David Manlove,et al.  Algorithmics of Matching Under Preferences , 2013, Bull. EATCS.

[932]  Salvador Barberà,et al.  Majority and Positional Voting in a Probabilistic Framework , 1979 .

[933]  TOURNAMENTS , 2008 .

[934]  T. Tideman,et al.  Independence of clones as a criterion for voting rules , 1987 .

[935]  Gabriel Pinski,et al.  Citation influence for journal aggregates of scientific publications: Theory, with application to the literature of physics , 1976, Inf. Process. Manag..

[936]  Vincent Conitzer,et al.  Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders , 2008, AAAI.

[937]  Jörg Rothe,et al.  The Complexity of Manipulative Actions in Single-Peaked Societies , 2016, Economics and Computation.

[938]  J. Roemer.  The Mismarriage of Bargaining Theory and Distributive Justice , 1986, Ethics.

[939]  Saburo Muroga,et al.  Threshold logic and its applications , 1971 .

[940]  Thomas Schiex,et al.  Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison , 1999, Constraints.

[941]  Ulrich Endriss,et al.  Collective Annotation of Linguistic Resources: Basic Principles and a Formal Model , 2013, ACL.

[942]  R. Beran.  National resident matching program. , 1999, Gastroenterology.

[943]  Mark C. Wilson,et al.  Best Reply Dynamics for Scoring Rules , 2012, ECAI.

[944]  D. Golovin.  Max-min fair allocation of indivisible goods , 2005 .

[945]  SangMok Lee,et al.  Incentive Compatibility of Large Centralized Matching Markets , 2017 .

[946]  Yann Chevaleyre,et al.  Fair Allocation of Indivisible Goods , 2016, Handbook of Computational Social Choice.

[947]  Peter C. Fishburn,et al.  FAIR DIVISION OF INDIVISIBLE ITEMS , 2003 .

[948]  Ulrich Pferschy,et al.  The traveling group problem , 2007, Soc. Choice Welf..

[949]  Jérôme Lang,et al.  A General Elicitation-Free Protocol for Allocating Indivisible Goods , 2011, IJCAI.

[950]  Simina Brânzei,et al.  Externalities in Cake Cutting , 2013, IJCAI.

[951]  Vincent Conitzer,et al.  Strategy-Proof Voting Rules over Multi-issue Domains with Restricted Preferences , 2010, WINE.

[952]  Narges Simjour,et al.  Parameterized Enumeration of Neighbour Strings and Kemeny Aggregations , 2013 .

[953]  L. Ehlers,et al.  Consistent House Allocation , 2005 .

[954]  Nir Ailon,et al.  Aggregating inconsistent information: Ranking and clustering , 2008 .

[955]  Ronald A. Howard,et al.  Readings on the Principles and Applications of Decision Analysis , 1989 .

[956]  Onur Doğan,et al.  Anonymous and Neutral Social Choice:Existence Results on Resoluteness , 2015 .

[957]  Saket Saurabh,et al.  Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG , 2007, Inf. Process. Lett..

[958]  Ariel D. Procaccia,et al.  Better Human Computation Through Principled Voting , 2013, AAAI.

[959]  Toby Walsh,et al.  Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules , 2014, Artif. Intell..

[960]  Klaus Ambos-Spies,et al.  Randomness, Relativizations, and Polynomial Reducibilities , 1986, SCT.

[961]  Arkadii M. Slinko,et al.  How large should a coalition be to manipulate an election? , 2004, Math. Soc. Sci..

[962]  Ariel D. Procaccia.  Thou Shalt Covet Thy Neighbor's Cake , 2009, IJCAI.

[963]  Umberto Grandi,et al.  Binary Aggregation with Integrity Constraints , 2011, IJCAI.

[964]  A. Roth,et al.  Jumping the Gun: Imperfections and Institutions Related to the Timing of Market Transactions , 1994 .

[965]  Edith Elkind,et al.  The Shapley Value as a Function of the Quota in Weighted Voting Games , 2011, IJCAI.

[966]  Sébastien Konieczny,et al.  Logic Based Merging , 2011, J. Philos. Log..

[967]  Meir Kalech,et al.  Practical voting rules with partial information , 2010, Autonomous Agents and Multi-Agent Systems.

[968]  Hong Liu,et al.  Parameterized complexity of control problems in Maximin election , 2010, Inf. Process. Lett..

[969]  John B. Kidd,et al.  Decisions with Multiple Objectives—Preferences and Value Tradeoffs , 1977 .

[970]  Jörg Rothe,et al.  Control in Judgment Aggregation , 2012, STAIRS.

[971]  H. Moulin.  Cooperative Microeconomics: A Game-Theoretic Introduction , 1995 .

[972]  Thomas Brendan Murphy,et al.  Mixtures of distance-based models for ranking data , 2003, Comput. Stat. Data Anal..

[973]  Lane A. Hemaspaandra,et al.  Guarantees for the success frequency of an algorithm for finding Dodgson-election winners , 2009, J. Heuristics.

[974]  Nicholas R. Jennings,et al.  Coalition Structure Generation in Multi-Agent Systems with Positive and Negative Externalities , 2009, IJCAI.

[975]  Omer Lev,et al.  Analysis of Equilibria in Iterative Voting Schemes , 2015, AAAI.

[976]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[977]  Kurt Mehlhorn,et al.  Popular matchings , 2005, SODA '05.

[978]  Piotr Faliszewski,et al.  Properties of multiwinner voting rules , 2014, Social Choice and Welfare.

[979]  Ruggiero Cavallo,et al.  Fairness and Welfare Through Redistribution When Utility Is Transferable , 2012, AAAI.

[980]  Gerhard J. Woeginger,et al.  A characterization of the single-crossing domain , 2013, Soc. Choice Welf..

[981]  D. Saari.  Basic Geometry of Voting , 1995 .

[982]  Ulrich Endriss,et al.  Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects , 2014, J. Artif. Intell. Res..

[983]  Toby Walsh,et al.  Manipulating Tournaments in Cup and Round Robin Competitions , 2009, ADT.

[984]  Mehran Hojati,et al.  Optimal political districting , 1996, Comput. Oper. Res..

[985]  S. Barberà.  Chapter Twenty-Five - Strategyproof Social Choice , 2011 .

[986]  Christian Klamler,et al.  Distance-Based Aggregation Theory , 2011, Consensual Processes.

[987]  Ronen I. Brafman,et al.  UCP-Networks: A Directed Graphical Representation of Conditional Utilities , 2001, UAI.

[988]  Francesca Rossi,et al.  Preference Aggregation over Restricted Ballot Languages: Sincerity and Strategy-Proofness , 2009, IJCAI.

[989]  Markus Schulze,et al.  A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method , 2011, Soc. Choice Welf..

[990]  Omer Lev,et al.  A local-dominance theory of voting equilibria , 2014, EC.

[991]  Pavel Yu. Chebotarev,et al.  Characterizations of scoring methods for preference aggregation , 2006, ArXiv.

[992]  Mark Kamine.  And the Loser Is , 2005 .

[993]  M. Kamien,et al.  The paradox of voting: probability calculations. , 1968, Behavioral science.

[994]  Harrie C. M. de Swart,et al.  Computing tournament solutions using relation algebra and RelView , 2013, Eur. J. Oper. Res..

[995]  Warren D. Smith.  Range voting , 2000 .

[996]  Ariel D. Procaccia,et al.  Complexity of unweighted coalitional manipulation under some common voting rules , 2009, IJCAI 2009.

[997]  Min Zhu,et al.  College Admissions in China : A Mechanism Design Perspective , 2013 .

[998]  Ronald A. Howard,et al.  Influence Diagrams , 2005, Decis. Anal..

[999]  Elisha A. Pazner.  Pitfalls in the Theory of Fairness , 1977 .

[1000]  Nic Wilson,et al.  Extending CP-Nets with Stronger Conditional Preference Statements , 2004, AAAI.

[1001]  Daniel N. Osherson,et al.  Methods for distance-based judgment aggregation , 2009, Soc. Choice Welf..

[1002]  Ulrich Endriss,et al.  Complexity of Judgment Aggregation , 2012, J. Artif. Intell. Res..

[1003]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[1004]  Dieter Sondermann,et al.  Arrow's theorem, many agents, and invisible dictators☆ , 1972 .

[1005]  Steven J. Brams,et al.  The undercut procedure: an algorithm for the envy-free division of indivisible items , 2009, Soc. Choice Welf..

[1006]  Moshe Tennenholtz,et al.  Ranking systems: the PageRank axioms , 2005, EC '05.

[1007]  Michael R. Fellows,et al.  Fundamentals of Parameterized Complexity , 2013 .

[1008]  Lester E. Dubins,et al.  How to Cut a Cake Fairly , 1961 .

[1009]  J. Moon.  Topics on tournaments , 1968 .

[1010]  Andrea Scozzari,et al.  Political Districting: from classical models to recent approaches , 2013, Annals of Operations Research.

[1011]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[1012]  Stef Tijs,et al.  Models in Cooperative Game Theory , 2008 .

[1013]  Avrim Blum,et al.  Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges , 2007, EC '07.

[1014]  Ruth Ben-Yashar,et al.  Optimal decision rules for fixed-size committees in polychotomous choice situations , 2001, Soc. Choice Welf..

[1015]  Christian Komusiewicz,et al.  New Races in Parameterized Algorithmics , 2012, MFCS.

[1016]  A. McLennan.  Consequences of the Condorcet Jury Theorem for Beneficial Information Aggregation by Rational Agents , 1998, American Political Science Review.

[1017]  P. Fishburn,et al.  Algebraic aggregation theory , 1986 .

[1018]  John Duggan,et al.  Social choice and electoral competition in the general spatial model , 2006, J. Econ. Theory.

[1019]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[1020]  Rudolf Berghammer.  Computing minimal extending sets by relation-algebraic modeling and development , 2014, J. Log. Algebraic Methods Program..

[1021]  H. Moulin.  Dominance Solvable Voting Schemes , 1979 .

[1022]  David Cary,et al.  Estimating the Margin of Victory for Instant-Runoff Voting , 2011, EVT/WOTE.

[1023]  Alex Samorodnitsky,et al.  A new perspective on implementation by voting trees , 2011, Random Struct. Algorithms.

[1024]  Felix Brandt,et al.  Minimal extending sets in tournaments , 2014, Math. Soc. Sci..

[1025]  Jörg Rothe,et al.  The Complexity of Online Manipulation of Sequential Elections , 2012, TARK.

[1026]  Piotr Faliszewski,et al.  A Richer Understanding of the Complexity of Election Systems , 2006, Fundamental Problems in Computing.

[1027]  Richard Edwin Stearns,et al.  The Voting Problem , 1959 .

[1028]  Adam Tauman Kalai,et al.  Trust-based recommendation systems: an axiomatic approach , 2008, WWW.

[1029]  B. Leclerc,et al.  Finite Ordered Sets: Concepts, Results and Uses , 2012 .

[1030]  Srinivas Aluru,et al.  Consensus Genetic Maps as Median Orders from Inconsistent Sources , 2008, TCBB.

[1031]  Felix A. Fischer,et al.  On the Hardness and Existence of Quasi-Strict Equilibria , 2008, SAGT.

[1032]  Edith Hemaspaandra,et al.  A Control Dichotomy for Pure Scoring Rules , 2014, AAAI.

[1033]  Jörg Rothe,et al.  How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation , 2011, ADT.

[1034]  Paul Harrenstein,et al.  Fractional Hedonic Games , 2014, AAMAS.

[1035]  Claire Mathieu,et al.  Electronic Colloquium on Computational Complexity, Report No. 144 (2006) How to rank with few errors A PTAS for Weighted Feedback Arc Set on Tournaments , 2006 .

[1036]  Shafi Goldwasser,et al.  Proceedings of the 3rd Innovations in Theoretical Computer Science Conference , 2012 .

[1037]  S. Brams,et al.  The paradox of multiple elections , 1998 .

[1038]  M. Kendall,et al.  Rank Correlation Methods , 1949 .

[1039]  Daniel S. Hirschberg,et al.  Complexity of the stable marriage and stable roommate problems in three dimensions , 1988 .

[1040]  Piotr Faliszewski,et al.  Prices matter for the parameterized complexity of shift bribery , 2014, Inf. Comput..

[1041]  Anders Yeo,et al.  The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments , 2006, Combinatorics, Probability and Computing.

[1042]  Shmuel Nitzan,et al.  Some measures of closeness to unanimity and their implications , 1981 .

[1043]  Michael R. Fellows,et al.  On complexity of lobbying in multiple referenda , 2006 .

[1044]  Ronald L. Rivest,et al.  Computing the Margin of Victory in IRV Elections , 2011, EVT/WOTE.

[1045]  Svetlana Obraztsova,et al.  Ties Matter: Complexity of Voting Manipulation Revisited , 2011, IJCAI.

[1046]  Piotr Faliszewski,et al.  Fully Proportional Representation as Resource Allocation: Approximability Results , 2012, IJCAI.

[1047]  Martin Olsen,et al.  Nash Stability in Additively Separable Hedonic Games and Community Structures , 2009, Theory of Computing Systems.

[1048]  N. Russell.  Complexity of control of Borda count elections , 2007 .

[1049]  Alvin E. Roth,et al.  Pairwise Kidney Exchange , 2004, J. Econ. Theory.

[1050]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[1051]  Jean-Claude Falmagne,et al.  A Polynomial Time Algorithm for Unidimensional Unfolding Representations , 1994, J. Algorithms.

[1052]  Onur Kesten,et al.  Coalitional strategy-proofness and resource monotonicity for house allocation problems , 2009, Int. J. Game Theory.

[1053]  David F. Manlove,et al.  Stable Marriage with Ties and Unacceptable Partners , 1999 .

[1054]  Christian Klamler,et al.  Two-Person Fair Division of Indivisible Items: An Efficient, Envy-Free Algorithm , 2013 .

[1055]  Thomas C. Ratliff.  A comparison of Dodgson's method and Kemeny's rule , 2001, Soc. Choice Welf..

[1056]  Thomas Hare.  The Election of Representatives, Parliamentary and Municipal: A Treatise , 2008 .

[1057]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[1058]  Jean-François Laslier,et al.  Handbook on approval voting , 2010 .

[1059]  Julie A. Adams,et al.  Strategyproof approximations of distance rationalizable voting rules , 2012, AAMAS.

[1060]  Marija Slavkovik,et al.  Judgment Aggregation Rules and Voting Rules , 2013, ADT.

[1061]  Toby Walsh,et al.  Fixing a Balanced Knockout Tournament , 2014, AAAI.

[1062]  Gerhard J. Woeginger,et al.  On the complexity of cake cutting , 2007, Discret. Optim..