A counterexample to a conjecture of Schwartz

DOI10.1007/S00355-011-0638-YMaRDI QIDQ2452120zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

Social choice (91B14) Cooperative games (91A12)

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

• scientific article; zbMATH DE number 599111 (Why is no real title available?)
• scientific article; zbMATH DE number 3221981 (Why is no real title available?)
• A computational analysis of the tournament equilibrium set
• Covering sets and a new Condorcet choice correspondence
• Cyclic tournaments and cooperative majority voting: A solution
• Minimal retentive sets in tournaments
• Minimal stable sets in tournaments
• On the tournament equilibrium set
• Slater's winners of a tournament may not be in the Banks set
• Sophisticated voting outcomes and agenda control
• Still more on the tournament equilibrium set
• Tournament solutions and majority voting

Cited in

(12)

• scientific article; zbMATH DE number 1445156 (Why is no real title available?)
• Gauss’s counterexample
• Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox
• Computing minimal extending sets by relation-algebraic modeling and development
• On a conjecture of Brualdi and Shen on block transitive tournaments
• \(k\)-majority digraphs and the hardness of voting with a constant number of voters
• Minimal extending sets in tournaments
• Set-monotonicity implies Kelly-strategyproofness
• Minimal retentive sets in tournaments
• A "Counterexample" for the Schwarz-Christoffel Transform
• 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)