A refinement of the uncovered set in tournaments

Weibin Han () and Adrian Deemen ()
Additional contact information
Weibin Han: South China Normal University, Guangzhou Higher Education Mega Center
Adrian Deemen: Radboud University Nijmegen

Theory and Decision, 2019, vol. 86, issue 1, No 6, 107-121

Abstract: Abstract We introduce a new solution for tournaments called the unsurpassed set. This solution lies between the uncovered set and the Copeland winner set. We show that this solution is more decisive than the uncovered set in discriminating among alternatives, and avoids a deficiency of the Copeland winner set. Moreover, the unsurpassed set is more sensitive than the uncovered set but less sensitive than the Copeland winner set to the reinforcement of the chosen alternatives. Besides, it turns out that this solution violates the other standard properties including independence of unchosen alternatives, stability, composition consistency and indempotency.

Keywords: Uncovered set; Unsurpassed set; Copeland winner set; Monotonicity (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s11238-018-9676-6 Abstract (text/html)
Access to full text is restricted to subscribers.

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:kap:theord:v:86:y:2019:i:1:d:10.1007_s11238-018-9676-6

Ordering information: This journal article can be ordered from
http://www.springer. ... ry/journal/11238/PS2

DOI: 10.1007/s11238-018-9676-6

Access Statistics for this article

Theory and Decision is currently edited by Mohammed Abdellaoui

More articles in Theory and Decision from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().