IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2408.10077.html
   My bibliography  Save this paper

No Screening is More Efficient with Multiple Objects

Author

Listed:
  • Shunya Noda
  • Genta Okada

Abstract

We study efficient mechanism design for allocating multiple heterogeneous objects. We aim to maximize the residual surplus, the total value generated from an allocation minus the costs for screening agents' values. We discover a robust trend indicating that no-screening mechanisms such as serial dictatorship with exogenous priority order tend to perform better as the variety of goods increases. We analyze the underlying reasons by characterizing efficient mechanisms in a stylized environment. We also apply an automated mechanism design approach to numerically derive efficient mechanisms and validate the trend in general environments. Building on this implication, we propose the register-invite-book system (RIB) as an efficient system for scheduling vaccination against pandemic diseases.

Suggested Citation

  • Shunya Noda & Genta Okada, 2024. "No Screening is More Efficient with Multiple Objects," Papers 2408.10077, arXiv.org.
    • Handle: RePEc:arx:papers:2408.10077
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2408.10077
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
    2. Yoon, Kiho, 2011. "Optimal mechanism design when both allocative inefficiency and expenditure inefficiency matter," Journal of Mathematical Economics, Elsevier, vol. 47(6), pages 670-676.
    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. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    2. Felix Brandt & Patrick Lederer & René Romen, 2024. "Relaxed notions of Condorcet-consistency and efficiency for strategyproof social decision schemes," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(1), pages 19-55, August.
    3. Brandt, Felix & Saile, Christian & Stricker, Christian, 2022. "Strategyproof social choice when preferences and outcomes may contain ties," Journal of Economic Theory, Elsevier, vol. 202(C).
    4. Chao Huang, 2021. "Stable matching: an integer programming approach," Papers 2103.03418, arXiv.org, revised Apr 2022.
    5. Grenet, Julien & He, YingHua & Kübler, Dorothea, 2022. "Preference Discovery in University Admissions: The Case for Dynamic Multioffer Mechanisms," EconStor Open Access Articles and Book Chapters, ZBW - Leibniz Information Centre for Economics, vol. 130(6), pages 1-1.
    6. Ivan Balbuzanov & Maciej H. Kotowski, 2019. "Endowments, Exclusion, and Exchange," Econometrica, Econometric Society, vol. 87(5), pages 1663-1692, September.
    7. Ehlers, Lars & Klaus, Bettina, 2006. "Efficient priority rules," Games and Economic Behavior, Elsevier, vol. 55(2), pages 372-384, May.
    8. Miralles, Antonio & Pycia, Marek, 2021. "Foundations of pseudomarkets: Walrasian equilibria for discrete resources," Journal of Economic Theory, Elsevier, vol. 196(C).
    9. Lars Ehlers & Bettina Klaus, 2003. "Probabilistic assignments of identical indivisible objects and uniform probabilistic rules," Review of Economic Design, Springer;Society for Economic Design, vol. 8(3), pages 249-268, October.
    10. Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
    11. 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.
    12. repec:cty:dpaper:10.1016/j.geb.2020.08.009 is not listed on IDEAS
    13. Yasunori Okumura, 2024. "Strategic Analysis of Fair Rank-Minimizing Mechanisms with Agent Refusal Option," Papers 2408.01673, arXiv.org, revised Mar 2025.
    14. Korpela, Ville & Lombardi, Michele & Saulle, Riccardo D., 2024. "Designing rotation programs: Limits and possibilities," Games and Economic Behavior, Elsevier, vol. 143(C), pages 77-102.
    15. Felix Brandt & Patrick Lederer, 2024. "Weak Strategyproofness in Randomized Social Choice," Papers 2412.11977, arXiv.org.
    16. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    17. Felix Brandt & Patrick Lederer & Warut Suksompong, 2022. "Incentives in Social Decision Schemes with Pairwise Comparison Preferences," Papers 2204.12436, arXiv.org, revised Aug 2024.
    18. Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'économie 14.07, Université de Lausanne, Faculté des HEC, Département d’économie.
    19. Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.
    20. Yusuke Narita, 2018. "Toward an Ethical Experiment," Cowles Foundation Discussion Papers 2127, Cowles Foundation for Research in Economics, Yale University.
    21. Eric van Damme & Xu Lang, 2022. "Two-Person Bargaining when the Disagreement Point is Private Information," Papers 2211.06830, arXiv.org, revised Jan 2024.

    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:arx:papers:2408.10077. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.