Minimal extending sets in tournaments

DOI10.1016/J.MATHSOCSCI.2016.12.007zbMath1397.91185OpenAlexW2587868077MaRDI QIDQ2406936

Hans Georg Seedig, Felix Brandt, Paul Harrenstein

Publication date: 4 October 2017

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

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

zbMATH Keywords

irregularitysocial choice theoryidempotencyminimal extending settournament solutioniterative banks set

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Social choice (91B14)

Related Items (5)

A refinement of the uncovered set in tournaments ⋮ Tournament solutions based on cooperative game theory ⋮ Individual choice under social influence ⋮ On the structure of stable tournament solutions ⋮ \(k\)-majority digraphs and the hardness of voting with a constant number of voters

Uses Software

• Traces
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal stable sets in tournaments
• Set-rationalizable choice and self-stability
• Evaluation and decision models with multiple criteria. Stepping stones for the analyst.
• Set-monotonicity implies Kelly-strategyproofness
• Cyclic tournaments and cooperative majority voting: A solution
• A computational analysis of the tournament equilibrium set
• Characterization of dominance relations in finite coalitional games
• Sophisticated voting outcomes and agenda control
• Choosing from a tournament
• Covering sets and a new Condorcet choice correspondence
• The bipartisan set of a tournament game
• Tournament solutions and majority voting
• A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
• Dutta's minimal covering set and Shapley's saddles
• Bounds on the disparity and separation of tournament solutions
• Statement of precedence and a comment on IIA terminology
• Practical graph isomorphism. II.
• A counterexample to a conjecture of Schwartz
• Banks winners in tournaments are difficult to recognize
• Tournament games and positive tournaments
• Tournament Solutions
• Rational Selection of Decision Functions

This page was built for publication: Minimal extending sets in tournaments