IDEAS home Printed from https://ideas.repec.org/a/aea/aecrev/v102y2012i3p330-36.html
   My bibliography  Save this article

Approximation in Mechanism Design

Author

Listed:
  • Jason D. Hartline

Abstract

This paper considers three challenge areas for mechanism design and describes the role approximation plays in resolving them. Challenge 1: optimal mechanisms are finely tuned to precise details of the distribution on agent preferences. Challenge 2: in environments with multi-dimensional agent preferences economic analysis has failed to provide general characterizations optimal mechanisms. Challenge 3: optimal mechanisms are parameterized by unrealistic knowledge of the distribution of agents' private preferences. This paper surveys positive resolutions to these challenges with emphasis on basic techniques and their relevance to theory and practice.

Suggested Citation

  • Jason D. Hartline, 2012. "Approximation in Mechanism Design," American Economic Review, American Economic Association, vol. 102(3), pages 330-336, May.
    • Handle: RePEc:aea:aecrev:v:102:y:2012:i:3:p:330-36
    as

    Download full text from publisher

    File URL: http://www.aeaweb.org/articles.php?doi=10.1257/aer.102.3.330
    Download Restriction: Access to full text is restricted to AEA members and institutional subscribers.
    ---><---

    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. Ilya Segal, 2003. "Optimal Pricing Mechanisms with Unknown Demand," American Economic Review, American Economic Association, vol. 93(3), pages 509-529, June.
    2. Manelli, Alejandro M. & Vincent, Daniel R., 2007. "Multidimensional mechanism design: Revenue maximization and the multiple-good monopoly," Journal of Economic Theory, Elsevier, vol. 137(1), pages 153-185, November.
    3. Coase, Ronald H, 1972. "Durability and Monopoly," Journal of Law and Economics, University of Chicago Press, vol. 15(1), pages 143-149, April.
    4. Thanassoulis, John, 2004. "Haggling over substitutes," Journal of Economic Theory, Elsevier, vol. 117(2), pages 217-245, August.
    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. Alaei, Saeed & Hartline, Jason & Niazadeh, Rad & Pountourakis, Emmanouil & Yuan, Yang, 2019. "Optimal auctions vs. anonymous pricing," Games and Economic Behavior, Elsevier, vol. 118(C), pages 494-510.
    2. Jason Milionis & Ciamac C. Moallemi & Tim Roughgarden, 2023. "A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers," Papers 2303.00208, arXiv.org, revised Nov 2023.
    3. Nima Anari & Rad Niazadeh & Amin Saberi & Ali Shameli, 2018. "Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection," Papers 1807.05477, arXiv.org, revised Mar 2024.
    4. Babaioff, Moshe & Blumrosen, Liad & Roth, Aaron, 2015. "Auctions with online supply," Games and Economic Behavior, Elsevier, vol. 90(C), pages 227-246.
    5. Li, Yunan, 2017. "Approximation in mechanism design with interdependent values," Games and Economic Behavior, Elsevier, vol. 103(C), pages 225-253.
    6. Marco Battaglini & Rohit Lamba, 2012. "Optimal Dynamic Contracting," Working Papers 1431, Princeton University, Department of Economics, Econometric Research Program..
    7. Shraman Banerjee & Swagata Bhattacharjee, 2023. "Virtue of Simplicity in Asymmetric Auctions," Working Papers 2023-01, Shiv Nadar University, Department of Economics.
    8. Devanur, Nikhil R. & Hartline, Jason D. & Yan, Qiqi, 2015. "Envy freedom and prior-free mechanism design," Journal of Economic Theory, Elsevier, vol. 156(C), pages 103-143.
    9. Kleinberg, Robert & Weinberg, S. Matthew, 2019. "Matroid prophet inequalities and applications to multi-dimensional mechanism design," Games and Economic Behavior, Elsevier, vol. 113(C), pages 97-115.
    10. Hemant K. Bhargava & Gergely Csapó & Rudolf Müller, 2020. "On Optimal Auctions for Mixing Exclusive and Shared Matching in Platforms," Management Science, INFORMS, vol. 66(6), pages 2653-2676, June.
    11. Chawla, Shuchi & Devanur, Nikhil R. & Karlin, Anna R. & Sivan, Balasubramanian, 2022. "Simple pricing schemes for consumers with evolving values," Games and Economic Behavior, Elsevier, vol. 134(C), pages 344-360.
    12. Rahul Deb & Mallesh Pai, 2013. "Symmetric Auctions," Working Papers tecipa-486, University of Toronto, Department of Economics.
    13. Lazzati, Natalia & Van Essen, Matt, 2014. "A nearly optimal auction for an uninformed seller," Economics Letters, Elsevier, vol. 122(3), pages 396-399.
    14. Saeed Alaei & Ali Makhdoumi & Azarakhsh Malekian & Rad Niazadeh, 2022. "Descending Price Auctions with Bounded Number of Price Levels and Batched Prophet Inequality," Papers 2203.01384, arXiv.org.

    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. Jean‐Charles Rochet & John Thanassoulis, 2019. "Intertemporal price discrimination with two products," RAND Journal of Economics, RAND Corporation, vol. 50(4), pages 951-973, December.
    2. Chang, Dongkyu, 2021. "Optimal sales mechanism with outside options," Journal of Economic Theory, Elsevier, vol. 195(C).
    3. Tim Roughgarden & Inbal Talgam-Cohen & Qiqi Yan, 2019. "Robust Auctions for Revenue via Enhanced Competition," Operations Research, INFORMS, vol. 68(4), pages 1074-1094, July.
    4. Beccuti, Juan & Möller, Marc, 2018. "Dynamic adverse selection with a patient seller," Journal of Economic Theory, Elsevier, vol. 173(C), pages 95-117.
    5. Stéphane Gauthier & Guy Laroque, 2021. "Certainty Equivalence and Noisy Redistribution," SciencePo Working papers Main halshs-03359574, HAL.
    6. Beccuti, Juan & Möller, Marc, 2021. "Screening by mode of trade," Games and Economic Behavior, Elsevier, vol. 129(C), pages 400-420.
    7. Sandro Brusco & Giuseppe Lopomo & Leslie M. Marx, 2011. "The Economics of Contingent Re-auctions," American Economic Journal: Microeconomics, American Economic Association, vol. 3(2), pages 165-193, May.
    8. Chen, Bo & Ni, Debing, 2017. "Optimal bundle pricing under correlated valuations," International Journal of Industrial Organization, Elsevier, vol. 52(C), pages 248-281.
    9. Pavlov Gregory, 2011. "Optimal Mechanism for Selling Two Goods," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 11(1), pages 1-35, February.
    10. Szalay, Dezső & Ketelaar, Felix, 2014. "Pricing a Package of Services," CEPR Discussion Papers 10313, C.E.P.R. Discussion Papers.
    11. Pavlov Gregory, 2011. "A Property of Solutions to Linear Monopoly Problems," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 11(1), pages 1-18, February.
    12. Bikhchandani, Sushil & Mishra, Debasis, 2022. "Selling two identical objects," Journal of Economic Theory, Elsevier, vol. 200(C).
    13. Sergiu Hart & Noam Nisan, 2013. "Selling Multiple Correlated Goods: Revenue Maximization and Menu-Size Complexity (old title: "The Menu-Size Complexity of Auctions")," Papers 1304.6116, arXiv.org, revised Nov 2018.
    14. Briest, Patrick & Chawla, Shuchi & Kleinberg, Robert & Weinberg, S. Matthew, 2015. "Pricing lotteries," Journal of Economic Theory, Elsevier, vol. 156(C), pages 144-174.
    15. Hart, Sergiu & Nisan, Noam, 2019. "Selling multiple correlated goods: Revenue maximization and menu-size complexity," Journal of Economic Theory, Elsevier, vol. 183(C), pages 991-1029.
    16. Chawla, Shuchi & Malec, David & Sivan, Balasubramanian, 2015. "The power of randomness in Bayesian optimal mechanism design," Games and Economic Behavior, Elsevier, vol. 91(C), pages 297-317.
    17. Cai, Yang & Daskalakis, Constantinos, 2015. "Extreme value theorems for optimal multidimensional pricing," Games and Economic Behavior, Elsevier, vol. 92(C), pages 266-305.
    18. Chen, Xi & Diakonikolas, Ilias & Paparas, Dimitris & Sun, Xiaorui & Yannakakis, Mihalis, 2018. "The complexity of optimal multidimensional pricing for a unit-demand buyer," Games and Economic Behavior, Elsevier, vol. 110(C), pages 139-164.
    19. Hart, Sergiu & Nisan, Noam, 2017. "Approximate revenue maximization with multiple items," Journal of Economic Theory, Elsevier, vol. 172(C), pages 313-347.
    20. Chaithanya Bandi & Dimitris Bertsimas, 2014. "Optimal Design for Multi-Item Auctions: A Robust Optimization Approach," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 1012-1038, November.

    More about this item

    Statistics

    Access and download statistics

    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:aea:aecrev:v:102:y:2012:i:3:p:330-36. 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: Michael P. Albert (email available below). General contact details of provider: https://edirc.repec.org/data/aeaaaea.html .

    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.