IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v246y2015i2p505-516.html
   My bibliography  Save this article

Control of Condorcet voting: Complexity and a Relation-Algebraic approach

Author

Listed:
  • Berghammer, Rudolf
  • Schnoor, Henning

Abstract

We study the constructive variant of the control problem for Condorcet voting, where control is done by deleting voters. We prove that this problem remains NP-hard if instead of Condorcet winners the alternatives in the uncovered set win. Furthermore, we present a relation-algebraic model of Condorcet voting and relation-algebraic specifications of the dominance relation and the solutions of the control problem. All our relation-algebraic specifications immediately can be translated into the programming language of the OBDD-based computer system RelView. Our approach is very flexible and especially appropriate for prototyping and experimentation, and as such very instructive for educational purposes. It can easily be applied to other voting rules and control problems.

Suggested Citation

  • Berghammer, Rudolf & Schnoor, Henning, 2015. "Control of Condorcet voting: Complexity and a Relation-Algebraic approach," European Journal of Operational Research, Elsevier, vol. 246(2), pages 505-516.
    • Handle: RePEc:eee:ejores:v:246:y:2015:i:2:p:505-516
    DOI: 10.1016/j.ejor.2015.04.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715003185
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.04.025?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. repec:hal:pseose:hal-00756696 is not listed on IDEAS
    2. 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.
    3. John Duggan, 2011. "Uncovered Sets," Wallis Working Papers WP63, University of Rochester - Wallis Institute of Political Economy.
    4. Young, H. P., 1977. "Extending Condorcet's rule," Journal of Economic Theory, Elsevier, vol. 16(2), pages 335-353, December.
    5. Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April.
    6. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    7. Brandt, Felix & Fischer, Felix, 2008. "Computing the minimal covering set," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 254-268, September.
    Full references (including those not matched with items on IDEAS)

    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. Robi Ragan, 2015. "Computational social choice," Chapters, in: Jac C. Heckelman & Nicholas R. Miller (ed.), Handbook of Social Choice and Voting, chapter 5, pages 67-80, Edward Elgar Publishing.
    2. Brandl, Florian & Brandt, Felix, 2024. "A natural adaptive process for collective decision-making," Theoretical Economics, Econometric Society, vol. 19(2), May.
    3. Felix Brandt & Patrick Lederer & René Romen, 2024. "Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(1), pages 19-55, August.
    4. Lirong Xia, 2020. "How Likely Are Large Elections Tied?," Papers 2011.03791, arXiv.org, revised Jul 2021.
    5. Barbera, S. & Bossert, W. & Pattanaik, P.K., 2001. "Ranking Sets of Objects," Cahiers de recherche 2001-02, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    6. Souvik Roy & Soumyarup Sadhukhan, 2019. "A characterization of random min–max domains and its applications," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(4), pages 887-906, November.
    7. Mizukami, Hideki & Saijo, Tatsuyoshi & Wakayama, Takuma, 2003. "Strategy-Proof Sharing," Working Papers 1170, California Institute of Technology, Division of the Humanities and Social Sciences.
    8. Bruno Frey, 2011. "Tullock challenges: happiness, revolutions, and democracy," Public Choice, Springer, vol. 148(3), pages 269-281, September.
    9. Takamiya, Koji, 2001. "Coalition strategy-proofness and monotonicity in Shapley-Scarf housing markets," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 201-213, March.
    10. Alcalde-Unzu, Jorge & Gallo, Oihane & Vorsatz, Marc, 2024. "Strategy-proofness with single-peaked and single-dipped preferences," Games and Economic Behavior, Elsevier, vol. 147(C), pages 107-127.
    11. Burak Can & Peter Csoka & Emre Ergin, 2017. "How to choose a non-manipulable delegation?," CERS-IE WORKING PAPERS 1713, Institute of Economics, Centre for Economic and Regional Studies.
    12. Roy, Souvik & Storcken, Ton, 2019. "A characterization of possibility domains in strategic voting," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 46-55.
    13. Benoît R. Kloeckner, 2022. "Cycles in synchronous iterative voting: general robustness and examples in Approval Voting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(2), pages 423-466, August.
    14. António Osório, 2020. "Performance Evaluation: Subjectivity, Bias and Judgment Style in Sport," Group Decision and Negotiation, Springer, vol. 29(4), pages 655-678, August.
    15. Boniface Mbih & Issofa Moyouwou & Abdoul Aziz Ndiaye, 2009. "Parliamentary voting rules and strategic candidacy," Economics Bulletin, AccessEcon, vol. 29(2), pages 1371-1379.
    16. Kentaro Hatsumi & Dolors Berga & Shigehiro Serizawa, 2014. "A maximal domain for strategy-proof and no-vetoer rules in the multi-object choice model," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(1), pages 153-168, February.
    17. Michel Breton & Vera Zaporozhets, 2009. "On the equivalence of coalitional and individual strategy-proofness properties," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 33(2), pages 287-309, August.
    18. Ehud Kalai & Zvi Ritz, 1978. "An Extended Single Peak Condition in Social Choice," Discussion Papers 325, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    19. Kei Kawai & Yasutora Watanabe, 2013. "Inferring Strategic Voting," American Economic Review, American Economic Association, vol. 103(2), pages 624-662, April.
    20. Evan Osborne, 2010. "Why Do Some Kinds of Stars Get the Calls?," Journal of Sports Economics, , vol. 11(2), pages 203-213, April.

    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:ejores:v:246:y:2015:i:2:p:505-516. 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/eor .

    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.