IDEAS home Printed from https://ideas.repec.org/p/mnt/wpaper/2304.html
   My bibliography  Save this paper

Optimal assignment mechanisms with imperfect verification

Author

Listed:
  • Juan Pereyra

  • Francisco Silva

Abstract

Objects of different quality are to be allocated to agents. Agents can receive at most one object, and there are not enough high-quality objects for every agent.The value to the social planner from allocating objects to any given agent depends on that agent’s private information. The social planner is unable to use transfers to give incentives for agents to convey their private information. Instead, she is able to imperfectly verify their reports throughsignals that are positively affiliated with eachagent’stype. Wecharacterizemechanismsthatmaximizethesocialplanner’s expected payoff. In the optimal mechanism, each agent chooses one of various tracks, which are characterized by twothresholds. If the agent’s signal exceeds the upper threshold of the chosen track, the agent receives a high-quality object, if it is between the two thresholds, he receives a low-quality object, and if it is below the lower threshold, he receives no object.

Suggested Citation

  • Juan Pereyra & Francisco Silva, 2023. "Optimal assignment mechanisms with imperfect verification," Documentos de Trabajo/Working Papers 2304, Facultad de Ciencias Empresariales y Economia. Universidad de Montevideo..
  • Handle: RePEc:mnt:wpaper:2304
    as

    Download full text from publisher

    File URL: https://www2.um.edu.uy/fcee_papers/2020/Optimal_assignment_mechanisms_with_imperfect_verification.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    JEL classification:

    • C7 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory
    • D8 - Microeconomics - - Information, Knowledge, and Uncertainty

    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:mnt:wpaper:2304. 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: Juan Briozzo (email available below). General contact details of provider: https://edirc.repec.org/data/fceumuy.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.