IDEAS home Printed from https://ideas.repec.org/a/bpj/bejtec/v10y2010i1n20.html
   My bibliography  Save this article

Position Auctions with Budgets: Existence and Uniqueness

Author

Listed:
  • Ashlagi Itai

    (Harvard Business School, Harvard University, itai.ashlagi@gmail.com)

  • Braverman Mark

    (Microsoft Research New England, mbraverm@cs.toronto.edu)

  • Hassidim Avinatan

    (MIT, avinatan@mit.edu)

  • Lavi Ron

    (Technion – Israel Institute of Technology, ronlavi@ie.technion.ac.il)

  • Tennenholtz Moshe

    (Microsoft Israel R&D Center and Technion – Israel Institute of Technology, moshet@ie.technion.ac.il)

Abstract

We design a Generalized Position Auction for players with private values and private budget constraints. Our mechanism is a careful modification of the Generalized English Auction of Edelman, Ostrovsky and Schwarz (2007). By enabling multiple price trajectories that ascent concurrently we are able to retrieve all the desired properties of the Generalized English Auction, that was not originally designed for players with budgets. In particular, the ex-post equilibrium outcome of our auction is Pareto-efficient and envy-free. Moreover, we show that any other position auction that satisfies these properties and does not make positive transfers must obtain in ex-post equilibrium the same outcome of our mechanism, for every tuple of distinct types. This uniqueness result holds even if the players' values are fixed and known to the seller, and only the budgets are private.

