IDEAS home Printed from https://ideas.repec.org/a/spr/reecde/v21y2017i1d10.1007_s10058-016-0188-y.html
   My bibliography  Save this article

Mechanisms for combinatorial auctions with budget constraints

Author

Listed:
  • Phuong Le

    (Stanford University)

Abstract

This paper studies combinatorial auctions with budget-constrained bidders from a mechanism design perspective. I search for mechanisms that are incentive compatible, individually rational, symmetric, non-wasteful and non-bossy. First focusing on the greedy domain, in which any increase in a bidder’s valuation always exceeds his budget, I derive the unique mechanism, called the Iterative Second Price Auction. For the general domain, however, no such mechanism exists.

Suggested Citation

  • Phuong Le, 2017. "Mechanisms for combinatorial auctions with budget constraints," Review of Economic Design, Springer;Society for Economic Design, vol. 21(1), pages 1-31, March.
    • Handle: RePEc:spr:reecde:v:21:y:2017:i:1:d:10.1007_s10058-016-0188-y
    DOI: 10.1007/s10058-016-0188-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10058-016-0188-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10058-016-0188-y?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. 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. Che, Yeon-Koo & Gale, Ian, 2000. "The Optimal Mechanism for Selling to a Budget-Constrained Buyer," Journal of Economic Theory, Elsevier, vol. 92(2), pages 198-233, June.
    3. Robert Day & Paul Milgrom, 2008. "Core-selecting package auctions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 393-407, March.
    4. Mark A. Satterthwaite & Hugo Sonnenschein, 1981. "Strategy-Proof Allocation Mechanisms at Differentiable Points," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 48(4), pages 587-597.
    5. Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
    6. Laffont, Jean-Jacques & Robert, Jacques, 1996. "Optimal auction with financially constrained buyers," Economics Letters, Elsevier, vol. 52(2), pages 181-186, August.
    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. Jeremy Bulow & Jonathan Levin & Paul Milgrom, 2009. "Winning Play in Spectrum Auctions," Discussion Papers 08-023, Stanford Institute for Economic Policy Research.
    9. Paul Milgrom, 2000. "Putting Auction Theory to Work: The Simultaneous Ascending Auction," Journal of Political Economy, University of Chicago Press, vol. 108(2), pages 245-272, April.
    10. Dughmi, Shaddin & Vondrák, Jan, 2015. "Limitations of randomized mechanisms for combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 92(C), pages 370-400.
    11. Che, Yeon-Koo & Gale, Ian, 1996. "Expected revenue of all-pay auctions and first-price sealed-bid auctions with budget constraints," Economics Letters, Elsevier, vol. 50(3), pages 373-379, March.
    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.
    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. Yuya Wakabayashi & Ryosuke Sakai & Hiroki Shinozaki, 2024. "Strategy-proof allocation problem with hard budget constraints and income effects: weak efficiency and fairness," OSIPP Discussion Paper 24E003, Osaka School of International Public Policy, Osaka University.
    2. Jianxin Yi, 2024. "A note on the impossibility of multi-unit auctions with budget-constrained bidders," Review of Economic Design, Springer;Society for Economic Design, vol. 28(2), pages 331-345, June.

    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. Le, Phuong, 2018. "Pareto optimal budgeted combinatorial auctions," Theoretical Economics, Econometric Society, vol. 13(2), May.
    2. Le, Phuong, 2015. "Mechanisms for Combinatorial Auctions with Budget Constraints," MPRA Paper 66292, University Library of Munich, Germany.
    3. Le, Phuong, 2014. "Modified VCG Mechanisms in Combinatorial Auctions with Budget Constraints," MPRA Paper 66384, University Library of Munich, Germany.
    4. Boulatov, Alexei & Severinov, Sergei, 2021. "Optimal and efficient mechanisms with asymmetrically budget constrained buyers," Games and Economic Behavior, Elsevier, vol. 127(C), pages 155-178.
    5. Burkett, Justin, 2016. "Optimally constraining a bidder using a simple budget," Theoretical Economics, Econometric Society, vol. 11(1), January.
    6. Burkett, Justin, 2015. "Endogenous budget constraints in auctions," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 1-20.
    7. 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.
    8. Zaifu Yang & Jingsheng Yu, 2018. "Efficient Ascending Menu Auctions with Budget Constrained Bidders," Discussion Papers 18/09, Department of Economics, University of York.
    9. 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.
    10. 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.
    11. Baisa, Brian, 2017. "Auction design without quasilinear preferences," Theoretical Economics, Econometric Society, vol. 12(1), January.
    12. Jianxin Rong & Ning Sun & Dazhong Wang, 2019. "A New Evaluation Criterion for Allocation Mechanisms with Application to Vehicle License Allocations in China," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 4(1), pages 39-86, November.
    13. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    14. Hummel, Patrick, 2017. "Endogenous budget constraints," Mathematical Social Sciences, Elsevier, vol. 88(C), pages 11-15.
    15. 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.
    16. SHINOZAKI, Hiroki, 2024. "Shill-proof rules in object allocation problems with money," Discussion paper series HIAS-E-137, Hitotsubashi Institute for Advanced Study, Hitotsubashi University.
    17. 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.
    18. Ghosh, Gagan & Liu, Heng, 2019. "Sequential second-price auctions with private budgets," Games and Economic Behavior, Elsevier, vol. 113(C), pages 611-632.
    19. Paul Dütting & Vasilis Gkatzelis & Tim Roughgarden, 2017. "The Performance of Deferred-Acceptance Auctions," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 897-914, November.
    20. Kotowski, Maciej H., 2020. "First-price auctions with budget constraints," Theoretical Economics, Econometric Society, vol. 15(1), January.

    More about this item

    Keywords

    Combinatorial auctions; Budget constraints; Mechanisms;
    All these keywords.

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    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:spr:reecde:v:21:y:2017:i:1:d:10.1007_s10058-016-0188-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.