Optimal assignment mechanisms with imperfect verification
Resumen:
Objects of different quality are to be assigned to agents. Agents can be assigned at most one object and there are not enough high-quality objects for every agent. 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. We characterize a mechanism that maximizes welfare, where agents face different lotteries over the various objects, depending on their report. We then apply our main result to the case of college admissions. We find that optimal mechanisms are, in general, ex-post ineficient and do strictly better than the standard mechanisms that are typically studied in the matching literature.
Objetos de distinta calidad deben ser asignados a agentes. Cada agente puede recibir a lo sumo un objeto, y no hay suficientes objetos de alta calidad para todos los agentes. El planificador central no puede usar transferencias monetarias para dar incentivos a los agentes de forma que reporten su información privada. En lugar de transferencias puede verificar los reportes de los agentes aunque imperfectamente. Caracterizamos un mecanismo que maximiza el bienestar, en el cual distintos agentes enfrentan distintas loterías sobre los objetos dependiendo de su reporte. Aplicamos luego nuestro resultado principal al caso de las admisiones a las universidades. Encontramos que los mecanismos óptimos en este caso son, en general, ex-post ineficientes y tienen una performance estrictamente mejor que los mecanismos estudiados en esta literatura.
2020 | |
Verificación imperfecta Evidencia Diseño de mecanismos Matching Imperfect verification Evidence Mechanism design |
|
Inglés | |
Universidad de la República | |
COLIBRI | |
https://hdl.handle.net/20.500.12008/25457 | |
Acceso abierto | |
Licencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0) |
Sumario: | Objects of different quality are to be assigned to agents. Agents can be assigned at most one object and there are not enough high-quality objects for every agent. 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. We characterize a mechanism that maximizes welfare, where agents face different lotteries over the various objects, depending on their report. We then apply our main result to the case of college admissions. We find that optimal mechanisms are, in general, ex-post ineficient and do strictly better than the standard mechanisms that are typically studied in the matching literature. |
---|