 Mechanism design with costly verification and limited punishmentsYunan Li Journal of Economic Theory, 2020, vol. 186, issue C Abstract: A principal allocates an object (e.g., a job or grant) among several agents, each of whom wants the object and privately knows the value to the principal of assigning it to him. The object is allocated based on the agents' reports. The principal can choose to inspect an agent's report at a cost and impose a limited punishment on the one who receives the object. An optimal mechanism specifies two thresholds vl≤vu. If every agent reports a value below vl, the object is assigned to a random agent, and no one is inspected. If any agents report a value above vl but all reports are below vu, the agent with the highest reported value receives the object and is inspected with some probability. If any agents report values above vu, one of them is randomly selected to receive the object and is inspected with certainty. An agent is punished if and only if his report is found to be false. When the number of agents is small, vu is equal to the upper bound of the support of the value distribution. When the number of agents is large, vl=vu. Keywords: Mechanism design; Costly verification; Limited punishments (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:jetheo:v:186:y:2020:i:c:s0022053120300089 DOI: 10.1016/j.jet.2020.105000 Access Statistics for this article Journal of Economic Theory is currently edited by A. Lizzeri and K. Shell More articles in Journal of Economic Theory from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.