IDEAS home Printed from https://ideas.repec.org/a/kap/theord/v86y2019i1d10.1007_s11238-018-9676-6.html
   My bibliography  Save this article

A refinement of the uncovered set in tournaments

Author

Listed:
  • Weibin Han

    (South China Normal University, Guangzhou Higher Education Mega Center)

  • Adrian Deemen

    (Radboud University Nijmegen)

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.

Suggested Citation

  • Weibin Han & Adrian Deemen, 2019. "A refinement of the uncovered set in tournaments," Theory and Decision, Springer, vol. 86(1), pages 107-121, February.
    • Handle: RePEc:kap:theord:v:86:y:2019:i:1:d:10.1007_s11238-018-9676-6
    DOI: 10.1007/s11238-018-9676-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11238-018-9676-6
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11238-018-9676-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yusufcan Masatlioglu & Daisuke Nakajima & Erkut Y. Ozbay, 2012. "Revealed Attention," American Economic Review, American Economic Association, vol. 102(5), pages 2183-2205, August.
    2. Felix Brandt & Christian Geist & Paul Harrenstein, 2016. "A note on the McKelvey uncovered set and Pareto optimality," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(1), pages 81-91, January.
    3. Deb, Rajat, 1977. "On Schwartz's rule," Journal of Economic Theory, Elsevier, vol. 16(1), pages 103-110, October.
    4. Dutta, Bhaskar, 1988. "Covering sets and a new condorcet choice correspondence," Journal of Economic Theory, Elsevier, vol. 44(1), pages 63-80, February.
    5. Brandt, Felix & Harrenstein, Paul & Seedig, Hans Georg, 2017. "Minimal extending sets in tournaments," Mathematical Social Sciences, Elsevier, vol. 87(C), pages 55-63.
    6. Brandt, Felix, 2011. "Minimal stable sets in tournaments," Journal of Economic Theory, Elsevier, vol. 146(4), pages 1481-1499, July.
    7. Kalai, Ehud & Schmeidler, David, 1977. "An admissible set occurring in various bargaining situations," Journal of Economic Theory, Elsevier, vol. 14(2), pages 402-411, April.
    8. İpek Özkal-Sanver & M. Sanver, 2010. "A new monotonicity condition for tournament solutions," Theory and Decision, Springer, vol. 69(3), pages 439-452, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yusufcan Demirkan & Boyao Li, 2023. "Individual choice under social influence," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(2), pages 585-606, August.
    2. Han, Weibin & van Deemen, Adrian, 2021. "The solution of generalized stable sets and its refinement," Mathematical Social Sciences, Elsevier, vol. 113(C), pages 60-67.
    3. Yihao Luo & Jinhui Pang & Weibin Han & Huafei Sun, 2021. "New Solution based on Hodge Decomposition for Abstract Games," Papers 2109.14539, arXiv.org, revised Jul 2024.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Aleksei Y. Kondratev & Vladimir V. Mazalov, 2020. "Tournament solutions based on cooperative game theory," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(1), pages 119-145, March.
    2. Josep E., Peris & Begoña, Subiza, 2015. "Rationalizable Choice and Standards of Behavior," QM&ET Working Papers 15-5, University of Alicante, D. Quantitative Methods and Economic Theory.
    3. Felix Brandt & Markus Brill & Hans Georg Seedig & Warut Suksompong, 2020. "On the Structure of Stable Tournament Solutions," Papers 2004.01651, arXiv.org.
    4. Felix Brandt & Markus Brill & Hans Georg Seedig & Warut Suksompong, 2018. "On the structure of stable tournament solutions," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 65(2), pages 483-507, March.
    5. Brandt, Felix & Harrenstein, Paul & Seedig, Hans Georg, 2017. "Minimal extending sets in tournaments," Mathematical Social Sciences, Elsevier, vol. 87(C), pages 55-63.
    6. SPRUMONT, Yves & EHLERS, Lars, 2005. "Top-Cycle Rationalizability," Cahiers de recherche 25-2005, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    7. Berghammer, Rudolf & Rusinowska, Agnieszka & de Swart, Harrie, 2013. "Computing tournament solutions using relation algebra and RelView," European Journal of Operational Research, Elsevier, vol. 226(3), pages 636-645.
    8. Vicki Knoblauch, 2020. "Von Neumann–Morgenstern stable set rationalization of choice functions," Theory and Decision, Springer, vol. 89(3), pages 369-381, October.
    9. repec:hal:pseose:hal-00756696 is not listed on IDEAS
    10. Felix Brandt & Maria Chudnovsky & Ilhee Kim & Gaku Liu & Sergey Norin & Alex Scott & Paul Seymour & Stephan Thomassé, 2013. "A counterexample to a conjecture of Schwartz," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(3), pages 739-743, March.
    11. Felix Brandt, 2015. "Set-monotonicity implies Kelly-strategyproofness," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 45(4), pages 793-804, December.
    12. Ehlers, Lars & Sprumont, Yves, 2008. "Weakened WARP and top-cycle choice rules," Journal of Mathematical Economics, Elsevier, vol. 44(1), pages 87-94, January.
    13. repec:hal:wpaper:hal-00756696 is not listed on IDEAS
    14. Athanasios Andrikopoulos & Nikolaos Sampanis, 2024. "A topological characterization of the existence of w-stable sets," Papers 2403.04512, arXiv.org.
    15. Josep E. Peris & Begoña Subiza, 2023. "Rational stability of choice functions," International Journal of Economic Theory, The International Society for Economic Theory, vol. 19(3), pages 580-598, September.
    16. Scott Moser, 2015. "Majority rule and tournament solutions," Chapters, in: Jac C. Heckelman & Nicholas R. Miller (ed.), Handbook of Social Choice and Voting, chapter 6, pages 83-101, Edward Elgar Publishing.
    17. Brandt, Felix & Harrenstein, Paul, 2011. "Set-rationalizable choice and self-stability," Journal of Economic Theory, Elsevier, vol. 146(4), pages 1721-1731, July.
    18. Athanasios Andrikopoulos, 2016. "A short proof of Deb’s Theorem on Schwartz’s rule," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 39(2), pages 333-336, November.
    19. Alcalde-Unzu, Jorge & Molis, Elena, 2011. "Exchange of indivisible goods and indifferences: The Top Trading Absorbing Sets mechanisms," Games and Economic Behavior, Elsevier, vol. 73(1), pages 1-16, September.
    20. Ghosal, Sayantan & Dalton, Patricio, 2013. "Characterizing Behavioral Decisions with Choice Data," CAGE Online Working Paper Series 107, Competitive Advantage in the Global Economy (CAGE).
    21. Leo Katz & Alvaro Sandroni, 2020. "Limits on power and rationality," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(2), pages 507-521, March.
    22. De Donder, Philippe & Le Breton, Michel & Truchon, Michel, 2000. "Choosing from a weighted tournament1," Mathematical Social Sciences, Elsevier, vol. 40(1), pages 85-109, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:theord:v:86:y:2019:i:1:d:10.1007_s11238-018-9676-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.