Covering sets and a new Condorcet choice correspondence
From MaRDI portal
Publication:1107402
DOI10.1016/0022-0531(88)90096-8zbMath0652.90013OpenAlexW1983254396MaRDI QIDQ1107402
Publication date: 1988
Published in: Journal of Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0531(88)90096-8
tournamentaxiomatic characterizationcovering setuncovered setCondorcet choice correspondencenew solution concept
Related Items
Weak covering relations ⋮ The Copeland measure of Condorcet choice functions ⋮ Condorcet-consistent and approximately strategyproof tournament rules ⋮ A refinement of the uncovered set in tournaments ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Majority-approval social choice ⋮ Condorcet choice correspondences: A set-theoretical comparison ⋮ The complexity of computing minimal unidirectional covering sets ⋮ Minimal extending sets in tournaments ⋮ Tournament solutions based on cooperative game theory ⋮ Rational stability of choice functions ⋮ Dynamic stable set as a tournament solution ⋮ Individual choice under social influence ⋮ Von Neumann-Morgenstern stable set rationalization of choice functions ⋮ Minimal stable sets in tournaments ⋮ Set-rationalizable choice and self-stability ⋮ On the structure of stable tournament solutions ⋮ Cyclic tournaments and cooperative majority voting: A solution ⋮ The computational complexity of weak saddles ⋮ Renegotiation perfection in infinite games ⋮ Representation in majority tournaments ⋮ A new old solution for weak tournaments ⋮ The minimal covering set in large tournaments ⋮ A counterexample to a conjecture of Schwartz ⋮ Voting Procedures, Complexity of ⋮ Computing the minimal covering set ⋮ Rank-based choice correspondences ⋮ Weakened WARP and top-cycle choice rules ⋮ Dynamic coalitional equilibrium ⋮ A social choice theory of legitimacy ⋮ Preference-based choice functions: a generalized approach ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ A new monotonicity condition for tournament solutions ⋮ An ordinal minimax theorem ⋮ Minimal covering set solutions ⋮ On the tournament equilibrium set ⋮ The Computational Complexity of Choice Sets ⋮ Some Remarks on Dodgson's Voting Rule ⋮ Uncovered set choice rules ⋮ Choosing from a large tournament ⋮ Choosing from a weighted tournament ⋮ A survey on the complexity of tournament solutions ⋮ Bounds for mixed strategy equilibria and the spatial model of elections ⋮ Distributive politics and electoral competition ⋮ Bounds on the disparity and separation of tournament solutions ⋮ Coalitional stability with a credibility constraint
Cites Work
