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) |
_version_ | 1807522855549665280 |
---|---|
author | Pereyra, Juan S. |
author2 | Silva, Francisco |
author2_role | author |
author_facet | Pereyra, Juan S. Silva, Francisco |
author_role | author |
bitstream.checksum.fl_str_mv | 6429389a7df7277b72b7924fdc7d47a9 a006180e3f5b2ad0b88185d14284c0e0 47b4ef0fcf3525544879e94183c90d75 1996b8461bc290aef6a27d78c67b6b52 b78b936044309fca9d0f1e6e8c71ab45 |
bitstream.checksumAlgorithm.fl_str_mv | MD5 MD5 MD5 MD5 MD5 |
bitstream.url.fl_str_mv | http://localhost:8080/xmlui/bitstream/20.500.12008/25456/5/license.txt http://localhost:8080/xmlui/bitstream/20.500.12008/25456/2/license_url http://localhost:8080/xmlui/bitstream/20.500.12008/25456/3/license_text http://localhost:8080/xmlui/bitstream/20.500.12008/25456/4/license_rdf http://localhost:8080/xmlui/bitstream/20.500.12008/25456/1/DT+E+2020-04.pdf |
collection | COLIBRI |
dc.contributor.filiacion.none.fl_str_mv | Pereyra Juan S., Universidad de la República (Uruguay). Facultad de Ciencias Sociales Silva Francisco |
dc.creator.none.fl_str_mv | Pereyra, Juan S. Silva, Francisco |
dc.date.accessioned.none.fl_str_mv | 2020-10-05T14:24:36Z |
dc.date.available.none.fl_str_mv | 2020-10-05T14:24:36Z |
dc.date.issued.none.fl_str_mv | 2020 |
dc.description.abstract.none.fl_txt_mv | 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. |
dc.format.extent.es.fl_str_mv | 19 p. |
dc.format.mimetype.es.fl_str_mv | application/pdf |
dc.identifier.citation.es.fl_str_mv | Pereyra, J y Silva, F. Optimal assignment mechanisms with imperfect verification. [en línea]. Montevideo : Udelar. FCS-DE, 2020. Documento de Trabajo / FCS-Decon, 04/20 |
dc.identifier.issn.none.fl_str_mv | 0797-7484 |
dc.identifier.uri.none.fl_str_mv | https://hdl.handle.net/20.500.12008/25457 |
dc.language.iso.none.fl_str_mv | en eng |
dc.publisher.es.fl_str_mv | Udelar. FCS-DE |
dc.relation.ispartof.none.fl_str_mv | Documento de Trabajo / FCS-Decon;04/20 |
dc.rights.license.none.fl_str_mv | Licencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0) |
dc.rights.none.fl_str_mv | info:eu-repo/semantics/openAccess |
dc.source.none.fl_str_mv | reponame:COLIBRI instname:Universidad de la República instacron:Universidad de la República |
dc.subject.es.fl_str_mv | Verificación imperfecta Evidencia Diseño de mecanismos Matching Imperfect verification Evidence Mechanism design |
dc.title.none.fl_str_mv | Optimal assignment mechanisms with imperfect verification |
dc.type.es.fl_str_mv | Documento de trabajo |
dc.type.none.fl_str_mv | info:eu-repo/semantics/workingPaper |
dc.type.version.none.fl_str_mv | info:eu-repo/semantics/publishedVersion |
description | 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. |
eu_rights_str_mv | openAccess |
format | workingPaper |
id | COLIBRI_13439405cec663105da7a51ab15a1514 |
identifier_str_mv | Pereyra, J y Silva, F. Optimal assignment mechanisms with imperfect verification. [en línea]. Montevideo : Udelar. FCS-DE, 2020. Documento de Trabajo / FCS-Decon, 04/20 0797-7484 |
instacron_str | Universidad de la República |
institution | Universidad de la República |
instname_str | Universidad de la República |
language | eng |
language_invalid_str_mv | en |
network_acronym_str | COLIBRI |
network_name_str | COLIBRI |
oai_identifier_str | oai:colibri.udelar.edu.uy:20.500.12008/25456 |
publishDate | 2020 |
reponame_str | COLIBRI |
repository.mail.fl_str_mv | mabel.seroubian@seciu.edu.uy |
repository.name.fl_str_mv | COLIBRI - Universidad de la República |
repository_id_str | 4771 |
rights_invalid_str_mv | Licencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0) |
spelling | Pereyra Juan S., Universidad de la República (Uruguay). Facultad de Ciencias SocialesSilva Francisco2020-10-05T14:24:36Z2020-10-05T14:24:36Z2020Pereyra, J y Silva, F. Optimal assignment mechanisms with imperfect verification. [en línea]. Montevideo : Udelar. FCS-DE, 2020. Documento de Trabajo / FCS-Decon, 04/200797-7484https://hdl.handle.net/20.500.12008/25457Objects 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.Submitted by Carracedo Ania (ania.carracedo@cienciassociales.edu.uy) on 2020-10-02T22:37:35Z No. of bitstreams: 2 license_rdf: 23149 bytes, checksum: 1996b8461bc290aef6a27d78c67b6b52 (MD5) DT E 2020-04.pdf: 491708 bytes, checksum: b78b936044309fca9d0f1e6e8c71ab45 (MD5)Approved for entry into archive by Carracedo Ania (ania.carracedo@cienciassociales.edu.uy) on 2020-10-02T22:38:18Z (GMT) No. of bitstreams: 2 license_rdf: 23149 bytes, checksum: 1996b8461bc290aef6a27d78c67b6b52 (MD5) DT E 2020-04.pdf: 491708 bytes, checksum: b78b936044309fca9d0f1e6e8c71ab45 (MD5)Made available in DSpace by Luna Fabiana (fabiana.luna@fic.edu.uy) on 2020-10-05T14:24:36Z (GMT). No. of bitstreams: 2 license_rdf: 23149 bytes, checksum: 1996b8461bc290aef6a27d78c67b6b52 (MD5) DT E 2020-04.pdf: 491708 bytes, checksum: b78b936044309fca9d0f1e6e8c71ab45 (MD5) Previous issue date: 202019 p.application/pdfenengUdelar. FCS-DEDocumento de Trabajo / FCS-Decon;04/20Las obras depositadas en el Repositorio se rigen por la Ordenanza de los Derechos de la Propiedad Intelectual de la Universidad de la República.(Res. Nº 91 de C.D.C. de 8/III/1994 – D.O. 7/IV/1994) y por la Ordenanza del Repositorio Abierto de la Universidad de la República (Res. Nº 16 de C.D.C. de 07/10/2014)info:eu-repo/semantics/openAccessLicencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0)Verificación imperfectaEvidenciaDiseño de mecanismosMatchingImperfect verificationEvidenceMechanism designOptimal assignment mechanisms with imperfect verificationDocumento de trabajoinfo:eu-repo/semantics/workingPaperinfo:eu-repo/semantics/publishedVersionreponame:COLIBRIinstname:Universidad de la Repúblicainstacron:Universidad de la RepúblicaPereyra, Juan S.Silva, FranciscoLICENSElicense.txtlicense.txttext/plain; charset=utf-84267http://localhost:8080/xmlui/bitstream/20.500.12008/25456/5/license.txt6429389a7df7277b72b7924fdc7d47a9MD55CC-LICENSElicense_urllicense_urltext/plain; charset=utf-850http://localhost:8080/xmlui/bitstream/20.500.12008/25456/2/license_urla006180e3f5b2ad0b88185d14284c0e0MD52license_textlicense_texttext/html; charset=utf-838725http://localhost:8080/xmlui/bitstream/20.500.12008/25456/3/license_text47b4ef0fcf3525544879e94183c90d75MD53license_rdflicense_rdfapplication/rdf+xml; charset=utf-823149http://localhost:8080/xmlui/bitstream/20.500.12008/25456/4/license_rdf1996b8461bc290aef6a27d78c67b6b52MD54ORIGINALDT E 2020-04.pdfDT E 2020-04.pdfapplication/pdf491708http://localhost:8080/xmlui/bitstream/20.500.12008/25456/1/DT+E+2020-04.pdfb78b936044309fca9d0f1e6e8c71ab45MD5120.500.12008/254562020-10-05 11:24:36.595oai:colibri.udelar.edu.uy:20.500.12008/25456VGVybWlub3MgeSBjb25kaWNpb25lcyByZWxhdGl2YXMgYWwgZGVwb3NpdG8gZGUgb2JyYXMKCgpMYXMgb2JyYXMgZGVwb3NpdGFkYXMgZW4gZWwgUmVwb3NpdG9yaW8gc2UgcmlnZW4gcG9yIGxhIE9yZGVuYW56YSBkZSBsb3MgRGVyZWNob3MgZGUgbGEgUHJvcGllZGFkIEludGVsZWN0dWFsICBkZSBsYSBVbml2ZXJzaWRhZCBEZSBMYSBSZXDDumJsaWNhLiAoUmVzLiBOwrogOTEgZGUgQy5ELkMuIGRlIDgvSUlJLzE5OTQg4oCTIEQuTy4gNy9JVi8xOTk0KSB5ICBwb3IgbGEgT3JkZW5hbnphIGRlbCBSZXBvc2l0b3JpbyBBYmllcnRvIGRlIGxhIFVuaXZlcnNpZGFkIGRlIGxhIFJlcMO6YmxpY2EgKFJlcy4gTsK6IDE2IGRlIEMuRC5DLiBkZSAwNy8xMC8yMDE0KS4gCgpBY2VwdGFuZG8gZWwgYXV0b3IgZXN0b3MgdMOpcm1pbm9zIHkgY29uZGljaW9uZXMgZGUgZGVww7NzaXRvIGVuIENPTElCUkksIGxhIFVuaXZlcnNpZGFkIGRlIFJlcMO6YmxpY2EgcHJvY2VkZXLDoSBhOiAgCgphKSBhcmNoaXZhciBtw6FzIGRlIHVuYSBjb3BpYSBkZSBsYSBvYnJhIGVuIGxvcyBzZXJ2aWRvcmVzIGRlIGxhIFVuaXZlcnNpZGFkIGEgbG9zIGVmZWN0b3MgZGUgZ2FyYW50aXphciBhY2Nlc28sIHNlZ3VyaWRhZCB5IHByZXNlcnZhY2nDs24KYikgY29udmVydGlyIGxhIG9icmEgYSBvdHJvcyBmb3JtYXRvcyBzaSBmdWVyYSBuZWNlc2FyaW8gIHBhcmEgZmFjaWxpdGFyIHN1IHByZXNlcnZhY2nDs24geSBhY2Nlc2liaWxpZGFkIHNpbiBhbHRlcmFyIHN1IGNvbnRlbmlkby4KYykgcmVhbGl6YXIgbGEgY29tdW5pY2FjacOzbiBww7pibGljYSB5IGRpc3BvbmVyIGVsIGFjY2VzbyBsaWJyZSB5IGdyYXR1aXRvIGEgdHJhdsOpcyBkZSBJbnRlcm5ldCBtZWRpYW50ZSBsYSBwdWJsaWNhY2nDs24gZGUgbGEgb2JyYSBiYWpvIGxhIGxpY2VuY2lhIENyZWF0aXZlIENvbW1vbnMgc2VsZWNjaW9uYWRhIHBvciBlbCBwcm9waW8gYXV0b3IuCgoKRW4gY2FzbyBxdWUgZWwgYXV0b3IgaGF5YSBkaWZ1bmRpZG8geSBkYWRvIGEgcHVibGljaWRhZCBhIGxhIG9icmEgZW4gZm9ybWEgcHJldmlhLCAgcG9kcsOhIHNvbGljaXRhciB1biBwZXLDrW9kbyBkZSBlbWJhcmdvIHNvYnJlIGxhIGRpc3BvbmliaWxpZGFkIHDDumJsaWNhIGRlIGxhIG1pc21hLCBlbCBjdWFsIGNvbWVuemFyw6EgYSBwYXJ0aXIgZGUgbGEgYWNlcHRhY2nDs24gZGUgZXN0ZSBkb2N1bWVudG8geSBoYXN0YSBsYSBmZWNoYSBxdWUgaW5kaXF1ZSAuCgpFbCBhdXRvciBhc2VndXJhIHF1ZSBsYSBvYnJhIG5vIGluZnJpZ2UgbmluZ8O6biBkZXJlY2hvIHNvYnJlIHRlcmNlcm9zLCB5YSBzZWEgZGUgcHJvcGllZGFkIGludGVsZWN0dWFsIG8gY3VhbHF1aWVyIG90cm8uCgpFbCBhdXRvciBnYXJhbnRpemEgcXVlIHNpIGVsIGRvY3VtZW50byBjb250aWVuZSBtYXRlcmlhbGVzIGRlIGxvcyBjdWFsZXMgbm8gdGllbmUgbG9zIGRlcmVjaG9zIGRlIGF1dG9yLCAgaGEgb2J0ZW5pZG8gZWwgcGVybWlzbyBkZWwgcHJvcGlldGFyaW8gZGUgbG9zIGRlcmVjaG9zIGRlIGF1dG9yLCB5IHF1ZSBlc2UgbWF0ZXJpYWwgY3V5b3MgZGVyZWNob3Mgc29uIGRlIHRlcmNlcm9zIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIHkgcmVjb25vY2lkbyBlbiBlbCB0ZXh0byBvIGNvbnRlbmlkbyBkZWwgZG9jdW1lbnRvIGRlcG9zaXRhZG8gZW4gZWwgUmVwb3NpdG9yaW8uCgpFbiBvYnJhcyBkZSBhdXRvcsOtYSBtw7psdGlwbGUgL3NlIHByZXN1bWUvIHF1ZSBlbCBhdXRvciBkZXBvc2l0YW50ZSBkZWNsYXJhIHF1ZSBoYSByZWNhYmFkbyBlbCBjb25zZW50aW1pZW50byBkZSB0b2RvcyBsb3MgYXV0b3JlcyBwYXJhIHB1YmxpY2FybGEgZW4gZWwgUmVwb3NpdG9yaW8sIHNpZW5kbyDDqXN0ZSBlbCDDum5pY28gcmVzcG9uc2FibGUgZnJlbnRlIGEgY3VhbHF1aWVyIHRpcG8gZGUgcmVjbGFtYWNpw7NuIGRlIGxvcyBvdHJvcyBjb2F1dG9yZXMuCgpFbCBhdXRvciBzZXLDoSByZXNwb25zYWJsZSBkZWwgY29udGVuaWRvIGRlIGxvcyBkb2N1bWVudG9zIHF1ZSBkZXBvc2l0YS4gTGEgVURFTEFSIG5vIHNlcsOhIHJlc3BvbnNhYmxlIHBvciBsYXMgZXZlbnR1YWxlcyB2aW9sYWNpb25lcyBhbCBkZXJlY2hvIGRlIHByb3BpZWRhZCBpbnRlbGVjdHVhbCBlbiBxdWUgcHVlZGEgaW5jdXJyaXIgZWwgYXV0b3IuCgpBbnRlIGN1YWxxdWllciBkZW51bmNpYSBkZSB2aW9sYWNpw7NuIGRlIGRlcmVjaG9zIGRlIHByb3BpZWRhZCBpbnRlbGVjdHVhbCwgbGEgVURFTEFSICBhZG9wdGFyw6EgdG9kYXMgbGFzIG1lZGlkYXMgbmVjZXNhcmlhcyBwYXJhIGV2aXRhciBsYSBjb250aW51YWNpw7NuIGRlIGRpY2hhIGluZnJhY2Npw7NuLCBsYXMgcXVlIHBvZHLDoW4gaW5jbHVpciBlbCByZXRpcm8gZGVsIGFjY2VzbyBhIGxvcyBjb250ZW5pZG9zIHkvbyBtZXRhZGF0b3MgZGVsIGRvY3VtZW50byByZXNwZWN0aXZvLgoKTGEgb2JyYSBzZSBwb25kcsOhIGEgZGlzcG9zaWNpw7NuIGRlbCBww7pibGljbyBhIHRyYXbDqXMgZGUgbGFzIGxpY2VuY2lhcyBDcmVhdGl2ZSBDb21tb25zLCBlbCBhdXRvciBwb2Ryw6Egc2VsZWNjaW9uYXIgdW5hIGRlIGxhcyA2IGxpY2VuY2lhcyBkaXNwb25pYmxlczoKCgpBdHJpYnVjacOzbiAoQ0MgLSBCeSk6IFBlcm1pdGUgdXNhciBsYSBvYnJhIHkgZ2VuZXJhciBvYnJhcyBkZXJpdmFkYXMsIGluY2x1c28gY29uIGZpbmVzIGNvbWVyY2lhbGVzLCBzaWVtcHJlIHF1ZSBzZSByZWNvbm96Y2EgYWwgYXV0b3IuCgpBdHJpYnVjacOzbiDigJMgQ29tcGFydGlyIElndWFsIChDQyAtIEJ5LVNBKTogUGVybWl0ZSB1c2FyIGxhIG9icmEgeSBnZW5lcmFyIG9icmFzIGRlcml2YWRhcywgaW5jbHVzbyBjb24gZmluZXMgY29tZXJjaWFsZXMsIHBlcm8gbGEgZGlzdHJpYnVjacOzbiBkZSBsYXMgb2JyYXMgZGVyaXZhZGFzIGRlYmUgaGFjZXJzZSBtZWRpYW50ZSB1bmEgbGljZW5jaWEgaWTDqW50aWNhIGEgbGEgZGUgbGEgb2JyYSBvcmlnaW5hbCwgcmVjb25vY2llbmRvIGEgbG9zIGF1dG9yZXMuCgpBdHJpYnVjacOzbiDigJMgTm8gQ29tZXJjaWFsIChDQyAtIEJ5LU5DKTogUGVybWl0ZSB1c2FyIGxhIG9icmEgeSBnZW5lcmFyIG9icmFzIGRlcml2YWRhcywgc2llbXByZSB5IGN1YW5kbyBlc29zIHVzb3Mgbm8gdGVuZ2FuIGZpbmVzIGNvbWVyY2lhbGVzLCByZWNvbm9jaWVuZG8gYWwgYXV0b3IuCgpBdHJpYnVjacOzbiDigJMgU2luIERlcml2YWRhcyAoQ0MgLSBCeS1ORCk6IFBlcm1pdGUgZWwgdXNvIGRlIGxhIG9icmEsIGluY2x1c28gY29uIGZpbmVzIGNvbWVyY2lhbGVzLCBwZXJvIG5vIHNlIHBlcm1pdGUgZ2VuZXJhciBvYnJhcyBkZXJpdmFkYXMsIGRlYmllbmRvIHJlY29ub2NlciBhbCBhdXRvci4KCkF0cmlidWNpw7NuIOKAkyBObyBDb21lcmNpYWwg4oCTIENvbXBhcnRpciBJZ3VhbCAoQ0Mg4oCTIEJ5LU5DLVNBKTogUGVybWl0ZSB1c2FyIGxhIG9icmEgeSBnZW5lcmFyIG9icmFzIGRlcml2YWRhcywgc2llbXByZSB5IGN1YW5kbyBlc29zIHVzb3Mgbm8gdGVuZ2FuIGZpbmVzIGNvbWVyY2lhbGVzIHkgbGEgZGlzdHJpYnVjacOzbiBkZSBsYXMgb2JyYXMgZGVyaXZhZGFzIHNlIGhhZ2EgbWVkaWFudGUgbGljZW5jaWEgaWTDqW50aWNhIGEgbGEgZGUgbGEgb2JyYSBvcmlnaW5hbCwgcmVjb25vY2llbmRvIGEgbG9zIGF1dG9yZXMuCgpBdHJpYnVjacOzbiDigJMgTm8gQ29tZXJjaWFsIOKAkyBTaW4gRGVyaXZhZGFzIChDQyAtIEJ5LU5DLU5EKTogUGVybWl0ZSB1c2FyIGxhIG9icmEsIHBlcm8gbm8gc2UgcGVybWl0ZSBnZW5lcmFyIG9icmFzIGRlcml2YWRhcyB5IG5vIHNlIHBlcm1pdGUgdXNvIGNvbiBmaW5lcyBjb21lcmNpYWxlcywgZGViaWVuZG8gcmVjb25vY2VyIGFsIGF1dG9yLgoKTG9zIHVzb3MgcHJldmlzdG9zIGVuIGxhcyBsaWNlbmNpYXMgaW5jbHV5ZW4gbGEgZW5hamVuYWNpw7NuLCByZXByb2R1Y2Npw7NuLCBjb211bmljYWNpw7NuLCBwdWJsaWNhY2nDs24sIGRpc3RyaWJ1Y2nDs24geSBwdWVzdGEgYSBkaXNwb3NpY2nDs24gZGVsIHDDumJsaWNvLiBMYSBjcmVhY2nDs24gZGUgb2JyYXMgZGVyaXZhZGFzIGluY2x1eWUgbGEgYWRhcHRhY2nDs24sIHRyYWR1Y2Npw7NuIHkgZWwgcmVtaXguCgpDdWFuZG8gc2Ugc2VsZWNjaW9uZSB1bmEgbGljZW5jaWEgcXVlIGhhYmlsaXRlIHVzb3MgY29tZXJjaWFsZXMsIGVsIGRlcMOzc2l0byBkZWJlcsOhIHNlciBhY29tcGHDsWFkbyBkZWwgYXZhbCBkZWwgamVyYXJjYSBtw6F4aW1vIGRlbCBTZXJ2aWNpbyBjb3JyZXNwb25kaWVudGUuCg==Universidadhttps://udelar.edu.uy/https://www.colibri.udelar.edu.uy/oai/requestmabel.seroubian@seciu.edu.uyUruguayopendoar:47712024-07-25T14:31:32.184969COLIBRI - Universidad de la Repúblicafalse |
spellingShingle | Optimal assignment mechanisms with imperfect verification Pereyra, Juan S. Verificación imperfecta Evidencia Diseño de mecanismos Matching Imperfect verification Evidence Mechanism design |
status_str | publishedVersion |
title | Optimal assignment mechanisms with imperfect verification |
title_full | Optimal assignment mechanisms with imperfect verification |
title_fullStr | Optimal assignment mechanisms with imperfect verification |
title_full_unstemmed | Optimal assignment mechanisms with imperfect verification |
title_short | Optimal assignment mechanisms with imperfect verification |
title_sort | Optimal assignment mechanisms with imperfect verification |
topic | Verificación imperfecta Evidencia Diseño de mecanismos Matching Imperfect verification Evidence Mechanism design |
url | https://hdl.handle.net/20.500.12008/25457 |