[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v87y2017icp55-63.html
   My bibliography  Save this article

Minimal extending sets in tournaments

Author

Listed:
  • Brandt, Felix
  • Harrenstein, Paul
  • Seedig, Hans Georg
Abstract
Tournament solutions play an important role within social choice theory and the mathematical social sciences at large. In 2011, Brandt proposed a new tournament solution called the minimal extending set (ME) and an associated graph-theoretic conjecture. If the conjecture had been true, ME would have satisfied a number of desirable properties that are usually considered in the literature on tournament solutions. However, in 2013, the existence of an enormous counter-example to the conjecture was shown using a non-constructive proof. This left open which of the properties are actually satisfied by ME. It turns out that ME satisfies idempotency, irregularity, and inclusion in the iterated Banks set (and hence the Banks set, the uncovered set, and the top cycle). Most of the other standard properties (including monotonicity, stability, and computational tractability) are violated, but have been shown to hold for all tournaments on up to 12 alternatives and all random tournaments encountered in computer experiments.

Suggested Citation

  • Brandt, Felix & Harrenstein, Paul & Seedig, Hans Georg, 2017. "Minimal extending sets in tournaments," Mathematical Social Sciences, Elsevier, vol. 87(C), pages 55-63.
    • Handle: RePEc:eee:matsoc:v:87:y:2017:i:c:p:55-63
    DOI: 10.1016/j.mathsocsci.2016.12.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489617300422
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2016.12.007?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. Aleskerov, Fuad, 1995. "Locality in Voting Models," Mathematical Social Sciences, Elsevier, vol. 30(3), pages 320-321, December.
    2. Dutta, Bhaskar, 1988. "Covering sets and a new condorcet choice correspondence," Journal of Economic Theory, Elsevier, vol. 44(1), pages 63-80, February.
    3. Monjardet, B., 2008. "Statement of precedence and a comment on IIA terminology," Games and Economic Behavior, Elsevier, vol. 62(2), pages 736-738, March.
    4. Brandt, Felix, 2011. "Minimal stable sets in tournaments," Journal of Economic Theory, Elsevier, vol. 146(4), pages 1481-1499, July.
    5. 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.
    6. Yusufcan Masatlioglu & Daisuke Nakajima & Erkut Y. Ozbay, 2012. "Revealed Attention," American Economic Review, American Economic Association, vol. 102(5), pages 2183-2205, August.
    7. Duggan, John & Le Breton, Michel, 1996. "Dutta's Minimal Covering Set and Shapley's Saddles," Journal of Economic Theory, Elsevier, vol. 70(1), pages 257-265, July.
    8. Kenneth J. Arrow & Herve Raynaud, 1986. "Social Choice and Multicriterion Decision-Making," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262511754, April.
    9. Brandt, Felix & Harrenstein, Paul, 2011. "Set-rationalizable choice and self-stability," Journal of Economic Theory, Elsevier, vol. 146(4), pages 1721-1731, July.
    10. Felix Brandt & Paul Harrenstein, 2010. "Characterization of dominance relations in finite coalitional games," Theory and Decision, Springer, vol. 69(2), pages 233-256, August.
    11. Olivier Hudry, 2004. "A note on “Banks winners in tournaments are difficult to recognize” by G. J. Woeginger," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 23(1), pages 113-114, August.
    12. Laffond G. & Laslier J. F. & Le Breton M., 1993. "The Bipartisan Set of a Tournament Game," Games and Economic Behavior, Elsevier, vol. 5(1), pages 182-201, January.
    13. 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.
    14. Gerhard J. Woeginger, 2003. "Banks winners in tournaments are difficult to recognize," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 20(3), pages 523-528, June.
    15. Felix Brandt & Felix Fischer & Paul Harrenstein & Maximilian Mair, 2010. "A computational analysis of the tournament equilibrium set," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 34(4), pages 597-609, April.
    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. 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. Weibin Han & Adrian Deemen, 2019. "A refinement of the uncovered set in tournaments," Theory and Decision, Springer, vol. 86(1), pages 107-121, February.

    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. Felix Brandt & Markus Brill & Felix Fischer & Paul Harrenstein, 2014. "Minimal retentive sets in tournaments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 551-574, March.
    2. Felix Brandt & Markus Brill & Paul Harrenstein, 2018. "Extending tournament solutions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(2), pages 193-222, August.
    3. 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.
    4. Felix Brandt & Markus Brill & Hans Georg Seedig & Warut Suksompong, 2020. "On the Structure of Stable Tournament Solutions," Papers 2004.01651, arXiv.org.
    5. Brandt, Felix, 2011. "Minimal stable sets in tournaments," Journal of Economic Theory, Elsevier, vol. 146(4), pages 1481-1499, July.
    6. 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.
    7. 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.
    8. Fujun Hou, 2024. "A new social welfare function with a number of desirable properties," Papers 2403.16373, arXiv.org.
    9. 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.
    10. 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.
    11. Irène Charon & Olivier Hudry, 2010. "An updated survey on the linear ordering problem for weighted or unweighted tournaments," Annals of Operations Research, Springer, vol. 175(1), pages 107-158, March.
    12. 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.
    13. Hudry, Olivier, 2009. "A survey on the complexity of tournament solutions," Mathematical Social Sciences, Elsevier, vol. 57(3), pages 292-303, May.
    14. Vincent Anesi, 2012. "A new old solution for weak tournaments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 39(4), pages 919-930, October.
    15. Weibin Han & Adrian Deemen, 2019. "A refinement of the uncovered set in tournaments," Theory and Decision, Springer, vol. 86(1), pages 107-121, February.
    16. LASLIER, Jean-François & PICARD, Nathalie, 2000. "Distributive politics: does electoral competition promote inequality ?," LIDAM Discussion Papers CORE 2000022, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    17. 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.
    18. Scott Moser & John W. Patty & Elizabeth Maggie Penn, 2009. "The Structure of Heresthetical Power," Journal of Theoretical Politics, , vol. 21(2), pages 139-159, April.
    19. Brandt, Felix & Fischer, Felix, 2008. "Computing the minimal covering set," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 254-268, September.
    20. Alex Scott & Mark Fey, 2012. "The minimal covering set in large tournaments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(1), pages 1-9, January.

    More about this item

    Statistics

    Access and download statistics

    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:eee:matsoc:v:87:y:2017:i:c:p:55-63. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.