IDEAS home Printed from https://ideas.repec.org/r/spr/sochwe/v20y2003i3p477-494.html

Sets of alternatives as Condorcet winners

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. 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.
  4. 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.
  5. Danilo Coelho & Salvador Barberà, 2024. "Mechanisms to Appoint Arbitrator Panels or Sets of Judges by Compromise Between Concerned Parties," Working Papers 1442, Barcelona School of Economics.
  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. 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.
  8. repec:bge:wpaper:291 is not listed on IDEAS
  9. Kamwa, Eric, 2017. "On stable rules for selecting committees," Journal of Mathematical Economics, Elsevier, vol. 70(C), pages 36-44.
  10. Burak Can & Bora Erdamar & M. Sanver, 2009. "Expected Utility Consistent Extensions of Preferences," Theory and Decision, Springer, vol. 67(2), pages 123-144, August.
  11. 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.
  12. 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.
  13. 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.
  14. İ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.
  15. Eric Kamwa, 2022. "The Condorcet Loser Criterion in Committee Selection," Working Papers hal-03880064, HAL.
  16. 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.
  17. Fatma Aslan & Hayrullah Dindar & Jean Lainé, 2023. "Correction to: When are committees of Condorcet winners Condorcet winning committees?," Review of Economic Design, Springer;Society for Economic Design, vol. 27(2), pages 469-469, June.
  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. repec:bge:wpaper:264 is not listed on IDEAS
  22. Barberà, Salvador & Coelho, Danilo, 2010. "On the rule of k names," Games and Economic Behavior, Elsevier, vol. 70(1), pages 44-61, September.
  23. 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.
  24. 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.
  25. 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.
  26. Darmann, Andreas, 2013. "How hard is it to tell which is a Condorcet committee?," Mathematical Social Sciences, Elsevier, vol. 66(3), pages 282-292.
  27. Diss, Mostapha & Mahajne, Muhammad, 2020. "Social acceptability of Condorcet committees," Mathematical Social Sciences, Elsevier, vol. 105(C), pages 14-27.
  28. Bora Erdamar & M. Sanver, 2009. "Choosers as extension axioms," Theory and Decision, Springer, vol. 67(4), pages 375-384, October.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.