Suggested Citation

  • Ashlagi Itai & Braverman Mark & Hassidim Avinatan & Lavi Ron & Tennenholtz Moshe, 2010. "Position Auctions with Budgets: Existence and Uniqueness," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 10(1), pages 1-32, May.
  • Handle: RePEc:bpj:bejtec:v:10:y:2010:i:1:n:20
    DOI: 10.2202/1935-1704.1648
    as

    Download full text from publisher

    File URL: https://doi.org/10.2202/1935-1704.1648
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.

    File URL: https://libkey.io/10.2202/1935-1704.1648?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. Gerard van der Laan & Zaifu Yang, 2016. "An ascending multi-item auction with financially constrained bidders," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 109-149, December.
    2. 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.
    3. Dirk Bergemann & Stephen Morris, 2012. "Robust Mechanism Design," World Scientific Book Chapters, in: Robust Mechanism Design The Role of Private Information and Higher Order Beliefs, chapter 2, pages 49-96, World Scientific Publishing Co. Pte. Ltd..
    4. Jean-Pierre Benoît & Vijay Krishna, 2001. "Multiple-Object Auctions with Budget Constrained Bidders," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 68(1), pages 155-179.
    5. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    6. Krishna, Vijay, 2009. "Auction Theory," Elsevier Monographs, Elsevier, edition 2, number 9780123745071.
    7. Yeon-Koo Che & Ian Gale, 1998. "Standard Auctions with Financially Constrained Bidders," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 65(1), pages 1-21.
    8. Mallesh M. Pai & Rakesh Vohra, 2008. "Optimal Auctions with Financially Constrained Bidders," Discussion Papers 1471, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    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. Lavi, Ron & May, Marina, 2012. "A note on the incompatibility of strategy-proofness and Pareto-optimality in quasi-linear settings with public budgets," Economics Letters, Elsevier, vol. 115(1), pages 100-103.
    2. Bichler, Martin & Merting, Sören, 2018. "Truthfulness in advertising? Approximation mechanisms for knapsack bidders," European Journal of Operational Research, Elsevier, vol. 270(2), pages 775-783.
    3. 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.
    4. Kotowski, Maciej H., 2020. "First-price auctions with budget constraints," Theoretical Economics, Econometric Society, vol. 15(1), January.
    5. 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.
    6. Rica Gonen & Anat Lerner, 2013. "The Incompatibility of Pareto Optimality and Dominant-Strategy Incentive Compatibility in Sufficiently-Anonymous Budget-Constrained Quasilinear Settings," Games, MDPI, vol. 4(4), pages 1-21, November.
    7. Dobzinski, Shahar & Lavi, Ron & Nisan, Noam, 2012. "Multi-unit auctions with budget limits," Games and Economic Behavior, Elsevier, vol. 74(2), pages 486-503.
    8. 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.
    9. Anat Lerner & Rica Gonen, 2014. "Characterizing the Incentive Compatible and Pareto Optimal Efficiency Space for Two Players, k Items, Public Budget and Quasilinear Utilities," Games, MDPI, vol. 5(2), pages 1-19, April.
    10. Saeed Alaei & Kamal Jain & Azarakhsh Malekian, 2016. "Competitive Equilibria in Two-Sided Matching Markets with General Utility Functions," Operations Research, INFORMS, vol. 64(3), pages 638-645, June.
    11. Yan, Haomin, 2021. "Position auctions with multi-unit demands," Games and Economic Behavior, Elsevier, vol. 127(C), pages 179-193.
    12. Hafalir, Isa E. & Ravi, R. & Sayedi, Amin, 2012. "A near Pareto optimal auction with budget constraints," Games and Economic Behavior, Elsevier, vol. 74(2), pages 699-708.
    13. Mohammad Zia & Ram C. Rao, 2019. "Search Advertising: Budget Allocation Across Search Engines," Marketing Science, INFORMS, vol. 38(6), pages 1023-1037, November.

    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. A. Talman & Zaifu Yang, 2015. "An efficient multi-item dynamic auction with budget constrained bidders," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 769-784, August.
    2. Gerard van der Laan & Zaifu Yang, 2016. "An ascending multi-item auction with financially constrained bidders," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 109-149, December.
    3. Dobzinski, Shahar & Lavi, Ron & Nisan, Noam, 2012. "Multi-unit auctions with budget limits," Games and Economic Behavior, Elsevier, vol. 74(2), pages 486-503.
    4. P. Jean‐Jacques Herings & Yu Zhou, 2022. "Competitive Equilibria In Matching Models With Financial Constraints," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 63(2), pages 777-802, May.
    5. van der Laan, G. & Talman, Dolf & Yang, Z., 2018. "Equilibrium in the Assignment Market under Budget Constraints," Discussion Paper 2018-046, Tilburg University, Center for Economic Research.
    6. Shijie Lu & Yi Zhu & Anthony Dukes, 2015. "Position Auctions with Budget Constraints: Implications for Advertisers and Publishers," Marketing Science, INFORMS, vol. 34(6), pages 897-905, November.
    7. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    8. Mohammad Zia & Ram C. Rao, 2019. "Search Advertising: Budget Allocation Across Search Engines," Marketing Science, INFORMS, vol. 38(6), pages 1023-1037, November.
    9. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    10. Hafalir, Isa E. & Ravi, R. & Sayedi, Amin, 2012. "A near Pareto optimal auction with budget constraints," Games and Economic Behavior, Elsevier, vol. 74(2), pages 699-708.
    11. Carbajal, Juan Carlos & Mu'alem, Ahuva, 2020. "Selling mechanisms for a financially constrained buyer," Games and Economic Behavior, Elsevier, vol. 124(C), pages 386-405.
    12. Beker, Pablo F. & Hernando-Veciana, Ángel, 2015. "The dynamics of bidding markets with financial constraints," Journal of Economic Theory, Elsevier, vol. 155(C), pages 234-261.
    13. Zaifu Yang & Jingsheng Yu, 2018. "Efficient Ascending Menu Auctions with Budget Constrained Bidders," Discussion Papers 18/09, Department of Economics, University of York.
    14. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    15. Wei He & Jiangtao Li & Weijie Zhong, 2024. "Rank-Guaranteed Auctions," Papers 2408.12001, arXiv.org.
    16. Bobkova, Nina, 2020. "Asymmetric budget constraints in a first-price auction," Journal of Economic Theory, Elsevier, vol. 186(C).
    17. Vladimirov, Vladimir, 2015. "Financing bidders in takeover contests," Journal of Financial Economics, Elsevier, vol. 117(3), pages 534-557.
    18. Malueg, David A. & Orzach, Ram, 2009. "Revenue comparison in common-value auctions: Two examples," Economics Letters, Elsevier, vol. 105(2), pages 177-180, November.
    19. Brusco, Sandro & Lopomo, Giuseppe & Marx, Leslie M., 2009. "The [`]Google effect' in the FCC's 700Â MHz auction," Information Economics and Policy, Elsevier, vol. 21(2), pages 101-114, June.
    20. Youngwoo Koh, 2013. "Keyword auctions with budget-constrained bidders," Review of Economic Design, Springer;Society for Economic Design, vol. 17(4), pages 307-321, December.

    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:bpj:bejtec:v:10:y:2010:i:1:n:20. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.com .

    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.