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

On asymptotic strategy-proofness of the plurality and the run-off rules

Author

Listed:
  • Arkadii Slinko

    (Department of Mathematics, The University of Auckland, Private Bag 92019, Auckland, New Zealand)

Abstract

In this paper we prove that the plurality rule and the run-off procedure are asymptotically strategy-proof for any number of alternatives and that the proportion of profiles, at which a successful attempt to manipulate might take place, is in both cases bounded from above by $K/\sqrt n$, where n is the number of participating agents and K does not depend on n. We also prove that for the plurality rule the proportion of manipulable profiles is asymptotically bounded from below by $k/\sqrt n$, where k also does not depend on n.

Suggested Citation

  • Arkadii Slinko, 2002. "On asymptotic strategy-proofness of the plurality and the run-off rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 19(2), pages 313-324.
    • Handle: RePEc:spr:sochwe:v:19:y:2002:i:2:p:313-324
    Note: Received: 10 February 2000/Accepted: 19 October 2000
    as

    Download full text from publisher

    File URL: http://link.springer.de/link/service/journals/00355/papers/2019002/20190313.pdf
    Download Restriction: Access to the full text of the articles in this series is restricted
    ---><---

    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. Slinko, Arkadii, 2004. "How large should a coalition be to manipulate an election?," Mathematical Social Sciences, Elsevier, vol. 47(3), pages 289-293, May.
    2. Núñez, Matías & Pivato, Marcus, 2019. "Truth-revealing voting rules for large populations," Games and Economic Behavior, Elsevier, vol. 113(C), pages 285-305.
    3. Arkadii Slinko, 2002. "On Asymptotic Strategy-Proofness of Classical Social Choice Rules," Theory and Decision, Springer, vol. 52(4), pages 389-398, June.
    4. Palash Dey & Y. Narahari, 2015. "Asymptotic Collusion-proofness of Voting Rules: The Case of Large Number of Candidates," Studies in Microeconomics, , vol. 3(2), pages 120-139, December.
    5. M. Sanver, 2009. "Strategy-proofness of the plurality rule over restricted domains," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 39(3), pages 461-471, June.

    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:19:y:2002:i:2:p:313-324. 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.