A Further Step Towards an Understanding of the Tournament Equilibrium Set

preprint2016arXivOpen access

Abstract

We study some problems pertaining to the tournament equilibrium set (TEQ for short). A tournament HH is a TEQ-retentive tournament if there is a tournament TT which has a minimal TEQ-retentive set RR such that T[R]T[R] is isomorphic to HH. We study TEQ-retentive tournaments and achieve many significant results. In particular, we prove that there are no TEQ-retentive tournaments of size 4, only 2 non-isomorphic TEQ-retentive tournaments of sizes 5 and 6, respectively, and 26 non-isomorphic TEQ-retentive tournaments of size 7. For three tournaments H1,H2H_1, H_2 and TT, we say TT is a (H1,H2)(H_1,H_2)-TEQ-retentive tournament if TT has two minimal TEQ-retentive sets R1R_1 and R2R_2 such that T[R1]T[R_1] and T[R2]T[R_2] are isomorphic to H1H_1 and H2H_2, respectively. We show that there are no (H1,H2)(H_1,H_2)-retentive tournaments for H1H_1 and H2H_2 being small tournaments. Our results imply that Schwartz's Conjecture holds in all tournaments of size at most 14. Finally, we study Schwartz's Conjecture in several classes of tournaments. To achieve these results, we study the relation between (directed) domination graphs of tournaments and TEQ-retentive sets, and derive a number of properties on minimal TEQ-retentive sets.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.