Minimal retentive sets in tournaments
From MaRDI portal
Publication:483107
DOI10.1007/s00355-013-0740-4zbMath1302.91075OpenAlexW3137471377MaRDI QIDQ483107
Felix Brandt, Markus Brill, Paul Harrenstein, Felix Fischer
Publication date: 15 December 2014
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: http://eprints.gla.ac.uk/131327/7/131327.pdf
Related Items (5)
Query complexity of tournament solutions ⋮ On the structure of stable tournament solutions ⋮ A counterexample to a conjecture of Schwartz ⋮ A note on contestation-based tournament solutions ⋮ Bounds on the disparity and separation of tournament solutions
Cites Work
- Unnamed Item
- Unnamed Item
- Minimal stable sets in tournaments
- Set-rationalizable choice and self-stability
- Still more on the tournament equilibrium set
- On the tournament equilibrium set
- Evaluation and decision models with multiple criteria. Stepping stones for the analyst.
- Cyclic tournaments and cooperative majority voting: A solution
- Computing the minimal covering set
- A computational analysis of the tournament equilibrium set
- Characterization of dominance relations in finite coalitional games
- Computational properties of argument systems satisfying graph-theoretic constraints
- Choosing from a tournament
- Strategy subsets closed under rational behavior
- The bipartisan set of a tournament game
- Tournament solutions and majority voting
- Dutta's minimal covering set and Shapley's saddles
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Composition-consistent tournament solutions and social choice functions
- A counterexample to a conjecture of Schwartz
- Banks winners in tournaments are difficult to recognize
- The Computational Complexity of Choice Sets
- Tournament games and positive tournaments
- Ranking Tournaments
This page was built for publication: Minimal retentive sets in tournaments
