Tournament solutions and majority voting
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A consistent tournament solution
- Self-selective social choice functions
- The Condorcet set: majority voting over interconnected propositions
- Robust bounds on choosing from large tournaments
- Extending tournament solutions
- A social choice theory of legitimacy
- A generalization to networks of Young's characterization of the Borda rule
- Ranking journals in sociology, education, and public administration by social choice theory methods
- Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games
- Dynamic coalitional equilibrium
- Introduction to political science
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Minimal extending sets in tournaments
- Computing minimal extending sets by relation-algebraic modeling and development
- Properties of multiwinner voting rules
- Bivariate scoring rules: unifying the characterizations of positional scoring rules and Kemeny's rule
- Tournament solutions
- In quest of the Banks set in spatial voting games
- Minimal stable sets in tournaments
- Jeffrey Scot Banks (1958--2000)
- Uncovered set choice rules
- The Copeland ratio ranking method for abstract decision problems
- Preference-based reinforcement learning: evolutionary direct policy search using a preference-based racing algorithm
- Centrality measures in networks
- The Banks Set and the Uncovered Set in Budget Allocation Problems
- On the reversal bias of the minimax social choice correspondence
- The solution of generalized stable sets and its refinement
- Axioms for centrality scoring with principal eigenvectors
- Representative democracy and the implementation of majority-preferred alternatives
- Voting procedures, complexity of
- How to identify experts in a community?
- Cyclic tournaments and cooperative majority voting: A solution
- A note on contestation-based tournament solutions
- On the complexity of Slater's problems
- Strategy-proofness and weighted voting
- Choosing from a large tournament
- A survey on the complexity of tournament solutions
- Strategy-proof preference aggregation: possibilities and characterizations
- On different ranking methods
- A solution for abstract decision problems based on maximum flow value
- Internal slackening scoring methods
- Approximability of Dodgson's rule
- On approximately strategy-proof tournament rules for collusions of size at least three
- On a compromise social choice correspondence
- A stochastic method for exploiting outranking relations in multicriteria choice problems
- Hyper-stable social welfare functions
- Voting by successive elimination and strategic candidacy
- Sophisticated voting rules: The case of two tournaments
- Rational stability of choice functions
- Accessibility in oriented networks
- Homomorphism complexes, reconfiguration, and homotopy for directed graphs
- Characterizations of the 3-cycle count and backward length of a tournament
- Group decisions from individual rankings: the Borda-Condorcet rule
- Robust bounds on choosing from large tournaments
- Vote swapping in irresolute two-tier voting procedures
- Control of Condorcet voting: complexity and a relation-algebraic approach
- The Dodgson ranking and the Borda count: a binary comparison
- Set-monotonicity implies Kelly-strategyproofness
- Approximately strategyproof tournament rules in the probabilistic setting
- Renegotiation perfection in infinite games
- The banks set and the bipartisan set may be disjoint
- The Computational Complexity of Choice Sets
- On locally rationalizable social choice functions
- Tournaments without acyclic interval.
- On two new social choice correspondences.
- Incompleteness and incomparability in preference aggregation: complexity results
- Social choice and electoral competition in the general spatial model
- The Inversion Paradox and Ranking Methods in Tournaments
- Following the traces: an introduction to conjoint measurement without transitivity and additivity
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Intersections of random hypergraphs and tournaments
- Characterizing the top cycle via strategyproofness
- Voting profiles admitting all candidates as knockout winners
- A graph interpretation of the least squares ranking method
- On the complexity of bribery and manipulation in tournaments with uncertain information
- Computing the minimal covering set
- A counterexample to a conjecture of Schwartz
- Weakened WARP and top-cycle choice rules
- The football model, stochastic ordering and martingale transport
- Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games
- Voting by eliminating quantifiers
- The stability set as a social choice correspondence.
- The legislative calendar
- Majority-approval social choice
- Hyper-stable collective rankings
- The informational basis of scoring rules
- Winning isn't everything: how sports competition rules can make you want to lose
- An analytical and experimental comparison of maximal lottery schemes
- Structural stability of coalitions: a formal model highlighting the role of participants positioned between members and neutral actors
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems
- Absolute qualified majoritarianism: how does the threshold matter?
- The minimal dominant set is a non-empty core-extension
- On controlling knockout tournaments without perfect information
- Who can win a single-elimination tournament?
- Transitive convex subsets in large tournaments
- Minimal retentive sets in tournaments
- Can strategizing in round-robin subtournaments be avoided?
- Individual choice under social influence
- Maximum distance between Slater orders and Copeland orders of tournaments
- On incentive compatible competitive selection protocols
This page was built for publication: Tournament solutions and majority voting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366685)
