A tournament of order 24 with two disjoint TEQ-retentive sets

2013/02/22 by Felix Brandt, Hans Georg Seedig, Brandt, Felix +1 · 9 citations
Computer Science · Decision Sciences · Mathematics · #Advanced Topology and Set Theory #Auction Theory and Applications #Combinatorics #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #Conjecture #Counterexample #Discrete mathematics #Disjoint sets #Economics #FOS: Computer and information sciences #FOS: Mathematics #Mathematical economics #Mathematics #Multiagent Systems (cs.MA) #Order (exchange) #Tournament #cs.MA #math.CO

paper · pdf · doi:10.48550/arxiv.1302.5592

published in arXiv (Cornell University) (Cornell University) · 3 pages, 1 figure

openalex publication_date 2013/02/22 · arxiv created 2013/04/29 · arxiv updated 2013/04/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Brandt et al. (2013) have recently disproved a conjecture by Schwartz (1990) by non-constructively showing the existence of a counterexample with about 10¹36 alternatives. We provide a concrete counterexample for Schwartz's conjecture with only 24 alternatives.

Related

• A Further Step Towards an Understanding of the Tournament Equilibrium Set
• A computational analysis of the tournament equilibrium set
• Cycle reversions and dichromatic number in tournaments
• The Banks Set and the Bipartisan Set May Be Disjoint
• Tournaments and the Strong Erdős-Hajnal Property