Weak transitivity and agenda control for extended stepladder tournaments

Yongjie Yang () and Dinko Dimitrov
Additional contact information
Yongjie Yang: Saarland University

Economic Theory Bulletin, 2021, vol. 9, issue 1, No 4, 27-37

Abstract: Abstract A tournament graph over n players is weakly transitive at player p if it contains a Hamiltonian path $$\left( p_{1},p_{2}, \dots , p_{n}\right) $$ p 1 , p 2 , ⋯ , p n with $$ p_{1}=p$$ p 1 = p such that for all odd integers $$i\le n-2$$ i ≤ n - 2 there is an arc from $$p_{i}$$ p i to $$p_{i+2}$$ p i + 2 . We show that weak transitivity at p suffices to make player p win any extended stepladder tournament of degree at most two.

Keywords: Agenda control; Extended stepladder; Hamiltonian path; Knockout tournament; Weak transitivity; C70; D70; D71 (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s40505-020-00190-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:etbull:v:9:y:2021:i:1:d:10.1007_s40505-020-00190-9

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/40505

DOI: 10.1007/s40505-020-00190-9

Access Statistics for this article

Economic Theory Bulletin is currently edited by Nicholas C. Yannelis

More articles in Economic Theory Bulletin from Springer, Society for the Advancement of Economic Theory (SAET) Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().