论文信息 - A tournament of order 24 with two disjoint TEQ-retentive sets

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

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

Felix Brandt | Hans Georg Seedig | F. Brandt

[1] Felix Brandt,et al. Minimal stable sets in tournaments , 2008, J. Econ. Theory.

[2] Felix Brandt,et al. Group-Strategyproof Irresolute Social Choice Functions , 2010, IJCAI.

[3] Jean-François Laslier,et al. More on the tournament equilibrium set , 1993 .

[4] Jean-François Laslier,et al. Tournament Solutions And Majority Voting , 1997 .

[5] Nicolas Houy,et al. Still more on the Tournament Equilibrium Set , 2009, Soc. Choice Welf..

[6] Felix A. Fischer,et al. A computational analysis of the tournament equilibrium set , 2008, Soc. Choice Welf..

[7] Paul D. Seymour,et al. A counterexample to a conjecture of Schwartz , 2013, Soc. Choice Welf..

[8] Felix Brandt,et al. Set-rationalizable choice and self-stability , 2009, J. Econ. Theory.

[9] Felix A. Fischer,et al. Minimal retentive sets in tournaments , 2010, AAMAS.

[10] Bernard Monjardet. MATHÉMATIQUES ET SCIENCES HUMAINES , 1977 .

[11] Thomas Schwartz. Cyclic tournaments and cooperative majority voting: A solution , 1990 .