IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v84y2016icp105-108.html
   My bibliography  Save this article

Elections generate all binary relations on infinite sets

Author

Listed:
  • Knoblauch, Vicki

Abstract

Every binary relation on an infinite set can be represented by an election in which each voter’s preferences are quasi-transitive and complete (except possibly not reflexive) and in which the electorate has smaller cardinality than or the same cardinality as the set of alternatives, depending on the cardinality of that set.

Suggested Citation

  • Knoblauch, Vicki, 2016. "Elections generate all binary relations on infinite sets," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 105-108.
  • Handle: RePEc:eee:matsoc:v:84:y:2016:i:c:p:105-108
    DOI: 10.1016/j.mathsocsci.2016.10.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489616301226
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.mathsocsci.2016.10.002?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. Bosi, Gianni & Herden, Gerhard, 2016. "On continuous multi-utility representations of semi-closed and closed preorders," Mathematical Social Sciences, Elsevier, vol. 79(C), pages 20-29.
    2. Beardon, Alan F. & Candeal, Juan C. & Herden, Gerhard & Indurain, Esteban & Mehta, Ghanshyam B., 2002. "The non-existence of a utility function and the structure of non-representable preference relations," Journal of Mathematical Economics, Elsevier, vol. 37(1), pages 17-38, February.
    3. Knoblauch, Vicki, 2013. "A simple voting scheme generates all binary relations on finite sets," Journal of Mathematical Economics, Elsevier, vol. 49(3), pages 230-233.
    4. Mark Fey, 2004. "May’s Theorem with an infinite population," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 23(2), pages 275-293, October.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Vicki Knoblauch, 2020. "Von Neumann–Morgenstern stable set rationalization of choice functions," Theory and Decision, Springer, vol. 89(3), pages 369-381, October.

    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. Dubra Juan & Echenique Federico, 2001. "Monotone Preferences over Information," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-18, December.
    2. Shaofang Qi, 2016. "A characterization of the n-agent Pareto dominance relation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(3), pages 695-706, March.
    3. Beardon, Alan F. & Candeal, Juan C. & Herden, Gerhard & Indurain, Esteban & Mehta, Ghanshyam B., 2002. "Lexicographic decomposition of chains and the concept of a planar chain," Journal of Mathematical Economics, Elsevier, vol. 37(2), pages 95-104, April.
    4. Lumley, Thomas & Gillen, Daniel L., 2016. "Characterising transitive two-sample tests," Statistics & Probability Letters, Elsevier, vol. 109(C), pages 118-123.
    5. Campion, Maria J. & Candeal, Juan C. & Indurain, Esteban, 2006. "The existence of utility functions for weakly continuous preferences on a Banach space," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 227-237, March.
    6. Kari Saukkonen, 2007. "Continuity of social choice functions with restricted coalition algebras," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 28(4), pages 637-647, June.
    7. Surekha, K. & Bhaskara Rao, K.P.S., 2010. "May's theorem in an infinite setting," Journal of Mathematical Economics, Elsevier, vol. 46(1), pages 50-55, January.
    8. Kumabe, Masahiro & Mihara, H. Reiju, 2008. "Computability of simple games: A characterization and application to the core," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 348-366, February.
    9. Kaminski, B., 2007. "On quasi-orderings and multi-objective functions," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1591-1598, March.
    10. J. Alcantud & G. Bosi & M. Campión & J. Candeal & E. Induráin & C. Rodríguez-Palmero, 2008. "Continuous Utility Functions Through Scales," Theory and Decision, Springer, vol. 64(4), pages 479-494, June.
    11. Abrísqueta, Francisco J. & Candeal, Juan C. & Induráin, Esteban & Zudaire, Margarita, 2009. "Scott-Suppes representability of semiorders: Internal conditions," Mathematical Social Sciences, Elsevier, vol. 57(2), pages 245-261, March.
    12. Jacques Durieu & Hans Haller & Nicolas Querou & Philippe Solal, 2008. "Ordinal Games," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 10(02), pages 177-194.
    13. Gianni Bosi & Asier Estevan & Armajac Raventós-Pujol, 2020. "Topologies for semicontinuous Richter–Peleg multi-utilities," Theory and Decision, Springer, vol. 88(3), pages 457-470, April.
    14. Tapan Mitra & M. Ozbek, 2013. "On representation of monotone preference orders in a sequence space," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(3), pages 473-487, September.
    15. Laurent Bartholdi & Wade Hann-Caruthers & Maya Josyula & Omer Tamuz & Leeat Yariv, 2018. "Equitable voting rules," Papers 1811.01227, arXiv.org, revised Aug 2020.
    16. Knoblauch, Vicki, 2023. "Lexicographic preference representation: Intrinsic length of linear orders on infinite sets," Journal of Mathematical Economics, Elsevier, vol. 105(C).
    17. Banerjee, Kuntal & Mitra, Tapan, 2018. "On Wold’s approach to representation of preferences," Journal of Mathematical Economics, Elsevier, vol. 79(C), pages 65-74.
    18. Pedro Hack & Daniel A. Braun & Sebastian Gottwald, 2023. "The classification of preordered spaces in terms of monotones: complexity and optimization," Theory and Decision, Springer, vol. 94(4), pages 693-720, May.
    19. Caserta, A. & Giarlotta, A. & Watson, S., 2008. "Debreu-like properties of utility representations," Journal of Mathematical Economics, Elsevier, vol. 44(11), pages 1161-1179, December.
    20. Bossert, Walter & Cato, Susumu, 2020. "Acyclicity, anonymity, and prefilters," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 134-141.

    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:eee:matsoc:v:84:y:2016:i:c:p:105-108. 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/inca/505565 .

    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.