IDEAS home Printed from https://ideas.repec.org/a/eee/ecolet/v243y2024ics0165176524004166.html
   My bibliography  Save this article

Packaging for allocation

Author

Listed:
  • Liu, Peng
  • Xu, Sijia

Abstract

The allocation of indivisible objects is studied where individuals claim packages of them and a rule determines the number of each package to be allocated. There exists a rule satisfying feasibility, efficiency, and composition down (or composition up) if and only if the set of institutionally feasible packages is a hierarchy, i.e., for any pair of packages, either that they are disjoint or that one contains the other. Moreover, on a hierarchy, the unique rules satisfying the aforementioned properties are priority rules where a package has higher priority than another if it contains the other.

Suggested Citation

  • Liu, Peng & Xu, Sijia, 2024. "Packaging for allocation," Economics Letters, Elsevier, vol. 243(C).
    • Handle: RePEc:eee:ecolet:v:243:y:2024:i:c:s0165176524004166
    DOI: 10.1016/j.econlet.2024.111932
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165176524004166
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.econlet.2024.111932?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.

    References listed on IDEAS

    as
    1. Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
    2. Thomson, William, 2003. "Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey," Mathematical Social Sciences, Elsevier, vol. 45(3), pages 249-297, July.
    3. Pycia, Marek & Unver, Utku, 2017. "Incentive compatible allocation and exchange of discrete resources," Theoretical Economics, Econometric Society, vol. 12(1), January.
    4. Szilvia PÂpai, 2000. "original papers : Strategyproof multiple assignment using quotas," Review of Economic Design, Springer;Society for Economic Design, vol. 5(1), pages 91-105.
    5. 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.
    6. Hervé Moulin, 2000. "Priority Rules and Other Asymmetric Rationing Methods," Econometrica, Econometric Society, vol. 68(3), pages 643-684, May.
    7. Thomson, William, 2015. "Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: An update," Mathematical Social Sciences, Elsevier, vol. 74(C), pages 41-59.
    8. Szilvia Pápai, 2001. "Strategyproof and Nonbossy Multiple Assignments," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 3(3), pages 257-271, July.
    9. Rick K. Acosta & Encarnación Algaba & Joaquín Sánchez-Soriano, 2022. "Multi-issue bankruptcy problems with crossed claims," Annals of Operations Research, Springer, vol. 318(2), pages 749-772, November.
    Full references (including those not matched with items 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. Kazuhiko Hashimoto, 2018. "Strategy-proofness and identical preferences lower bound in allocation problem of indivisible objects," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 65(4), pages 1045-1078, June.
    2. Papai, Szilvia, 2007. "Exchange in a general market with indivisible goods," Journal of Economic Theory, Elsevier, vol. 132(1), pages 208-235, January.
    3. 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.
    4. Monte, Daniel & Tumennasan, Norovsambuu, 2015. "Centralized allocation in multiple markets," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 74-85.
    5. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
    6. Jingyi Xue, 2018. "Fair division with uncertain needs," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(1), pages 105-136, June.
    7. Markus Möller, 2024. "Transparent Matching Mechanisms," ECONtribute Discussion Papers Series 306, University of Bonn and University of Cologne, Germany.
    8. Biung†Ghi Ju & Juan D. Moreno†Ternero, 2017. "Fair Allocation Of Disputed Properties," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 58(4), pages 1279-1301, November.
    9. Jaume García-Segarra & Miguel Ginés-Vilar, 2023. "Additive adjudication of conflicting claims," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 93-116, March.
    10. Teresa Estañ & Natividad Llorca & Ricardo Martínez & Joaquín Sánchez-Soriano, 2021. "On the Difficulty of Budget Allocation in Claims Problems with Indivisible Items and Prices," Group Decision and Negotiation, Springer, vol. 30(5), pages 1133-1159, October.
    11. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    12. 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.
    13. Liu, Peng & Zeng, Huaxia, 2019. "Random assignments on preference domains with a tier structure," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 176-194.
    14. 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.
    15. Karakaya, Mehmet & Klaus, Bettina & Schlegel, Jan Christoph, 2019. "Top trading cycles, consistency, and acyclic priorities for house allocation with existing tenants," Journal of Economic Theory, Elsevier, vol. 184(C).
    16. Abizada, Azar & Chen, Siwei, 2016. "House allocation when availability of houses may change unexpectedly," Mathematical Social Sciences, Elsevier, vol. 81(C), pages 29-37.
    17. Vito Fragnelli & Ewa Kiryluk-Dryjska, 2019. "Rationing methods for allocating the European Union’s rural development funds in Poland," Economia Politica: Journal of Analytical and Institutional Economics, Springer;Fondazione Edison, vol. 36(1), pages 295-322, April.
    18. Csoka, Peter & Herings, P.J.J., 2022. "Centralized Clearing Mechanisms in Financial Networks : A Programming Approach," Discussion Paper 2022-008, Tilburg University, Center for Economic Research.
    19. Flores-Szwagrzak, Karol & Østerdal, Lars Peter, 2024. "Rationalizing Sharing Rules," Working Papers 17-2024, Copenhagen Business School, Department of Economics.
    20. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).

    More about this item

    Keywords

    Indivisible objects; Hierarchy; Package; Priority rule; Composition up; Composition down;
    All these keywords.

    JEL classification:

    • D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
    • D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy Formulation and Implementation

    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:ecolet:v:243:y:2024:i:c:s0165176524004166. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ecolet .

    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.