IDEAS home Printed from https://ideas.repec.org/a/ecm/emetrp/v49y1981i6p1597-1603.html
   My bibliography  Save this article

A Random Voting Graph Almost Surely Has a Hamiltonian Cycle When the Number of Alternatives Is Large

Author

Listed:
  • Bell, Colin E

Abstract

No abstract is available for this item.

Suggested Citation

  • Bell, Colin E, 1981. "A Random Voting Graph Almost Surely Has a Hamiltonian Cycle When the Number of Alternatives Is Large," Econometrica, Econometric Society, vol. 49(6), pages 1597-1603, November.
    • Handle: RePEc:ecm:emetrp:v:49:y:1981:i:6:p:1597-1603
    as

    Download full text from publisher

    File URL: http://links.jstor.org/sici?sici=0012-9682%28198111%2949%3A6%3C1597%3AARVGAS%3E2.0.CO%3B2-T&origin=repec
    File Function: full text
    Download Restriction: Access to full text is restricted to JSTOR subscribers. See http://www.jstor.org for details.
    ---><---

    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. 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.
    2. William Gehrlein & Michel Breton & Dominique Lepelley, 2017. "The likelihood of a Condorcet winner in the logrolling setting," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 315-327, August.
    3. 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.
    4. Lisa Sauermann, 2022. "On the probability of a Condorcet winner among a large number of alternatives," Papers 2203.13713, arXiv.org.
    5. Hans Gersbach & Kremena Valkanova, 2024. "Voting with Random Proposers: Two Rounds Suffice," Papers 2410.20476, arXiv.org.
    6. Gil Kalai, 2005. "Noise sensitivity and chaos in social choice theory," Levine's Bibliography 784828000000000295, UCLA Department of Economics.
    7. Christian Saile & Warut Suksompong, 2020. "Robust bounds on choosing from large tournaments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 54(1), pages 87-110, January.
    8. Gil Kalai, 2005. "Noise Sensitivity and Chaos in Social Choice Theory," Discussion Paper Series dp399, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.

    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:ecm:emetrp:v:49:y:1981:i:6:p:1597-1603. 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: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/essssea.html .

    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.