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

General concepts of value restriction and preference majority

Author

Listed:
  • Michel Regenwetter
  • A.A.J. Marley
  • Bernard Grofman

Abstract

Regenwetter and Grofman [17] offer a probabilistic generalization of Sen's [25, 27] classic value restriction condition when individual preferences are linear orders. They provide necessary and sufficient conditions for transitive majority preferences on linear orders. They call these conditions net value restriction and net preference majority. We study parallel generalizations for general binary relations. In general, neither net value restriction nor net preference majority is necessary for transitive majority preferences. Net value restriction is sufficient for transitive strict majority preferences, but not sufficient for transitive weak majority preferences. Net majority is sufficient for transitive majorities only if the preference relation with a net majority is a weak order. An application of our results to four U.S. National Election Study data sets reveals, in each case, transitive majorities despite a violation of Sen's original value restriction condition. Copyright Springer-Verlag 2003

Suggested Citation

  • Michel Regenwetter & A.A.J. Marley & Bernard Grofman, 2003. "General concepts of value restriction and preference majority," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(1), pages 149-173, August.
    • Handle: RePEc:spr:sochwe:v:21:y:2003:i:1:p:149-173
    DOI: 10.1007/s00355-003-0210-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00355-003-0210-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00355-003-0210-5?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.

    Citations

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


    Cited by:

    1. Isaac Lara & Sergio Rajsbaum & Armajac Ravent'os-Pujol, 2024. "A Generalization of Arrow's Impossibility Theorem Through Combinatorial Topology," Papers 2402.06024, arXiv.org, revised Jul 2024.
    2. Adrian Deemen, 2014. "On the empirical relevance of Condorcet’s paradox," Public Choice, Springer, vol. 158(3), pages 311-330, March.

    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:21:y:2003:i:1:p:149-173. 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.