Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

A counterexample to a conjecture of Schwartz

  • Original Paper
  • Published:
Social Choice and Welfare Aims and scope Submit manuscript

Abstract

In 1990, motivated by applications in the social sciences, Thomas Schwartz made a conjecture about tournaments which would have had numerous attractive consequences. In particular, it implied that there is no tournament with a partition A, B of its vertex set, such that every transitive subset of A is in the out-neighbour set of some vertex in B, and vice versa. But in fact there is such a tournament, as we show in this article, and so Schwartz’ conjecture is false. Our proof is non-constructive and uses the probabilistic method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Banks JS (1985) Sophisticated voting outcomes and agenda control. Soc Choice Welf 3: 295–306

    Article  Google Scholar 

  • Brandt F (2011) Minimal stable sets in tournaments. J Econ Theory 146: 1481–1499

    Article  Google Scholar 

  • Brandt F, Fischer F, Harrenstein P, Mair M (2010) A computational analysis of the tournament equilibrium set. Soc Choice Welf 34: 597–609

    Article  Google Scholar 

  • Brandt F, Brill M, Fischer F, Harrenstein P (2011) Minimal retentive sets in tournaments. Soc Choice Welf (in press)

  • Dutta B (1988) Covering sets and a new Condorcet choice correspondence. J Econ Theory 44: 63–80

    Article  Google Scholar 

  • Dutta B (1990) On the tournament equilibrium set. Soc Choice Welf 7: 381–383

    Article  Google Scholar 

  • Erdős P, Moser L (1964) On the representation of directed graphs as unions of orderings. Publ Math Inst Hung Acad Sci 9: 125–132

    Google Scholar 

  • Houy N (2009) Still more on the tournament equilibrium set. Soc Choice Welf 32: 93–99

    Article  Google Scholar 

  • Laffond G, Laslier J-F (1991) Slater’s winners of a tournament may not be in the Banks set. Soc Choice Welf 8: 355–363

    Article  Google Scholar 

  • Laffond G, Laslier J-F, Le Breton M (1993) More on the tournament equilibrium set. Math Sci Hum 123: 37–44

    Google Scholar 

  • Laslier J-F (1997) Tournament solutions and majority voting. Springer, Berlin

    Book  Google Scholar 

  • Schwartz T (1990) Cyclic tournaments and cooperative majority voting: a solution. Soc Choice Welf 7: 19–29

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Paul Seymour.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brandt, F., Chudnovsky, M., Kim, I. et al. A counterexample to a conjecture of Schwartz. Soc Choice Welf 40, 739–743 (2013). https://doi.org/10.1007/s00355-011-0638-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00355-011-0638-y

Keywords