IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v49y2013i3p230-233.html
   My bibliography  Save this article

A simple voting scheme generates all binary relations on finite sets

Author

Listed:
  • Knoblauch, Vicki

Abstract

A simple head-to-head voting scheme in which voters hold complete and transitive preferences over alternatives generates all binary relations on finite sets. The minimal number of voters required to generate a binary relation provides a measure of complexity for binary relations. Complexity so defined tells us, by how much a given binary relation fails to qualify as a total preorder.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:mateco:v:49:y:2013:i:3:p:230-233
    DOI: 10.1016/j.jmateco.2013.01.002
    as

    Download full text from publisher

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

    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. Duggan, John, 1999. "A General Extension Theorem for Binary Relations," Journal of Economic Theory, Elsevier, vol. 86(1), pages 1-16, May.
    2. Amartya Sen, 1969. "Quasi-Transitivity, Rational Choice and Collective Decisions," Review of Economic Studies, Oxford University Press, vol. 36(3), pages 381-393.
    3. Rubinstein, Ariel, 1996. "Why Are Certain Properties of Binary Relations Relatively More Common in Natural Language?," Econometrica, Econometric Society, vol. 64(2), pages 343-355, March.
    4. Peleg, Bezalel, 1970. "Utility Functions for Partially Ordered Topological Spaces," Econometrica, Econometric Society, vol. 38(1), pages 93-96, January.
    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. Knoblauch, Vicki, 2016. "Elections generate all binary relations on infinite sets," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 105-108.
    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. Knoblauch, Vicki, 2015. "Probabilistic evaluations: A universal representation for preferences over countable sets," Journal of Mathematical Economics, Elsevier, vol. 57(C), pages 25-27.

    More about this item

    Keywords

    Binary relations; Elections;

    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:mateco:v:49:y:2013:i:3:p:230-233. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.