Abstract: We propose a systematic methodology for defining tournament solutions as extensions of maximality. The central concepts of this methodology are maximal qualified subsets and minimal stable sets. We thus obtain an infinite hierarchy of tournament solutions, which encompasses the top cycle, the uncovered set, the Banks set, the minimal covering set, the tournament equilibrium set, the Copeland set, and the bipartisan set. Moreover, the hierarchy includes a new tournament solution, the minimal extending set, which is conjectured to refine both the minimal covering set and the Banks set.
Recommendations
- Minimal retentive sets in tournaments
- Minimal extending sets in tournaments
- Stable sets of weak tournaments
- The minimal covering set in large tournaments
- On finding a minimum dominating set in a tournament
- Dynamic stable set as a tournament solution
- On min-max pair in tournaments
- A Min-Max Theorem on Tournaments
- On the structure of stable tournament solutions
- On Sets of Consistent Arcs in a Tournament
Cites work
- scientific article; zbMATH DE number 3139280 (Why is no real title available?)
- scientific article; zbMATH DE number 3972536 (Why is no real title available?)
- scientific article; zbMATH DE number 44383 (Why is no real title available?)
- scientific article; zbMATH DE number 599111 (Why is no real title available?)
- scientific article; zbMATH DE number 3205074 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A computational analysis of the tournament equilibrium set
- Aggregation of Preferences with Variable Electorate
- Banks winners in tournaments are difficult to recognize
- Characterization of dominance relations in finite coalitional games
- Choosing from a tournament
- Condorcet Social Choice Functions
- Consistency, Rationality and Collective Choice
- Covering sets and a new Condorcet choice correspondence
- Cyclic tournaments and cooperative majority voting: A solution
- Dutta's minimal covering set and Shapley's saddles
- Evaluation and decision models with multiple criteria. Stepping stones for the analyst.
- Feedback vertex sets in tournaments
- Non-cooperative games
- On the possibility of reasonable consistent majoritarian choice: Some positive results
- Sophisticated voting outcomes and agenda control
- Still more on the tournament equilibrium set
- Strategy subsets closed under rational behavior
- The bipartisan set of a tournament game
- Tournament games and positive tournaments
- Tournament solutions and majority voting
Cited in
(22)- The number of tournaments with the minimum number of upsets
- The minimal covering set in large tournaments
- Feedback vertex sets in tournaments
- Bounds on the disparity and separation of tournament solutions
- Computing minimal extending sets by relation-algebraic modeling and development
- Rational stability of choice functions
- Von Neumann-Morgenstern stable set rationalization of choice functions
- Stable cores in information graph games
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Minimal extending sets in tournaments
- Set-monotonicity implies Kelly-strategyproofness
- A refinement of the uncovered set in tournaments
- Dynamic stable set as a tournament solution
- Stable sets of weak tournaments
- Dominating, weakly stable, and uncovered sets: properties and generalizations
- Characterizing the top cycle via strategyproofness
- Minimal retentive sets in tournaments
- Set-rationalizable choice and self-stability
- On the structure of stable tournament solutions
- Uncovered sets
- A counterexample to a conjecture of Schwartz
- Tournament solutions based on cooperative game theory
This page was built for publication: Minimal stable sets in tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634517)
