IDEAS home Printed from https://ideas.repec.org/p/lau/crdeep/17.17.html
   My bibliography  Save this paper

Serial Priority in Project Allocation: A Characterisation

Author

Listed:
  • Madhav Raghavan

Abstract

We consider a model in which projects are to be assigned to agents based on their preferences, and where projects have capacities, i.e., can each be assigned to a minimum and maximum number of agents. The extreme cases of our model are the social choice model (the same project is assigned to all agents) and the house allocation model (each project is assigned to at most one agent). We propose a natural extension of the dictatorial rule (social choice model) and the serial priority rule (house allocation model) to cover the intermediate cases, and call it the {\em strong serial priority rule}. We show that, when minimum and maximum capacities are common to all projects, a strong serial priority rule is characterised by the axioms of {\em strategy-proofness, group-non-bossiness, limited influence, unanimity}, and {\em neutrality}. Our result thus provides a bridge between the characterisations in Gibbard (1973), Satterthwaite (1975), and Svensson (1999). We also provide an independent characterisation of the serial priority rule in the house allocation model, and demonstrate some new relations between the axioms.

Suggested Citation

  • Madhav Raghavan, 2017. "Serial Priority in Project Allocation: A Characterisation," Cahiers de Recherches Economiques du Département d'économie 17.17, Université de Lausanne, Faculté des HEC, Département d’économie.
  • Handle: RePEc:lau:crdeep:17.17
    as

    Download full text from publisher

    File URL: http://www.unil.ch/de/files/live/sites/de/files/working-papers/17.17.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Lars Ehlers & Bettina Klaus, 2003. "Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(2), pages 265-280, October.
    2. Cechlárová, Katarína & Fleiner, Tamás, 2017. "Pareto optimal matchings with lower quotas," Mathematical Social Sciences, Elsevier, vol. 88(C), pages 3-10.
    3. Lars-Gunnar Svensson, 1999. "Strategy-proof allocation of indivisible goods," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 16(4), pages 557-567.
    4. Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April.
    5. Klijn Flip, 2019. "Constrained Allocation of Projects to Heterogeneous Workers with Preferences over Peers," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 19(1), pages 1-9, January.
    6. Monte, Daniel & Tumennasan, Norovsambuu, 2013. "Matching with quorums," Economics Letters, Elsevier, vol. 120(1), pages 14-17.
    7. Sangkyu Rhee, 2011. "Strategy‐Proof Allocation Of Indivisible Goods Among Couples," The Japanese Economic Review, Japanese Economic Association, vol. 62(2), pages 289-303, June.
    8. ,, 2015. "Serial dictatorship: the unique optimal allocation rule when information is endogenous," Theoretical Economics, Econometric Society, vol. 10(2), May.
    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. Madhav Raghavan, 2018. "Influence in Private-Good Economies," Cahiers de Recherches Economiques du Département d'économie 18.05, Université de Lausanne, Faculté des HEC, Département d’économie.

    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. Monte, Daniel & Tumennasan, Norovsambuu, 2015. "Centralized allocation in multiple markets," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 74-85.
    2. Bettina Klaus & Alexandru Nichifor, 2020. "Serial dictatorship mechanisms with reservation prices," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 70(3), pages 665-684, October.
    3. Bichler, Martin & Merting, Sören, 2018. "Truthfulness in advertising? Approximation mechanisms for knapsack bidders," European Journal of Operational Research, Elsevier, vol. 270(2), pages 775-783.
    4. Marek Pycia & M. Utku Ünver, 2022. "Outside options in neutral allocation of discrete resources," Review of Economic Design, Springer;Society for Economic Design, vol. 26(4), pages 581-604, December.
    5. Harless, Patrick & Phan, William, 2022. "Efficient mixtures of priority rules for assigning objects," Games and Economic Behavior, Elsevier, vol. 132(C), pages 73-89.
    6. Madhav Raghavan, 2018. "Influence in Private-Good Economies," Cahiers de Recherches Economiques du Département d'économie 18.05, Université de Lausanne, Faculté des HEC, Département d’économie.
    7. Gustavo Bergantiños & Jordi Massó & Alejandro Neme, 2017. "On societies choosing social outcomes, and their memberships: strategy-proofness," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(4), pages 857-875, April.
    8. Takamiya, Koji, 2001. "Coalition strategy-proofness and monotonicity in Shapley-Scarf housing markets," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 201-213, March.
    9. Afacan, Mustafa Oğuz & Bó, Inácio, 2022. "Strategy-proof popular mechanisms," Journal of Mathematical Economics, Elsevier, vol. 102(C).
    10. Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
    11. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    12. Sean Horan & Vikram Manjunath, 2022. "Lexicographic Composition of Choice Functions," Papers 2209.09293, arXiv.org.
    13. Debasis Mishra & Abdul Quadir, 2012. "Deterministic single object auctions with private values," Discussion Papers 12-06, Indian Statistical Institute, Delhi.
    14. Nhan-Tam Nguyen & Dorothea Baumeister & Jörg Rothe, 2018. "Strategy-proofness of scoring allocation correspondences for indivisible goods," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 50(1), pages 101-122, January.
    15. Sophie Bade, 2016. "Pareto-optimal matching allocation mechanisms for boundedly rational agents," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 501-510, October.
    16. Rustamdjan Hakimov & Dorothea Kübler & Siqi Pan, 2023. "Costly information acquisition in centralized matching markets," Quantitative Economics, Econometric Society, vol. 14(4), pages 1447-1490, November.
    17. Yuji Fujinaka & Takuma Wakayama, 2011. "Secure implementation in Shapley–Scarf housing markets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 48(1), pages 147-169, September.
    18. Ergin, Haluk I., 2000. "Consistency in house allocation problems," Journal of Mathematical Economics, Elsevier, vol. 34(1), pages 77-97, August.
    19. Biró, Péter & Klijn, Flip & Pápai, Szilvia, 2022. "Serial Rules in a Multi-Unit Shapley-Scarf Market," Games and Economic Behavior, Elsevier, vol. 136(C), pages 428-453.
    20. Monte, Daniel & Tumennasan, Norovsambuu, 2013. "Matching with quorums," Economics Letters, Elsevier, vol. 120(1), pages 14-17.

    More about this item

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations

    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:lau:crdeep:17.17. 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: Christina Seld (email available below). General contact details of provider: https://edirc.repec.org/data/deelsch.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.