Choosing from a tournament
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- scientific article; zbMATH DE number 3378948 (Why is no real title available?)
- A multistage game representation of sophisticated voting for binary procedures
- Aggregation of Preferences with Variable Electorate
- Choice functions over a finite set: A summary
- Condorcet Social Choice Functions
- Dominance Solvable Voting Schemes
- On the possibility of reasonable consistent majoritarian choice: Some positive results
- Ranking the Participants in a Tournament
- Social Choice Theory: A Re-Examination
- Sophisticated voting outcomes and agenda control
- The Copeland choice function. An axiomatic characterization
Cited in
(89)- A 16-vertex tournament for which Banks set and Slater set are disjoint
- Voting by successive elimination and strategic candidacy
- The budget-voting paradox
- The stability set as a social choice correspondence.
- Fuzzy sets and decision analysis
- Weakened WARP and top-cycle choice rules
- Majority tournaments: Sincere and sophisticated voting decisions under amendment procedure
- Concorcet's principle implies the no show paradox
- scientific article; zbMATH DE number 895060 (Why is no real title available?)
- A note on the McKelvey uncovered set and Pareto optimality
- Uncovered set choice rules
- ON THE CHACTERISTIC NUMBERS OF VOTING GAMES
- Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting
- On fuzzy tournaments and their solution concepts in group decision making
- A characterization of the Copeland solution
- Awareness of voter passion greatly improves the distortion of metric social choice
- Choice using cyclic tournament relations
- Computing the minimal covering set
- Condorcet choice correspondences for weak tournaments
- Condorcet choice and the Ostrogorski paradox
- A tournament of order 14 with disjoint Banks and Slater sets
- Implementing alternative voting in kingmaker trees
- Bounds on the disparity and separation of tournament solutions
- Rational stability of choice functions
- A new old solution for weak tournaments
- Covering sets and a new Condorcet choice correspondence
- Approximating optimal social choice under metric preferences
- Still more on the tournament equilibrium set
- The relationship between two algorithms for decisions via sophisticated majority voting with an agenda
- Representation in majority tournaments
- Repeated Downsian electoral competition
- Choosing from a large tournament
- Bounds for mixed strategy equilibria and the spatial model of elections
- Minimal extending sets in tournaments
- scientific article; zbMATH DE number 1389739 (Why is no real title available?)
- Implementation via backward induction
- Minimal covering set solutions
- The stability set of voting games: Classification and genericity results
- The Copeland measure of Condorcet choice functions
- Discrepancies in the outcomes resulting from different voting schemes
- A systematic approach to the construction of non-empty choice sets
- The Computational Complexity of Choice Sets
- Dynamic stable set as a tournament solution
- Choice and individual welfare
- Voting games, indifference, and consistent sequential choice rules
- Social choice and electoral competition in the general spatial model
- Fuzzy social choice: a selective retrospect
- A new perspective on implementation by voting trees
- The solution of generalized stable sets and its refinement
- Minimal retentive sets in tournaments
- Can strategizing in round-robin subtournaments be avoided?
- Voting with rubber bands, weights, and strings
- Set-rationalizable choice and self-stability
- Voting procedures, complexity of
- Comparison functions and choice correspondences
- FUZZY SETS IN POLITICAL SCIENCE: AN OVERVIEW
- Maximum distance between Slater orders and Copeland orders of tournaments
- Uncovered sets
- Cyclic tournaments and cooperative majority voting: A solution
- On the complexity of bribery and manipulation in tournaments with uncertain information
- Condorcet choice correspondences: A set-theoretical comparison
- A foundation for strategic agenda voting
- Minimal stable sets in tournaments
- A solution for abstract decision problems based on maximum flow value
- Choice resolutions
- scientific article; zbMATH DE number 1805988 (Why is no real title available?)
- Choice procedure in fuzzy multicriteria decision analysis based on pairwise comparisons
- Revealed VNM-solutions: characterizations
- Choosing from a weighted tournament
- Extending tournament solutions
- On the subgame perfect implementability of voting rules
- Robust bounds on choosing from large tournaments
- Black and Farquharson on order-of-voting effects: An extension
- Robust bounds on choosing from large tournaments
- King-chicken choice correspondences
- In quest of the Banks set in spatial voting games
- An axiomatic characterization of the Slater rule
- A refinement of the uncovered set in tournaments
- Building bridges over the great divide
- Tournament solutions
- Condorcet-consistent and approximately strategyproof tournament rules
- Characterizing the top cycle via strategyproofness
- Two‐stage majoritarian choice
- Fair elimination-type competitions
- On the difficulty of making social choices
- The supercovering relation, the pairwise winner, and more missing links between Borda and Condorcet
- Query complexity of tournament solutions
- Weak covering relations
- Characterising scoring rules by their solution in iteratively undominated strategies
This page was built for publication: Choosing from a tournament
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089228)
