IDEAS home Printed from https://ideas.repec.org/p/zbw/wzbmbh/spii2018201.html
   My bibliography  Save this paper

Assignment maximization

Author

Listed:
  • Afacan, Mustafa Oğuz
  • Bó, Inácio Guerberoff Lanari
  • Turhan, Bertan

Abstract

We evaluate the goal of maximizing the number of individually rational assignments. We show that it implies incentive, fairness, and implementation impossibilities. Despite that, we present two classes of mechanisms that maximize assignments. The first are Pareto efficient, and undominated - in terms of number of assignments - in equilibrium. The second are fair for unassigned students and assign weakly more students than stable mechanisms in equilibrium. We provide comparisons with well-known mechanisms through computer simulations. Those show that the difference in number of matched agents between the proposed mechanisms and others in the literature is large and significant.

Suggested Citation

  • Afacan, Mustafa Oğuz & Bó, Inácio Guerberoff Lanari & Turhan, Bertan, 2018. "Assignment maximization," Discussion Papers, Research Unit: Market Behavior SP II 2018-201, WZB Berlin Social Science Center.
    • Handle: RePEc:zbw:wzbmbh:spii2018201
    as

    Download full text from publisher

    File URL: https://www.econstor.eu/bitstream/10419/175367/1/1014493501.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

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


    Cited by:

    1. Kondratev, Aleksei Y. & Nesterov, Alexander S., 2022. "Minimal envy and popular matchings," European Journal of Operational Research, Elsevier, vol. 296(3), pages 776-787.
    2. Zhang, Jun, 2023. "Strategy-proof allocation with outside option," Games and Economic Behavior, Elsevier, vol. 137(C), pages 50-67.
    3. Haris Aziz & Florian Brandl, 2021. "Efficient, Fair, and Incentive-Compatible Healthcare Rationing," Papers 2102.04384, arXiv.org, revised Sep 2021.
    4. Noda, Shunya, 2020. "Size versus truncation robustness in the assignment problem," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 1-5.

    More about this item

    Keywords

    market design; matching; maximal matching; fairness; object allocation; school choice;
    All these keywords.

    JEL classification:

    • D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market Design
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement

    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:zbw:wzbmbh:spii2018201. 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: ZBW - Leibniz Information Centre for Economics (email available below). General contact details of provider: https://edirc.repec.org/data/vawzbde.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.