IDEAS home Printed from https://ideas.repec.org/a/spr/sochwe/v20y2003i3p477-494.html
   My bibliography  Save this article

Sets of alternatives as Condorcet winners

Author

Listed:
  • Barış Kaymak
  • M. Remzi Sanver

Abstract

We characterize sets of alternatives which are Condorcet winners according to preferences over sets of alternatives, in terms of properties defined on preferences over alternatives. We state our results under certain preference extension axioms which, at any preference profile over alternatives, give the list of admissible preference profiles over sets of alternatives. It turns out to be that requiring from a set to be a Condorcet winner at every admissible preference profile is too demanding, even when the set of admissible preference profiles is fairly narrow. However, weakening this requirement to being a Condorcet winner at some admissible preference profile opens the door to more permissive results and we characterize these sets by using various versions of an undomination condition. Although our main results are given for a world where any two sets – whether they are of the same cardinality or not – can be compared, the case for sets of equal cardinality is also considered. Copyright Springer-Verlag Berlin Heidelberg 2003

Suggested Citation

  • Barış Kaymak & M. Remzi Sanver, 2003. "Sets of alternatives as Condorcet winners," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 20(3), pages 477-494, June.
  • Handle: RePEc:spr:sochwe:v:20:y:2003:i:3:p:477-494
    DOI: 10.1007/s003550200194
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s003550200194
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s003550200194?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.

    Citations

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


    Cited by:

    1. Mostapha Diss & Ahmed Doghmi, 2016. "Multi-winner scoring election methods: Condorcet consistency and paradoxes," Public Choice, Springer, vol. 169(1), pages 97-116, October.
    2. Barberà, Salvador & Coelho, Danilo, 2017. "Balancing the power to appoint officers," Games and Economic Behavior, Elsevier, vol. 101(C), pages 189-203.
    3. Fatma Aslan & Hayrullah Dindar & Jean Lainé, 2022. "When are committees of Condorcet winners Condorcet winning committees?," Review of Economic Design, Springer;Society for Economic Design, vol. 26(3), pages 417-446, September.
    4. Aleskerov, Fuad & Karabekyan, Daniel & Sanver, M. Remzi & Yakuba, Vyacheslav, 2012. "On the manipulability of voting rules: The case of 4 and 5 alternatives," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 67-73.
    5. Salvador Barberà & Danilo Coelho, 2008. "How to choose a non-controversial list with k names," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(1), pages 79-96, June.
    6. Mostapha Diss & Eric Kamwa & Abdelmonaim Tlidi, 2018. "The Chamberlin-Courant Rule and the k-Scoring Rules: Agreement and Condorcet Committee Consistency," Working Papers hal-01757761, HAL.
    7. Diss, Mostapha & Mahajne, Muhammad, 2020. "Social acceptability of Condorcet committees," Mathematical Social Sciences, Elsevier, vol. 105(C), pages 14-27.
    8. Edith Elkind & Piotr Faliszewski & Piotr Skowron & Arkadii Slinko, 2017. "Properties of multiwinner voting rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(3), pages 599-632, March.
    9. Kamwa, Eric, 2017. "On stable rules for selecting committees," Journal of Mathematical Economics, Elsevier, vol. 70(C), pages 36-44.
    10. Mostapha Diss & Eric Kamwa & Abdelmonaim Tlidi, 2020. "On Some k -scoring Rules for Committee Elections: Agreement and Condorcet Principle," Revue d'économie politique, Dalloz, vol. 130(5), pages 699-725.
    11. Barberà, Salvador & Coelho, Danilo, 2010. "On the rule of k names," Games and Economic Behavior, Elsevier, vol. 70(1), pages 44-61, September.
    12. Burak Can & Bora Erdamar & M. Sanver, 2009. "Expected Utility Consistent Extensions of Preferences," Theory and Decision, Springer, vol. 67(2), pages 123-144, August.
    13. Hayrullah Dindar & Jean Lainé, 2022. "Compromise in combinatorial vote," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(1), pages 175-206, July.
    14. Edith Elkind & Jérôme Lang & Abdallah Saffidine, 2015. "Condorcet winning sets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(3), pages 493-517, March.
    15. Sinan Ertemel & Levent Kutlu & M. Remzi Sanver, 2015. "Voting games of resolute social choice correspondences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 45(1), pages 187-201, June.
    16. İpek Özkal-Sanver & M. Sanver, 2006. "Nash implementation via hyperfunctions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 26(3), pages 607-623, June.
    17. Eric Kamwa, 2022. "The Condorcet Loser Criterion in Committee Selection," Working Papers hal-03880064, HAL.
    18. Özyurt, Selçuk & Sanver, M. Remzi, 2009. "A general impossibility result on strategy-proof social choice hyperfunctions," Games and Economic Behavior, Elsevier, vol. 66(2), pages 880-892, July.
    19. Darmann, Andreas, 2018. "A social choice approach to ordinal group activity selection," Mathematical Social Sciences, Elsevier, vol. 93(C), pages 57-66.
    20. Mostapha Diss & Eric Kamwa & Abdelmonaim Tlidi, 2019. "On some k-scoring rules for committee elections: agreement and Condorcet Principle," Working Papers hal-02147735, HAL.
    21. Andreas Darmann, 2016. "It is difficult to tell if there is a Condorcet spanning tree," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(1), pages 93-104, August.
    22. Eric Kamwa & Vincent Merlin, 2018. "Coincidence of Condorcet committees," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 50(1), pages 171-189, January.
    23. Joseph, Rémy-Robert, 2010. "Making choices with a binary relation: Relative choice axioms and transitive closures," European Journal of Operational Research, Elsevier, vol. 207(2), pages 865-877, December.
    24. Darmann, Andreas, 2013. "How hard is it to tell which is a Condorcet committee?," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 282-292.
    25. Bora Erdamar & M. Sanver, 2009. "Choosers as extension axioms," Theory and Decision, Springer, vol. 67(4), pages 375-384, October.

    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:spr:sochwe:v:20:y:2003:i:3:p:477-494. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.