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

Majority-consistent preference orderings

Author

Listed:
  • John Craven

    (University of Kent at Canterbury, Canterbury, Kent CT2 7NZ, England)

Abstract

This paper considers the construction of sets of preferences that give consistent outcomes under majority voting. Fishburn [7] shows that by combining the concepts of single-peaked and single-troughed preferences (which are themselves examples of value restriction) it is possible to provide a simple description of the extent of agreement between individuals that allows the construction of sets that are as large as those previously known (for fewer than 7 alternatives) and larger than those previously known (for 7 or more alternatives). This paper gives a characterisation of the preferences generated through these agreements and makes observations on the relation between the sizes of such sets as the number of alternatives increases.

Suggested Citation

  • John Craven, 1996. "Majority-consistent preference orderings," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 13(3), pages 259-267.
    • Handle: RePEc:spr:sochwe:v:13:y:1996:i:3:p:259-267
    Note: Received: 20 September 1994/Accepted: 6 March 1995
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Puppe, Clemens & Slinko, Arkadii, 2022. "Maximal Condorcet domains: A further progress report," Working Paper Series in Economics 159, Karlsruhe Institute of Technology (KIT), Department of Economics and Management.
    2. Slinko, Arkadii, 2019. "Condorcet domains satisfying Arrow’s single-peakedness," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 166-175.
    3. Puppe, Clemens & Slinko, Arkadii, 2024. "Maximal Condorcet domains. A further progress report," Games and Economic Behavior, Elsevier, vol. 145(C), pages 426-450.
    4. Ádám Galambos & Victor Reiner, 2008. "Acyclic sets of linear orders via the Bruhat orders," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 30(2), pages 245-264, February.

    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:13:y:1996:i:3:p:259-267. 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.