A counterexample to a conjecture of Schwartz
From MaRDI portal
Publication:2452120
DOI10.1007/S00355-011-0638-YzbMATH Open1288.91062OpenAlexW2141806469WikidataQ123130237 ScholiaQ123130237MaRDI QIDQ2452120FDOQ2452120
Authors: Felix Brandt, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Serguei Norine, Alex Scott, Paul Seymour, Stéphan Thomassé 
Publication date: 30 May 2014
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-011-0638-y
Recommendations
- A counterexample to a conjecture of Hasson
- A counterexample to a conjecture of Friedland
- Explicit counterexamples to Schäffer's conjecture
- A counterexample to a conjecture by Błocki-Zwonek
- A counter-example to a conjecture of Friedland
- A counter-example to Hausmann's conjecture
- A counterexample to Raikov's conjecture
- scientific article; zbMATH DE number 797386
- scientific article; zbMATH DE number 1033822
- A COUNTEREXAMPLE TO A CONJECTURE OF AKEMANN AND ANDERSON
Cites Work
- Sophisticated voting outcomes and agenda control
- Tournament solutions and majority voting
- Title not available (Why is that?)
- Covering sets and a new Condorcet choice correspondence
- A computational analysis of the tournament equilibrium set
- Minimal stable sets in tournaments
- Cyclic tournaments and cooperative majority voting: A solution
- Title not available (Why is that?)
- Minimal retentive sets in tournaments
- Still more on the tournament equilibrium set
- On the tournament equilibrium set
- Slater's winners of a tournament may not be in the Banks set
Cited In (12)
- Title not available (Why is that?)
- \(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
- A "Counterexample" for the Schwarz-Christoffel Transform
- On a conjecture of Brualdi and Shen on block transitive tournaments
- Gauss’s counterexample
- Set-monotonicity implies Kelly-strategyproofness
- Minimal retentive sets in tournaments
- Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox
- On the structure of stable tournament solutions
- Tournament solutions based on cooperative game theory
This page was built for publication: A counterexample to a conjecture of Schwartz
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452120)
