IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v92y2015icp370-400.html
   My bibliography  Save this article

Limitations of randomized mechanisms for combinatorial auctions

Author

Listed:
  • Dughmi, Shaddin
  • Vondrák, Jan

Abstract

We address the following fundamental question in the area of incentive-compatible mechanism design: Are truthful-in-expectation mechanisms compatible with polynomial-time approximation? In particular, can polynomial-time truthful-in-expectation mechanisms achieve a near-optimal approximation ratio for combinatorial auctions with submodular valuations?

Suggested Citation

  • Dughmi, Shaddin & Vondrák, Jan, 2015. "Limitations of randomized mechanisms for combinatorial auctions," Games and Economic Behavior, Elsevier, vol. 92(C), pages 370-400.
    • Handle: RePEc:eee:gamebe:v:92:y:2015:i:c:p:370-400
    DOI: 10.1016/j.geb.2014.01.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825614000098
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2014.01.007?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. Blumrosen, Liad & Nisan, Noam, 2010. "Informational limitations of ascending combinatorial auctions," Journal of Economic Theory, Elsevier, vol. 145(3), pages 1203-1223, May.
    2. Milgrom,Paul, 2004. "Putting Auction Theory to Work," Cambridge Books, Cambridge University Press, number 9780521536721, September.
    3. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Huang, Zhiyi & Kim, Anthony, 2019. "Welfare maximization with production costs: A primal dual approach," Games and Economic Behavior, Elsevier, vol. 118(C), pages 648-667.
    2. Tim Roughgarden & Inbal Talgam-Cohen, 2018. "Approximately Optimal Mechanism Design," Papers 1812.11896, arXiv.org, revised Aug 2020.
    3. Daskalakis, Constantinos & Syrgkanis, Vasilis, 2022. "Learning in auctions: Regret is hard, envy is easy," Games and Economic Behavior, Elsevier, vol. 134(C), pages 308-343.
    4. 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.

    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. Brunner, Christoph & Hu, Audrey & Oechssler, Jörg, 2014. "Premium auctions and risk preferences: An experimental study," Games and Economic Behavior, Elsevier, vol. 87(C), pages 467-484.
    2. Frank Kelly & Peter Key & Neil Walton, 2016. "Efficient Advert Assignment," Operations Research, INFORMS, vol. 64(4), pages 822-837, August.
    3. Yokote, Koji, 2021. "Consistency of the doctor-optimal equilibrium price vector in job-matching markets," Journal of Economic Theory, Elsevier, vol. 197(C).
    4. Robert Kleinberg & Bo Waggoner & E. Glen Weyl, 2016. "Descending Price Optimally Coordinates Search," Papers 1603.07682, arXiv.org, revised Dec 2016.
    5. Hu, Audrey & Offerman, Theo & Zou, Liang, 2011. "Premium auctions and risk preferences," Journal of Economic Theory, Elsevier, vol. 146(6), pages 2420-2439.
    6. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    7. 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.
    8. Hiroki Saitoh & Shigehiro Serizawa, 2008. "Vickrey allocation rule with income effect," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 35(2), pages 391-401, May.
    9. Azacis, Helmuts & Burguet, Roberto, 2008. "Incumbency and entry in license auctions: The Anglo-Dutch auction meets another simple alternative," International Journal of Industrial Organization, Elsevier, vol. 26(3), pages 730-745, May.
    10. Yutaka Suzuki, 2021. "Collusion, Shading, and Optimal Organization Design in a Three-tier Agency Model with a Continuum of Types," Annals of Economics and Finance, Society for AEF, vol. 22(2), pages 317-365, November.
    11. Korpela, Ville & Lombardi, Michele & Saulle, Riccardo D., 2024. "Designing rotation programs: Limits and possibilities," Games and Economic Behavior, Elsevier, vol. 143(C), pages 77-102.
    12. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    13. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    14. Daniel McFadden, 2009. "The human side of mechanism design: a tribute to Leo Hurwicz and Jean-Jacque Laffont," Review of Economic Design, Springer;Society for Economic Design, vol. 13(1), pages 77-100, April.
    15. Iván Marinovic, 2017. "Delegated Bidding and the Allocative Effect of Accounting Rules," Management Science, INFORMS, vol. 63(7), pages 2181-2196, July.
    16. Prokopovych, Pavlo & Yannelis, Nicholas C., 2017. "On strategic complementarities in discontinuous games with totally ordered strategies," Journal of Mathematical Economics, Elsevier, vol. 70(C), pages 147-153.
    17. Song, Yangwei, 2018. "Efficient Implementation with Interdependent Valuations and Maxmin Agents," Rationality and Competition Discussion Paper Series 92, CRC TRR 190 Rationality and Competition.
    18. Guanyi Wang, 2024. "Robust Network Targeting with Multiple Nash Equilibria," Papers 2410.20860, arXiv.org, revised Nov 2024.
    19. Jonathan Levin & Andrzej Skrzypacz, 2016. "Properties of the Combinatorial Clock Auction," American Economic Review, American Economic Association, vol. 106(9), pages 2528-2551, September.
    20. Bergemann, Dirk & Morris, Stephen & Takahashi, Satoru, 2017. "Interdependent preferences and strategic distinguishability," Journal of Economic Theory, Elsevier, vol. 168(C), pages 329-371.

    More about this item

    Keywords

    Algorithmic mechanism design; Combinatorial auctions; Incentive compatibility; Submodular valuations;
    All these keywords.

    JEL classification:

    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
    • 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:gamebe:v:92:y:2015:i:c:p:370-400. 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/inca/622836 .

    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.