Optimal assignment mechanisms with imperfect verification

Pereyra, Juan S. - Silva, Francisco

Resumen:

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 through signals that are positively affiliated with each agent’s type. We characterize mechanisms that maximize the social planner’s expected payoff. In the optimal mechanism, each agent chooses one of various tracks, which are characterized by two thresholds. 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.


Detalles Bibliográficos
2023
Probabilistic
Verification
Evidence
Mechanism design
Matching
Inglés
Universidad de Montevideo
REDUM
https://hdl.handle.net/20.500.12806/2441
https://doi.org/10.3982/TE5088
Acceso abierto
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
_version_ 1807356681195094016
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 8b80ba5d472509ba38730f34d49d0373
4460e5956bc1d1639be9ae6146a50347
691ed290c8bf8671811a9242b7fc04b6
47132dc17b12a271675192c0301618d3
7dc434ee4c3e65df8a45d09e03dfca54
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
MD5
MD5
bitstream.url.fl_str_mv http://redum.um.edu.uy/bitstream/20.500.12806/2441/1/Theoretical%20Economics%20-%202023%20-%20Pereyra%20-%20Optimal%20assignment%20mechanisms%20with%20imperfect%20verification.pdf
http://redum.um.edu.uy/bitstream/20.500.12806/2441/2/license_rdf
http://redum.um.edu.uy/bitstream/20.500.12806/2441/3/license.txt
http://redum.um.edu.uy/bitstream/20.500.12806/2441/4/Theoretical%20Economics%20-%202023%20-%20Pereyra%20-%20Optimal%20assignment%20mechanisms%20with%20imperfect%20verification.pdf.txt
http://redum.um.edu.uy/bitstream/20.500.12806/2441/5/Theoretical%20Economics%20-%202023%20-%20Pereyra%20-%20Optimal%20assignment%20mechanisms%20with%20imperfect%20verification.pdf.jpg
collection REDUM
dc.contributor.filiacion.es.fl_str_mv Pereyra, Juan S. Universidad de Montevideo, Uruguay
Silva, Francisco. Deakin University
dc.creator.none.fl_str_mv Pereyra, Juan S.
Silva, Francisco
dc.date.accessioned.none.fl_str_mv 2024-06-12T17:20:31Z
dc.date.available.none.fl_str_mv 2024-06-12T17:20:31Z
dc.date.issued.es.fl_str_mv 2023
dc.description.abstract.none.fl_txt_mv 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 through signals that are positively affiliated with each agent’s type. We characterize mechanisms that maximize the social planner’s expected payoff. In the optimal mechanism, each agent chooses one of various tracks, which are characterized by two thresholds. 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.
dc.format.extent.es.fl_str_mv pp. 793-836
dc.format.mimetype.es.fl_str_mv application/pdf
dc.identifier.doi.es.fl_str_mv https://doi.org/10.3982/TE5088
dc.identifier.issn.es.fl_str_mv 1555-7561
dc.identifier.uri.none.fl_str_mv https://hdl.handle.net/20.500.12806/2441
dc.language.iso.none.fl_str_mv eng
dc.publisher.es.fl_str_mv Wiley
dc.relation.ispartof.es.fl_str_mv Theoretical Economics, n° 18, 793-836
dc.rights.es.fl_str_mv Abierto
dc.rights.license.none.fl_str_mv Attribution-NonCommercial-NoDerivatives 4.0 Internacional
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
dc.rights.uri.*.fl_str_mv http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.source.none.fl_str_mv reponame:REDUM
instname:Universidad de Montevideo
instacron:Universidad de Montevideo
dc.subject.keyword.es.fl_str_mv Probabilistic
Verification
Evidence
Mechanism design
Matching
dc.title.none.fl_str_mv Optimal assignment mechanisms with imperfect verification
dc.type.es.fl_str_mv Artículo
dc.type.none.fl_str_mv info:eu-repo/semantics/article
dc.type.version.es.fl_str_mv Publicada
dc.type.version.none.fl_str_mv info:eu-repo/semantics/publishedVersion
description 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 through signals that are positively affiliated with each agent’s type. We characterize mechanisms that maximize the social planner’s expected payoff. In the optimal mechanism, each agent chooses one of various tracks, which are characterized by two thresholds. 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.
eu_rights_str_mv openAccess
format article
id REDUM_1f79f7ba6e1443e7acbc8f47b5ddb5ec
identifier_str_mv 1555-7561
instacron_str Universidad de Montevideo
institution Universidad de Montevideo
instname_str Universidad de Montevideo
language eng
network_acronym_str REDUM
network_name_str REDUM
oai_identifier_str oai:redum.um.edu.uy:20.500.12806/2441
publishDate 2023
reponame_str REDUM
repository.mail.fl_str_mv nolascoaga@um.edu.uy
repository.name.fl_str_mv REDUM - Universidad de Montevideo
repository_id_str 10501
rights_invalid_str_mv Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Abierto
http://creativecommons.org/licenses/by-nc-nd/4.0/
spelling Attribution-NonCommercial-NoDerivatives 4.0 InternacionalAbiertohttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccessf117db58-bcc8-4ad0-a55c-816ab5052a016770acb2-f8d4-4f81-ab25-1c119b35fbedPereyra, Juan S. Universidad de Montevideo, UruguaySilva, Francisco. Deakin University2024-06-12T17:20:31Z2024-06-12T17:20:31Z20231555-7561https://hdl.handle.net/20.500.12806/2441https://doi.org/10.3982/TE5088pp. 793-836application/pdfengWileyTheoretical Economics, n° 18, 793-836Optimal assignment mechanisms with imperfect verificationArtículoPublicadainfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleObjects 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 through signals that are positively affiliated with each agent’s type. We characterize mechanisms that maximize the social planner’s expected payoff. In the optimal mechanism, each agent chooses one of various tracks, which are characterized by two thresholds. 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.ProbabilisticVerificationEvidenceMechanism designMatchingreponame:REDUMinstname:Universidad de Montevideoinstacron:Universidad de MontevideoPereyra, Juan S.Silva, FranciscoORIGINALTheoretical Economics - 2023 - Pereyra - Optimal assignment mechanisms with imperfect verification.pdfTheoretical Economics - 2023 - Pereyra - Optimal assignment mechanisms with imperfect verification.pdfapplication/pdf414223http://redum.um.edu.uy/bitstream/20.500.12806/2441/1/Theoretical%20Economics%20-%202023%20-%20Pereyra%20-%20Optimal%20assignment%20mechanisms%20with%20imperfect%20verification.pdf8b80ba5d472509ba38730f34d49d0373MD51CC-LICENSElicense_rdflicense_rdfapplication/rdf+xml; charset=utf-8805http://redum.um.edu.uy/bitstream/20.500.12806/2441/2/license_rdf4460e5956bc1d1639be9ae6146a50347MD52LICENSElicense.txtlicense.txttext/plain; charset=utf-82117http://redum.um.edu.uy/bitstream/20.500.12806/2441/3/license.txt691ed290c8bf8671811a9242b7fc04b6MD53TEXTTheoretical Economics - 2023 - Pereyra - Optimal assignment mechanisms with imperfect verification.pdf.txtTheoretical Economics - 2023 - Pereyra - Optimal assignment mechanisms with imperfect verification.pdf.txtExtracted texttext/plain125324http://redum.um.edu.uy/bitstream/20.500.12806/2441/4/Theoretical%20Economics%20-%202023%20-%20Pereyra%20-%20Optimal%20assignment%20mechanisms%20with%20imperfect%20verification.pdf.txt47132dc17b12a271675192c0301618d3MD54THUMBNAILTheoretical Economics - 2023 - Pereyra - Optimal assignment mechanisms with imperfect verification.pdf.jpgTheoretical Economics - 2023 - Pereyra - Optimal assignment mechanisms with imperfect verification.pdf.jpgGenerated Thumbnailimage/jpeg1689http://redum.um.edu.uy/bitstream/20.500.12806/2441/5/Theoretical%20Economics%20-%202023%20-%20Pereyra%20-%20Optimal%20assignment%20mechanisms%20with%20imperfect%20verification.pdf.jpg7dc434ee4c3e65df8a45d09e03dfca54MD5520.500.12806/24412024-06-13 03:00:19.369oai:redum.um.edu.uy:20.500.12806/2441TGljZW5jaWEgZGUgRGlzdHJpYnVjacOzbiBObyBFeGNsdXNpdmEgCkF1dG9yaXphY2nDs24gcGFyYSBsYSBwdWJsaWNhY2nDs24gZW4gZWwgUmVwb3NpdG9yaW8gRGlnaXRhbCBVbml2ZXJzaWRhZCBkZSBNb250ZXZpZGVvIChSRURVTSkKClBhcmEgcXVlIGVsIFJFRFVNIGFsbWFjZW5lLCByZXByb2R1emNhIHkgZGlmdW5kYSBww7pibGljYW1lbnRlIGxhIG9icmEgcXVlIHNlIGRlcG9zaXRhLCBlcyBuZWNlc2FyaW8gcXVlIGFjZXB0ZSBsb3Mgc2lndWllbnRlcyB0w6lybWlub3M6CgoxLglBdXRvcml6byBhIGxhIFVuaXZlcnNpZGFkIGRlIE1vbnRldmlkZW8gZWwgZGVyZWNobyBubyBleGNsdXNpdm8gZGUgYWxtYWNlbmFyLCByZXByb2R1Y2lyLCBjb211bmljYXIgeS9vIGRpc3RyaWJ1aXIgZ3JhdHVpdGEgeSBww7pibGljYW1lbnRlIGVzdGEgb2JyYSBiYWpvIGZvcm1hdG8gZWxlY3Ryw7NuaWNvIGVuIGVsIFJFRFVNLiAKMi4JRXN0b3kgZGUgYWN1ZXJkbyBlbiBxdWUgbGEgVW5pdmVyc2lkYWQgZGUgTW9udGV2aWRlbyBwdWVkYSBjb25zZXJ2YXIgbcOhcyBkZSB1bmEgY29waWEgZGUgZXN0YSBvYnJhIHksIHNpbiBhbHRlcmFyIHN1IGNvbnRlbmlkbywgY29udmVydGlybG8gYSBjdWFscXVpZXIgZm9ybWF0byBkZSBhcmNoaXZvLCBtZWRpbyBvIHNvcG9ydGUsIHBhcmEgcHJvcMOzc2l0b3MgZGUgc2VndXJpZGFkLCBwcmVzZXJ2YWNpw7NuIHkgYWNjZXNvLiAKMy4JQXV0b3Jpem8gbGEgcmVwcm9kdWNjacOzbiB0b3RhbCBvIHBhcmNpYWwgZGUgbGEgb2JyYSwgc2llbXByZSBhc29jaWFkYSBhIG1pIG5vbWJyZSBlbiBjYWxpZGFkIGRlIGF1dG9yLgo0LglFbiBuaW5ndW5hIGNpcmN1bnN0YW5jaWEgYXV0b3Jpem8gbGEgYWRhcHRhY2nDs24sIHRyYW5zZm9ybWFjacOzbiwgdHJhZHVjY2nDs24geSBlbiBnZW5lcmFsIGN1YWxxdWllciB0aXBvIGRlIG1vZGlmaWNhY2nDs24gYSBtaSBvYnJhLgo1LglEZWNsYXJvIHF1ZSBlc3RhIG9icmEgZXMgdW4gdHJhYmFqbyBvcmlnaW5hbCB5IHF1ZSBzb3kgYXV0b3IgZGUgbGEgbWlzbWEgeSBxdWUgbm8gaGUgb3RvcmdhZG8gZXNvcyBkZXJlY2hvcyBhIHRlcmNlcm9zIHF1ZSBwdWVkYW4gbGltaXRhciBhIGxhIFVNIHBhcmEgZWplcmNlcmxvcy4gCjYuCUVuIGVsIGNhc28gZGUgcXVlIGVzdGEgb2JyYSBjb250ZW5nYSBtYXRlcmlhbCBwYXJhIGVsIHF1ZSBubyBwb3NlbyBkZXJlY2hvcyBkZSBhdXRvciwgZGVjbGFybyBxdWUgaGUgb2J0ZW5pZG8gZWwgcGVybWlzbyBzaW4gcmVzdHJpY2Npb25lcyBkZWwKcHJvcGlldGFyaW8gZGUgbG9zIGRlcmVjaG9zIGRlIGF1dG9yIHBhcmEgb3RvcmdhciBhIGxhIFVuaXZlcnNpZGFkIGRlIE1vbnRldmlkZW8gbG9zIGRlcmVjaG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW5jaWEsIHkgcXVlIGRpY2hvIG1hdGVyaWFsIGRlIHRlcmNlcm9zIGVzdMOhIGNsYXJhbWVudGUgaWRlbnRpZmljYWRvIHkgcmVjb25vY2lkbyBkZW50cm8gZGVsIHRleHRvIG8gY29udGVuaWRvIGRlIGxhIHByZXNlbnRhY2nDs24uIAo3LglEZWNsYXJvIHF1ZSBsYSBVbml2ZXJzaWRhZCBkZSBNb250ZXZpZGVvIHF1ZWRhIGV4Y2x1aWRhIGRlIHRvZGEgcmVzcG9uc2FiaWxpZGFkIGVuIGNhc28gZGUgZXZlbnR1YWxlcyByZWNsYW1hY2lvbmVzIGRlIHRlcmNlcm9zIHBvciBpbmZyaW5naXIgbG9zIGRlcmVjaG9zIGRlIGF1dG9yLiAKOC4JRGVjbGFybyBxdWUgbGFzIG9waW5pb25lcyBleHByZXNhZGFzIGVuIGVzdGUgZG9jdW1lbnRvIG5vIHNvbiBuZWNlc2FyaWFtZW50ZSBjb21wYXJ0aWRhcyBwb3IgbGEgVW5pdmVyc2lkYWQgZGUgTW9udGV2aWRlby4gCjkuCUF1dG9yaXpvIGEgbG9zIHVzdWFyaW9zIGRlbCBSRURVTSBwYXJhIHV0aWxpemFyLCByZXByb2R1Y2lyIHkgZGlzdHJpYnVpciBlc3RlIGRvY3VtZW50byBiYWpvIGxpY2VuY2lhIENyZWF0aXZlIENvbW1vbnMgNC4wLiAoQXRyaWJ1Y2nDs24tTm9Db21lcmNpYWwtU2luRGVyaXZhZGFzIDQuMCBJbnRlcm5hY2lvbmFsKS4KClNpIHRpZW5lIGFsZ3VuYSBkdWRhIHNvYnJlIGxvcyB0w6lybWlub3MgZGUgZXN0YSBhdXRvcml6YWNpw7NuLCBwb3IgZmF2b3IgZW52w61lbGEgYSBiaWJsaW90ZWNhQHVtLmVkdS51eQoKCgo=Universidadhttps://um.edu.uy/https://redum.um.edu.uy/oai/requestnolascoaga@um.edu.uyUruguayopendoar:105012024-06-13T06:00:19REDUM - Universidad de Montevideofalse
spellingShingle Optimal assignment mechanisms with imperfect verification
Pereyra, Juan S.
Probabilistic
Verification
Evidence
Mechanism design
Matching
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 Probabilistic
Verification
Evidence
Mechanism design
Matching
url https://hdl.handle.net/20.500.12806/2441
https://doi.org/10.3982/TE5088