A new old solution for weak tournaments
From MaRDI portal
Publication:2450153
DOI10.1007/S00355-011-0561-2zbMATH Open1287.91054OpenAlexW1990925071MaRDI QIDQ2450153FDOQ2450153
Authors: Vincent Anesi
Publication date: 16 May 2014
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: http://orbilu.uni.lu/handle/10993/44306
Recommendations
- A consistent tournament solution
- scientific article; zbMATH DE number 1022237
- A constructive solution to a problem of ranking tournaments
- Extending tournament solutions
- Tournament solutions
- Weakening arcs in tournaments
- Weighted tournament solutions
- A Problem on Tournaments
- scientific article; zbMATH DE number 4043867
- scientific article; zbMATH DE number 1805988
Cites Work
- Title not available (Why is that?)
- Coalition formation as a dynamic process.
- The bipartisan set of a tournament game
- Tournament solutions and majority voting
- The simplest equilibrium of a majority-rule division game
- STABLE SETS FOR SIMPLE GAMES WITH ORDINAL PREFERENCES
- Covering sets and a new Condorcet choice correspondence
- The Computational Complexity of Choice Sets
- Noncooperative foundations of stable sets in voting games
- Candidates with policy preferences: A dynamic model
- A survey on the complexity of tournament solutions
- Choosing from a tournament
- Dutta's minimal covering set and Shapley's saddles
- Condorcet choice correspondences for weak tournaments
- Committees with farsighted voters: A new interpretation of stable sets
- Comparison functions and choice correspondences
- Mixed refinements of Shapley's saddles and weak tournaments
- Robustness of the median voter result
- A note on the core and von Neumann-Morgenstern solutions of simple games
Cited In (7)
- How can an elimination tournament favor a weaker player?
- Weakening arcs in tournaments
- Dynamic stable set as a tournament solution
- Dynamic bargaining and stability with veto players
- On the structure of stable tournament solutions
- Von Neumann-Morgenstern stable set rationalization of choice functions
- Tournament solutions based on cooperative game theory
This page was built for publication: A new old solution for weak tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450153)