Tournament solutions and majority voting
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Transitivity frameworks for reciprocal relations: cycle-transitivity versus \(FG\)-transitivity
- Voting by successive elimination and strategic candidacy
- The stability set as a social choice correspondence.
- Sophisticated voting rules: The case of two tournaments
- Weakened WARP and top-cycle choice rules
- Strategy-proofness of the randomized Condorcet voting system
- The minimal covering set in large tournaments
- Scoring of web pages and tournaments-axiomatizations
- Intersections of random hypergraphs and tournaments
- Preferences for multi-attributed alternatives: traces, dominance, and numerical representations
- Incompleteness and incomparability in preference aggregation: complexity results
- Majority tournaments: Sincere and sophisticated voting decisions under amendment procedure
- Hyper-stable social welfare functions
- Uncovered set choice rules
- On the complexity of Slater's problems
- Smallest tournaments not realizable by \({\frac{2}{3}}\)-majority voting
- Internal slackening scoring methods
- Paired comparisons analysis: an axiomatic approach to ranking methods
- A characterization of the Copeland solution
- Ranking participants in tournaments by means of rating functions
- On the reversal bias of the minimax social choice correspondence
- Distributive politics and electoral competition
- Computing the minimal covering set
- The Dodgson ranking and the Borda count: a binary comparison
- Axioms for centrality scoring with principal eigenvectors
- Representative democracy and the implementation of majority-preferred alternatives
- Properties of multiwinner voting rules
- Condorcet choice and the Ostrogorski paradox
- A tournament of order 14 with disjoint Banks and Slater sets
- Computing minimal extending sets by relation-algebraic modeling and development
- Rational stability of choice functions
- The Condorcet set: majority voting over interconnected propositions
- Characterization of dominance relations in finite coalitional games
- Strategy-proofness and weighted voting
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Following the traces: an introduction to conjoint measurement without transitivity and additivity
- Representation in majority tournaments
- Choosing from a large tournament
- Strategy-proof preference aggregation: possibilities and characterizations
- Minimal extending sets in tournaments
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems
- Self-selective social choice functions
- Set-monotonicity implies Kelly-strategyproofness
- A survey on the complexity of tournament solutions
- A computational analysis of the tournament equilibrium set
- Dynamic coalitional equilibrium
- A new monotonicity condition for tournament solutions
- The Computational Complexity of Choice Sets
- Dynamic stable set as a tournament solution
- Control of Condorcet voting: complexity and a relation-algebraic approach
- Social choice and electoral competition in the general spatial model
- The minimal dominant set is a non-empty core-extension
- On two new social choice correspondences.
- Strategic manipulation in tournament games
- The solution of generalized stable sets and its refinement
- On the solution of \(w\)-stable sets
- Minimal retentive sets in tournaments
- Can strategizing in round-robin subtournaments be avoided?
- Individual choice under social influence
- Voting procedures, complexity of
- Identifying stable network structures and sets of key players using a \(W\)-covering perspective
- A survey on the linear ordering problem for weighted or unweighted tournaments
- On the structure of stable tournament solutions
- Homomorphism complexes, reconfiguration, and homotopy for directed graphs
- A social choice theory of legitimacy
- Maximum distance between Slater orders and Copeland orders of tournaments
- Condorcet winning sets
- Cyclic tournaments and cooperative majority voting: A solution
- On the complexity of bribery and manipulation in tournaments with uncertain information
- A counterexample to a conjecture of Schwartz
- On incentive compatible competitive selection protocols
- Renegotiation perfection in infinite games
- Minimal stable sets in tournaments
- The Banks Set and the Uncovered Set in Budget Allocation Problems
- Reasoning about general preference relations
- A solution for abstract decision problems based on maximum flow value
- The budget-voting paradox
- An analytical and experimental comparison of maximal lottery schemes
- Transitive convex subsets in large tournaments
- Structural stability of coalitions: a formal model highlighting the role of participants positioned between members and neutral actors
- The flow network method
- Tournament methods in choice theory
- Margin of victory for tournament solutions
- Preference-based reinforcement learning: evolutionary direct policy search using a preference-based racing algorithm
- Voting by eliminating quantifiers
- Optimal strategies for node selection games on oriented graphs: skew matrices and symmetric games
- A consistent tournament solution
- Approximability of Dodgson's rule
- Tournaments without acyclic interval.
- Neighborhood monotonicity, the extended Zermelo model, and symmetric knockout tournaments
- On weakly and strongly popular rankings
- Tournament decision theory
- Degreewidth: A New Parameter for Solving Problems on Tournaments
- On different ranking methods
- Revealed VNM-solutions: characterizations
- Families of abstract decision problems whose admissible sets intersect in a singleton
- Choosing from a weighted tournament
- A stochastic method for exploiting outranking relations in multicriteria choice problems
- Extending tournament solutions
- On the subgame perfect implementability of voting rules
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)
