IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v84y2019icp56-62.html
   My bibliography  Save this article

A note on optimal allocation with costly verification

Author

Listed:
  • Erlanson, Albin
  • Kleiner, Andreas

Abstract

We revisit the problem of a principal allocating an indivisible good with costly verification, as it was formulated and analyzed by Ben-Porath et al. (2014). We establish, in this setting, a general equivalence between Bayesian and ex-post incentive compatible mechanisms. We also provide a simple proof showing that the optimal mechanism is a threshold mechanism.

Suggested Citation

  • Erlanson, Albin & Kleiner, Andreas, 2019. "A note on optimal allocation with costly verification," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 56-62.
    • Handle: RePEc:eee:mateco:v:84:y:2019:i:c:p:56-62
    DOI: 10.1016/j.jmateco.2019.06.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406819300734
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmateco.2019.06.002?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Border, Kim C, 1991. "Implementation of Reduced Form Auctions: A Geometric Approach," Econometrica, Econometric Society, vol. 59(4), pages 1175-1187, July.
    2. Elchanan Ben-Porath & Eddie Dekel & Barton L. Lipman, 2014. "Optimal Allocation with Costly Verification," American Economic Review, American Economic Association, vol. 104(12), pages 3779-3813, December.
    3. Mookherjee, Dilip & Reichelstein, Stefan, 1992. "Dominant strategy implementation of Bayesian incentive compatible allocation rules," Journal of Economic Theory, Elsevier, vol. 56(2), pages 378-399, April.
    4. Tymofiy Mylovanov & Andriy Zapechelnyuk, 2017. "Optimal Allocation with Ex Post Verification and Limited Penalties," American Economic Review, American Economic Association, vol. 107(9), pages 2666-2694, September.
    5. Alex Gershkov & Jacob K. Goeree & Alexey Kushnir & Benny Moldovanu & Xianwen Shi, 2013. "On the Equivalence of Bayesian and Dominant Strategy Implementation," Econometrica, Econometric Society, vol. 81(1), pages 197-220, January.
    6. Alejandro M. Manelli & Daniel R. Vincent, 2010. "Bayesian and Dominant‐Strategy Implementation in the Independent Private‐Values Model," Econometrica, Econometric Society, vol. 78(6), pages 1905-1938, November.
    7. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    8. Yeon‐Koo Che & Jinwoo Kim & Konrad Mierendorff, 2013. "Generalized Reduced‐Form Auctions: A Network‐Flow Approach," Econometrica, Econometric Society, vol. 81(6), pages 2487-2520, November.
    9. Erlanson, Albin & Kleiner, Andreas, 2020. "Costly verification in collective decisions," Theoretical Economics, Econometric Society, vol. 15(3), July.
    10. Alexey Kushnir, 2013. "On the equivalence between Bayesian and dominant strategy implementation: the case of correlated types," ECON - Working Papers 129, Department of Economics - University of Zurich.
    11. Mierendorff, Konrad, 2011. "Asymmetric reduced form Auctions," Economics Letters, Elsevier, vol. 110(1), pages 41-44, January.
    12. Pai, Mallesh M. & Vohra, Rakesh, 2014. "Optimal auctions with financially constrained buyers," Journal of Economic Theory, Elsevier, vol. 150(C), pages 383-425.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Axel Niemeyer & Justus Preusser, 2023. "Simple Allocation with Correlated Types," CRC TR 224 Discussion Paper Series crctr224_2023_486, University of Bonn and University of Mannheim, Germany.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Goeree, Jacob K. & Kushnir, Alexey, 2016. "Reduced form implementation for environments with value interdependencies," Games and Economic Behavior, Elsevier, vol. 99(C), pages 250-256.
    2. Sergiu Hart & Philip J. Reny, 2015. "Implementation of reduced form mechanisms: a simple approach and a new characterization," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 3(1), pages 1-8, April.
    3. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object auction design: Ex-post revenue maximization with no wastage," ISER Discussion Paper 1001, Institute of Social and Economic Research, Osaka University.
    4. Xu Lang, 2022. "Reduced-Form Allocations with Complementarity: A 2-Person Case," Papers 2202.06245, arXiv.org, revised Feb 2022.
    5. Xu Lang, 2022. "Reduced-form budget allocation with multiple public alternatives," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(2), pages 335-359, August.
    6. Li, Yunan, 2019. "Efficient mechanisms with information acquisition," Journal of Economic Theory, Elsevier, vol. 182(C), pages 279-328.
    7. Jarman, Felix & Meisner, Vincent, 2017. "Ex-post optimal knapsack procurement," Journal of Economic Theory, Elsevier, vol. 171(C), pages 35-63.
    8. Xu Lang & Zaifu Yang, 2023. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints," Discussion Papers 23/02, Department of Economics, University of York.
    9. Yunan Li, 2017. "Mechanism Design with Costly Verification and Limited Punishments, Third Version," PIER Working Paper Archive 16-009, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 28 Sep 2017.
    10. Yunan Li, 2017. "Efficient Mechanisms with Information Acquisition," PIER Working Paper Archive 16-007, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 23 Jun 2017.
    11. Erya Yang, 2021. "Reduced-form mechanism design and ex post fairness constraints," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 9(2), pages 269-293, October.
    12. Andreas Kleiner & Benny Moldovanu & Philipp Strack, 2021. "Extreme Points and Majorization: Economic Applications," Econometrica, Econometric Society, vol. 89(4), pages 1557-1593, July.
    13. Xu Lang & Zaifu Yang, 2021. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints," Discussion Papers 21/04, Department of Economics, University of York.
    14. Erlanson, Albin & Kleiner, Andreas, 2020. "Costly verification in collective decisions," Theoretical Economics, Econometric Society, vol. 15(3), July.
    15. Xu Lang & Zaifu Yang, 2021. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints: A Revision," Discussion Papers 21/05, Department of Economics, University of York.
    16. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object allocation: Ex-post revenue maximization with no wastage," Working Papers e116, Tokyo Center for Economic Research.
    17. Li, Yunan, 2020. "Mechanism design with costly verification and limited punishments," Journal of Economic Theory, Elsevier, vol. 186(C).
    18. Tomoya Kazumura & Debasis Mishra & Shigehiro Serizawa, 2017. "Strategy-proof multi-object auction design: Ex-post revenue maximization with no wastage," Discussion Papers 17-03, Indian Statistical Institute, Delhi.
    19. Xu Lang & Debasis Mishra, 2022. "Symmetric reduced form voting," Papers 2207.09253, arXiv.org, revised Apr 2023.
    20. Rahul Deb & Mallesh Pai, 2013. "Symmetric Auctions," Working Papers tecipa-486, University of Toronto, Department of Economics.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:84:y:2019:i:c:p:56-62. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.