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

Generalized second price auction is optimal for discrete types

Author

Listed:
  • Bayrak, Halil I.
  • Pınar, Mustafa Ç.

Abstract

We prove that a variant of the second price auction for the sale of a single good through a Bayesian incentive compatible mechanism that maximizes expected revenue of the seller is optimal when the type space is discrete. Moreover, we show that this variant is related to the widely used generalized second price auction mechanism in keyword-auctions for advertising, thus providing a theoretical justification for a practical tool.

Suggested Citation

  • Bayrak, Halil I. & Pınar, Mustafa Ç., 2016. "Generalized second price auction is optimal for discrete types," Economics Letters, Elsevier, vol. 141(C), pages 35-38.
    • Handle: RePEc:eee:ecolet:v:141:y:2016:i:c:p:35-38
    DOI: 10.1016/j.econlet.2016.01.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165176516300039
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.econlet.2016.01.019?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. Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.
    2. Harris, Milton & Raviv, Artur, 1981. "Allocation Mechanisms and the Design of Auctions," Econometrica, Econometric Society, vol. 49(6), pages 1477-1499, November.
    3. William S. Lovejoy, 2006. "Optimal Mechanisms with Finite Agent Types," Management Science, INFORMS, vol. 52(5), pages 788-803, May.
    4. 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. Kamyar Kargar & Halil Ibrahim Bayrak & Mustafa Çelebi Pinar, 2018. "Robust bilateral trade with discrete types," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 367-393, December.

    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. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    2. Frank Kelly & Peter Key & Neil Walton, 2016. "Efficient Advert Assignment," Operations Research, INFORMS, vol. 64(4), pages 822-837, August.
    3. Walter Beckert, 2004. "Dynamic Monopolies with Stochastic Demand," Birkbeck Working Papers in Economics and Finance 0404, Birkbeck, Department of Economics, Mathematics & Statistics.
    4. Hu, Audrey & Offerman, Theo & Zou, Liang, 2011. "Premium auctions and risk preferences," Journal of Economic Theory, Elsevier, vol. 146(6), pages 2420-2439.
    5. Ronald M. Harstad, 2007. "Does a Seller Really Want Another Bidder?," Working Papers 0711, Department of Economics, University of Missouri.
    6. Drake, Samielle & Xu, Fei, 2023. "Regulation and Competition in Public Procurement," Umeå Economic Studies 1013, Umeå University, Department of Economics.
    7. Lewis, Tracy R. & Sappington, David E. M., 1995. "Using markets to allocate pollution permits and other scarce resource rights under limited information," Journal of Public Economics, Elsevier, vol. 57(3), pages 431-455, July.
    8. Sameer Mehta & Milind Dawande & Ganesh Janakiraman & Vijay Mookerjee, 2020. "Sustaining a Good Impression: Mechanisms for Selling Partitioned Impressions at Ad Exchanges," Information Systems Research, INFORMS, vol. 31(1), pages 126-147, March.
    9. José Alcalde & Matthias Dahm, "undated". "Supplier Diversity before the Time of Cholera," Discussion Papers in Economics 20/07, Division of Economics, School of Business, University of Leicester.
    10. Axel Ockenfels & David Reiley & Abdolkarim Sadrieh, 2006. "Online Auctions," NBER Working Papers 12785, National Bureau of Economic Research, Inc.
    11. W. Jason Choi & Amin Sayedi, 2019. "Learning in Online Advertising," Marketing Science, INFORMS, vol. 38(4), pages 584-608, July.
    12. Eric Bax, 2020. "Heavy Tails Make Happy Buyers," Papers 2002.09014, arXiv.org.
    13. Yonghong Long, 2009. "Bidders¡¯ Risk Preferences in Discriminative Auctions," Annals of Economics and Finance, Society for AEF, vol. 10(1), pages 215-223, May.
    14. Estrella Alonso & Joaquín Sánchez-Soriano & Juan Tejada, 2020. "Mixed Mechanisms for Auctioning Ranked Items," Mathematics, MDPI, vol. 8(12), pages 1-26, December.
    15. Maria-Florina Balcan & Siddharth Prasad & Tuomas Sandholm, 2023. "Bicriteria Multidimensional Mechanism Design with Side Information," Papers 2302.14234, arXiv.org, revised Jun 2023.
    16. Lawrence M. Ausubel & Peter Cramton & Marek Pycia & Marzena Rostek & Marek Weretka, 2014. "Demand Reduction and Inefficiency in Multi-Unit Auctions," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 81(4), pages 1366-1400.
    17. Mohammad Akbarpour & Shengwu Li, 2020. "Credible Auctions: A Trilemma," Econometrica, Econometric Society, vol. 88(2), pages 425-467, March.
    18. Hon-Snir, Shlomit & Monderer, Dov & Sela, Aner, 1998. "A Learning Approach to Auctions," Journal of Economic Theory, Elsevier, vol. 82(1), pages 65-88, September.
    19. 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.
    20. Sylvain Barde, 2015. "Back to the Future: Economic Self-Organisation and Maximum Entropy Prediction," Computational Economics, Springer;Society for Computational Economics, vol. 45(2), pages 337-358, February.

    More about this item

    Keywords

    Optimal auction design; Second price auction with reserve; Linear programming; Submodular functions; Implementation; Online advertising;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions

    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:eee:ecolet:v:141:y:2016:i:c:p:35-38. 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.