St Andrews Research Repository

St Andrews University Home
View Item 
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.

Optimal allocation with ex post verification and limited penalties

Thumbnail
View/Open
Zapechelnyuk_2017_AER_ExpostVerification_AAM.pdf (390.4Kb)
Date
09/2017
Author
Mylovanov , Tymofiy
Zapechelnyuk, Andriy
Keywords
Mechanism design
HB Economic Theory
T-NDAS
BDC
R2C
Metadata
Show full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
Abstract
Several agents with privately known social values compete for a prize. The prize is allocated based on the claims of the agents, and the winner is subject to a limited penalty if he makes a false claim. If the number of agents is large, the optimal mechanism places all agents above a threshold onto a shortlist along with a fraction of agents below the threshold, and then allocates the prize to a random agent on the shortlist. When the number of agents is small, the optimal mechanism allocates the prize to the agent who makes the highest claim, but restricts the range of claims above and below.
Citation
Mylovanov , T & Zapechelnyuk , A 2017 , ' Optimal allocation with ex post verification and limited penalties ' , American Economic Review , vol. 107 , no. 9 , pp. 2666-2694 . https://doi.org/10.1257/aer.20140494
Publication
American Economic Review
Status
Peer reviewed
DOI
https://doi.org/10.1257/aer.20140494
ISSN
0002-8282
Type
Journal article
Rights
Copyright © 2017 AEA. This work has been made available online in accordance with the publisher’s policies. This is the author created accepted version manuscript following peer review and as such may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1257/aer.20140494
Collections
  • University of St Andrews Research
URI
http://hdl.handle.net/10023/11657

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

Advanced Search

Browse

All of RepositoryCommunities & CollectionsBy Issue DateNamesTitlesSubjectsClassificationTypeFunderThis CollectionBy Issue DateNamesTitlesSubjectsClassificationTypeFunder

My Account

Login

Open Access

To find out how you can benefit from open access to research, see our library web pages and Open Access blog. For open access help contact: openaccess@st-andrews.ac.uk.

Accessibility

Read our Accessibility statement.

How to submit research papers

The full text of research papers can be submitted to the repository via Pure, the University's research information system. For help see our guide: How to deposit in Pure.

Electronic thesis deposit

Help with deposit.

Repository help

For repository help contact: Digital-Repository@st-andrews.ac.uk.

Give Feedback

Cookie policy

This site may use cookies. Please see Terms and Conditions.

Usage statistics

COUNTER-compliant statistics on downloads from the repository are available from the IRUS-UK Service. Contact us for information.

© University of St Andrews Library

University of St Andrews is a charity registered in Scotland, No SC013532.

  • Facebook
  • Twitter