IDEAS home Printed from https://ideas.repec.org/p/unm/umamet/2008003.html
   My bibliography  Save this paper

Collective Choice Rules on Convex Restricted Domains

Author

Listed:
  • Storcken, A.J.A.

    (Quantitative Economics)

Abstract

No abstract is available for this item.

Suggested Citation

  • Storcken, A.J.A., 2008. "Collective Choice Rules on Convex Restricted Domains," Research Memorandum 003, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    • Handle: RePEc:unm:umamet:2008003
    DOI: 10.26481/umamet.2008003
    as

    Download full text from publisher

    File URL: https://cris.maastrichtuniversity.nl/ws/files/829911/guid-e06072fd-163b-4da6-af0c-7fa3feef451d-ASSET1.0.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.26481/umamet.2008003?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
    ---><---

    References listed on IDEAS

    as
    1. Kalai, Ehud & Ritz, Zvi, 1980. "Characterization of the private alternatives domains admitting arrow social welfare functions," Journal of Economic Theory, Elsevier, vol. 22(1), pages 23-36, February.
    2. Kalai, Ehud & Muller, Eitan, 1977. "Characterization of domains admitting nondictatorial social welfare functions and nonmanipulable voting procedures," Journal of Economic Theory, Elsevier, vol. 16(2), pages 457-469, December.
    3. Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
    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. Jamal Nazrul Islam & Haradhan Kumar Mohajan & Pahlaj Moolio, 2009. "Political Economy and Social Welfare with Voting Procedure," KASBIT Business Journals (KBJ), Khadim Ali Shah Bukhari Institute of Technology (KASBIT), vol. 2, pages 42-66, December.
    2. Can, Burak & Storcken, Ton, 2013. "Update monotone preference rules," Mathematical Social Sciences, Elsevier, vol. 65(2), pages 136-149.
    3. repec:ksb:journl:v:2:y:2009:i:1:p:42-66 is not listed on IDEAS

    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. Roy, Souvik & Storcken, Ton, 2019. "A characterization of possibility domains in strategic voting," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 46-55.
    2. Bochet Olivier & Storcken Ton, 2006. "Maximal Domains for Strategy-Proof or Maskin Monotonic Choice Rules," Research Memorandum 003, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    3. Bochet, O.L.A. & Storcken, A.J.A., 2006. "Maximal domains for strategy-proof or Maskin monotonic choice rules," Research Memorandum 003, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    4. Ehud Kalai & Zvi Ritz, 1978. "An Extended Single Peak Condition in Social Choice," Discussion Papers 325, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    5. Teo Chung Piaw & Jay Sethuraman & Rakesh V. Vohra, 2001. "Integer Programming and Arrovian Social Welfare Functions," Discussion Papers 1316, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    6. Chatterji, Shurojit & Zeng, Huaxia, 2023. "A taxonomy of non-dictatorial unidimensional domains," Games and Economic Behavior, Elsevier, vol. 137(C), pages 228-269.
    7. 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.
    8. Barberà, Salvador & Berga, Dolors & Moreno, Bernardo, 2012. "Two necessary conditions for strategy-proofness: On what domains are they also sufficient?," Games and Economic Behavior, Elsevier, vol. 75(2), pages 490-509.
    9. Cato, Susumu, 2009. "Another induction proof of the Gibbard-Satterthwaite theorem," Economics Letters, Elsevier, vol. 105(3), pages 239-241, December.
    10. Mark A. Satterthwaite & Hugo Sonnenschein, 1979. "Strategy-Proof Allocation Mechanisms," Discussion Papers 395, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    11. Schummer, James & Vohra, Rakesh V., 2002. "Strategy-proof Location on a Network," Journal of Economic Theory, Elsevier, vol. 104(2), pages 405-428, June.
    12. Sato, Shin, 2013. "A sufficient condition for the equivalence of strategy-proofness and nonmanipulability by preferences adjacent to the sincere one," Journal of Economic Theory, Elsevier, vol. 148(1), pages 259-278.
    13. Barbera, Salvador & Sonnenschein, Hugo & Zhou, Lin, 1991. "Voting by Committees," Econometrica, Econometric Society, vol. 59(3), pages 595-609, May.
    14. Francesca Busetto & Giulio Codognato & Simone Tonin, 2017. "Nondictatorial Arrovian Social Welfare Functions, Simple Majority Rule and Integer Programming," Department of Economics Working Papers 2017_11, Durham University, Department of Economics.
    15. Busetto, Francesca & Codognato, Giulio & Tonin, Simone, 2014. "Integer Programming on Domains Containing Inseparable Ordered Paris," 2007 Annual Meeting, July 29-August 1, 2007, Portland, Oregon TN 2015-22, American Agricultural Economics Association (New Name 2008: Agricultural and Applied Economics Association).
    16. Clemens Puppe & Attila Tasnádi, 2008. "Nash implementable domains for the Borda count," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 31(3), pages 367-392, October.
    17. Mishra, Debasis, 2016. "Ordinal Bayesian incentive compatibility in restricted domains," Journal of Economic Theory, Elsevier, vol. 163(C), pages 925-954.
    18. Francesca Busetto & Giulio Codognato & Simone Tonin, 2014. "Integer Programming on Domains Containg Inseparable Ordered Pairs," Working Papers 2014_14, Business School - Economics, University of Glasgow.
    19. Busetto, Francesca & Codognato, Giulio & Tonin, Simone, 2018. "Integer programming on domains containing inseparable ordered pairs," Research in Economics, Elsevier, vol. 72(4), pages 428-434.
    20. Kruger, Justin & Remzi Sanver, M., 2018. "Which dictatorial domains are superdictatorial? A complete characterization for the Gibbard–Satterthwaite impossibility," Mathematical Social Sciences, Elsevier, vol. 94(C), pages 32-34.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:unm:umamet:2008003. 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: Andrea Willems or Leonne Portz (email available below). General contact details of provider: https://edirc.repec.org/data/meteonl.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.