A survey on the complexity of tournament solutions

DOI10.1016/j.mathsocsci.2008.12.002zbMath1176.91030OpenAlexW2060588821MaRDI QIDQ1042317

Olivier Hudry

Publication date: 7 December 2009

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2008.12.002

zbMATH Keywords

complexityvoting theorymajority tournamenttournament solutions

Mathematics Subject Classification ID

Voting theory (91B12)

Related Items

Possible winner problems on partial tournaments: a parameterized study ⋮ Tournament solutions based on cooperative game theory ⋮ Computing minimal extending sets by relation-algebraic modeling and development ⋮ Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms ⋮ Query complexity of tournament solutions ⋮ The computational complexity of rationalizing boundedly rational choice behavior ⋮ On the structure of stable tournament solutions ⋮ On the computation of median linear orders, of median complete preorders and of median weak orders ⋮ A new old solution for weak tournaments ⋮ Surprises in Knockout Tournaments ⋮ Can strategizing in round-robin subtournaments be avoided? ⋮ Voting Procedures, Complexity of ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Making choices with a binary relation: relative choice axioms and transitive closures ⋮ Robust bounds on choosing from large tournaments ⋮ Margin of victory for tournament solutions ⋮ On the complexity of Slater's problems ⋮ A graph interpretation of the least squares ranking method ⋮ Robust bounds on choosing from large tournaments ⋮ Bounds on the disparity and separation of tournament solutions ⋮ Complexity results for extensions of median orders to different types of remoteness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclic tournaments and cooperative majority voting: A solution
• Computing the minimal covering set
• On the complexity of Slater's problems
• Sophisticated voting outcomes and agenda control
• Covering sets and a new Condorcet choice correspondence
• The median procedure in cluster analysis and social choice theory
• Tournament solutions and majority voting
• Intrinsic properties of the self-consistent choice rule
• Banks winners in tournaments are difficult to recognize
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Solution of a Ranking Problem from Binary Comparisons
• The Computational Complexity of Choice Sets
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• Condorcet Social Choice Functions
• Ranking Tournaments

This page was built for publication: A survey on the complexity of tournament solutions