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.
Econ Theory Tournament Solution Sophisticated Vote Random Tournament Transitive Subset
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.