Cyclic tournaments and cooperative majority voting: A solution
From MaRDI portal
Publication:912750
DOI10.1007/BF01832917zbMath0698.90008OpenAlexW2035165846MaRDI QIDQ912750
Publication date: 1990
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01832917
social choicecooperative bargainingcooperative majority votingpredictive strengthretentivenessTournament Equilibrium Set
Related Items
Extending tournament solutions, Weak covering relations, The Copeland measure of Condorcet choice functions, Condorcet-consistent and approximately strategyproof tournament rules, Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox, A refinement of the uncovered set in tournaments, A survey on the linear ordering problem for weighted or unweighted tournaments, Condorcet choice correspondences: A set-theoretical comparison, Minimal extending sets in tournaments, Computing minimal extending sets by relation-algebraic modeling and development, Set-monotonicity implies Kelly-strategyproofness, Ranking by outdegree for directed graphs, Minimal stable sets in tournaments, Internal slackening scoring methods, Set-rationalizable choice and self-stability, On the structure of stable tournament solutions, On two new social choice correspondences., Representation in majority tournaments, The minimal covering set in large tournaments, A counterexample to a conjecture of Schwartz, A note on contestation-based tournament solutions, Minimal retentive sets in tournaments, Voting Procedures, Complexity of, Rank-based choice correspondences, A computational analysis of the tournament equilibrium set, A social choice theory of legitimacy, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Characterization of dominance relations in finite coalitional games, Still more on the tournament equilibrium set, On the tournament equilibrium set, Choosing from a large tournament, A survey on the complexity of tournament solutions, Bounds on the disparity and separation of tournament solutions
Cites Work
- Unnamed Item
- Sophisticated voting outcomes and agenda control
- Choosing from a tournament
- Covering sets and a new Condorcet choice correspondence
- Voting games, indifference, and consistent sequential choice rules
- Cyclical preference logic
- On Schwartz's rule
- A multistage game representation of sophisticated voting for binary procedures
- Dominance Solvable Voting Schemes
- An Impossibility Theorem for Fixed Preferences: A Dictatorial Bergson- Samuelson Welfare Function
- Condorcet Social Choice Functions