IDEAS home Printed from https://ideas.repec.org/a/eee/ecolet/v110y2011i1p41-44.html
   My bibliography  Save this article

Asymmetric reduced form Auctions

Author

Listed:
  • Mierendorff, Konrad

Abstract

This paper provides a tractable characterization of feasibility of asymmetric reduced form auctions. Using this, auction design problems can be stated in terms of the reduced form only. This allows to solve optimal auction problems when classical solution techniques fail.

Suggested Citation

  • Mierendorff, Konrad, 2011. "Asymmetric reduced form Auctions," Economics Letters, Elsevier, vol. 110(1), pages 41-44, January.
    • Handle: RePEc:eee:ecolet:v:110:y:2011:i:1:p:41-44
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-1765(10)00331-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Kim Border, 2007. "Reduced Form Auctions Revisited," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 31(1), pages 167-181, April.
    3. Maskin, Eric S & Riley, John G, 1984. "Optimal Auctions with Risk Averse Buyers," Econometrica, Econometric Society, vol. 52(6), pages 1473-1518, November.
    4. Matthews, Steven A, 1984. "On the Implementability of Reduced Form Auctions," Econometrica, Econometric Society, vol. 52(6), pages 1519-1522, November.
    5. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    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. Li, Yunan, 2019. "Efficient mechanisms with information acquisition," Journal of Economic Theory, Elsevier, vol. 182(C), pages 279-328.
    2. 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.
    3. Quitz'e Valenzuela-Stookey, 2022. "Greedy Allocations and Equitable Matchings," Papers 2207.11322, arXiv.org, revised Oct 2022.
    4. 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.
    5. 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.
    6. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    7. Che, Yeon-Koo & Condorelli, Daniele & Kim, Jinwoo, 2018. "Weak cartels and collusion-proof auctions," Journal of Economic Theory, Elsevier, vol. 178(C), pages 398-435.
    8. 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.
    9. 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.
    10. Pai, Mallesh M. & Vohra, Rakesh, 2014. "Optimal auctions with financially constrained buyers," Journal of Economic Theory, Elsevier, vol. 150(C), pages 383-425.
    11. Erlanson, Albin & Kleiner, Andreas, 2019. "A note on optimal allocation with costly verification," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 56-62.
    12. Saeed Alaei & Hu Fu & Nima Haghpanah & Jason Hartline & Azarakhsh Malekian, 2019. "Efficient Computation of Optimal Auctions via Reduced Forms," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 1058-1086, August.
    13. Li, Yunan, 2020. "Mechanism design with costly verification and limited punishments," Journal of Economic Theory, Elsevier, vol. 186(C).
    14. 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.
    15. Rahul Deb & Mallesh Pai, 2013. "Symmetric Auctions," Working Papers tecipa-486, University of Toronto, Department of Economics.
    16. 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.

    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. Xu Lang & Zaifu Yang, 2023. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints," Discussion Papers 23/02, Department of Economics, University of York.
    2. Xu Lang, 2022. "Reduced-Form Allocations with Complementarity: A 2-Person Case," Papers 2202.06245, arXiv.org, revised Feb 2022.
    3. 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.
    4. Saeed Alaei & Hu Fu & Nima Haghpanah & Jason Hartline & Azarakhsh Malekian, 2019. "Efficient Computation of Optimal Auctions via Reduced Forms," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 1058-1086, August.
    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. 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.
    7. Li, Yunan, 2019. "Efficient mechanisms with information acquisition," Journal of Economic Theory, Elsevier, vol. 182(C), pages 279-328.
    8. 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.
    9. John O. Ledyard & Thomas R. Palfrey, 1994. "Voting and Lottery Drafts as Efficient Public Goods Mechanisms," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 61(2), pages 327-355.
    10. 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.
    11. 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.
    12. 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.
    13. Xu Lang, 2023. "A Belief-Based Characterization of Reduced-Form Auctions," Papers 2307.04070, arXiv.org.
    14. Moreira, Humberto Ataíde & Araújo, Aloísio Pessoa de & Castro Filho, Luciano I. de, 2004. "Pure strategy equilibria of multidimensional and non-monotonic auctions," FGV EPGE Economics Working Papers (Ensaios Economicos da EPGE) 571, EPGE Brazilian School of Economics and Finance - FGV EPGE (Brazil).
    15. Quitz'e Valenzuela-Stookey, 2022. "Greedy Allocations and Equitable Matchings," Papers 2207.11322, arXiv.org, revised Oct 2022.
    16. Xu Lang & Zaifu Yang, 2021. "Reduced-Form Allocations for Multiple Indivisible Objects under Constraints," Discussion Papers 21/04, Department of Economics, University of York.
    17. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    18. Tim Roughgarden, 2018. "Complexity Theory, Game Theory, and Economics: The Barbados Lectures," Papers 1801.00734, arXiv.org, revised Feb 2020.
    19. 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.
    20. Pai, Mallesh M. & Vohra, Rakesh, 2014. "Optimal auctions with financially constrained buyers," Journal of Economic Theory, Elsevier, vol. 150(C), pages 383-425.

    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:ecolet:v:110:y:2011:i:1:p:41-44. 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/ecolet .

    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.