IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i1p259-285.html

Polyhedral Clinching Auctions for Two-Sided Markets

Author

Listed:
  • Hiroshi Hirai

    (Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo, Tokyo 113-8656, Japan)

  • Ryosuke Sato

    (Department of Mathematical Informatics, Graduate School of Information Science and Technology, The University of Tokyo, Tokyo 113-8656, Japan)

Abstract

In this paper, we present a new model and mechanisms for auctions in two-sided markets of buyers and sellers, where budget constraints are imposed on buyers. Our model incorporates polymatroidal environments and is applicable to a variety of models that include multiunit auctions, matching markets, and reservation exchange markets. Our mechanisms are built on the polymatroidal network flow model by Lawler and Martel. Additionally, they feature nice properties such as the incentive compatibility of buyers, individual rationality, Pareto optimality, and strong budget balance. The first mechanism is a two-sided generalization of the polyhedral clinching auction by Goel et al. for one-sided markets. The second mechanism is a reduce-to-recover algorithm that reduces the market to be one-sided, applies the polyhedral clinching auction by Goel et al., and lifts the resulting allocation to the original two-sided market via the polymatroidal network flow. Both mechanisms are implemented by polymatroid algorithms. We demonstrate how our framework is applied to the Internet display advertisement auctions.

Suggested Citation

  • Hiroshi Hirai & Ryosuke Sato, 2022. "Polyhedral Clinching Auctions for Two-Sided Markets," Mathematics of Operations Research, INFORMS, vol. 47(1), pages 259-285, February.
    • Handle: RePEc:inm:ormoor:v:47:y:2022:i:1:p:259-285
    DOI: 10.1287/moor.2021.1124
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1124
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2021.1124?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
    ---><---

    References listed on IDEAS

    as
    1. McAfee, R. Preston, 1992. "A dominant strategy double auction," Journal of Economic Theory, Elsevier, vol. 56(2), pages 434-450, April.
    2. 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.
    3. Elena Grigorieva & P. Herings & Rudolf Müller & Dries Vermeulen, 2007. "The private value single item bisection auction," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 30(1), pages 107-118, January.
    4. Myerson, Roger B. & Satterthwaite, Mark A., 1983. "Efficient mechanisms for bilateral trading," Journal of Economic Theory, Elsevier, vol. 29(2), pages 265-281, April.
    5. Dütting, Paul & Talgam-Cohen, Inbal & Roughgarden, Tim, 2017. "Modularity and greed in double auctions," Games and Economic Behavior, Elsevier, vol. 105(C), pages 59-83.
    6. Sushil Bikhchandani & Sven de Vries & James Schummer & Rakesh V. Vohra, 2011. "An Ascending Vickrey Auction for Selling Bases of a Matroid," Operations Research, INFORMS, vol. 59(2), pages 400-413, April.
    7. Goel, Gagan & Mirrokni, Vahab & Paes Leme, Renato, 2020. "Clinching auctions with online supply," Games and Economic Behavior, Elsevier, vol. 123(C), pages 342-358.
    8. Dobzinski, Shahar & Lavi, Ron & Nisan, Noam, 2012. "Multi-unit auctions with budget limits," Games and Economic Behavior, Elsevier, vol. 74(2), pages 486-503.
    9. Dütting, Paul & Talgam-Cohen, Inbal & Roughgarden, Tim, 2017. "Modularity and greed in double auctions," LSE Research Online Documents on Economics 83199, London School of Economics and Political Science, LSE Library.
    Full references (including those not matched with items on IDEAS)

    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. Loertscher, Simon & Mezzetti, Claudio, 2021. "A dominant strategy, double clock auction with estimation-based tatonnement," Theoretical Economics, Econometric Society, vol. 16(3), July.
    2. Loertscher, Simon & Marx, Leslie M., 2020. "Asymptotically optimal prior-free clock auctions," Journal of Economic Theory, Elsevier, vol. 187(C).
    3. Tafreshian, Amirmahdi & Masoud, Neda, 2022. "A truthful subsidy scheme for a peer-to-peer ridesharing market with incomplete information," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 130-161.
    4. Dütting, Paul & Talgam-Cohen, Inbal & Roughgarden, Tim, 2017. "Modularity and greed in double auctions," LSE Research Online Documents on Economics 83199, London School of Economics and Political Science, LSE Library.
    5. Loertscher, Simon & Marx, Leslie M., 2020. "A dominant-strategy asset market mechanism," Games and Economic Behavior, Elsevier, vol. 120(C), pages 1-15.
    6. Zhiling Guo & Gary J. Koehler & Andrew B. Whinston, 2012. "A Computational Analysis of Bundle Trading Markets Design for Distributed Resource Allocation," Information Systems Research, INFORMS, vol. 23(3-part-1), pages 823-843, September.
    7. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    8. Dütting, Paul & Talgam-Cohen, Inbal & Roughgarden, Tim, 2017. "Modularity and greed in double auctions," Games and Economic Behavior, Elsevier, vol. 105(C), pages 59-83.
    9. Yu, Hao & Huang, Min & Song, Yang & Wang, Xingwei & Yue, Xiaohang, 2025. "Making the most of your private parking slot: Strategy-proof double auctions-enabled staggered sharing schemes," Transportation Research Part B: Methodological, Elsevier, vol. 191(C).
    10. Scott Fay & Robert Zeithammer, 2017. "Bidding for Bidders? How the Format for Soliciting Supplier Participation in NYOP Auctions Impacts Channel Profit," Management Science, INFORMS, vol. 63(12), pages 4324-4344, December.
    11. Le, Phuong, 2018. "Pareto optimal budgeted combinatorial auctions," Theoretical Economics, Econometric Society, vol. 13(2), May.
    12. Robert Kleinberg & Bo Waggoner & E. Glen Weyl, 2016. "Descending Price Optimally Coordinates Search," Papers 1603.07682, arXiv.org, revised Dec 2016.
    13. Kiho Yoon, 2021. "Robust double auction mechanisms," Papers 2102.00669, arXiv.org, revised May 2022.
    14. Satterthwaite, Mark A. & Williams, Steven R. & Zachariadis, Konstantinos E., 2014. "Optimality versus practicality in market design: A comparison of two double auctions," Games and Economic Behavior, Elsevier, vol. 86(C), pages 248-263.
    15. Jesse A. Schwartz & Quan Wen, 2008. "A Revelation Principle for Dominant Strategy Implementation," Vanderbilt University Department of Economics Working Papers 0819, Vanderbilt University Department of Economics.
    16. Soumendu Sarkar, 2022. "Optimal mechanism for land acquisition," Review of Economic Design, Springer;Society for Economic Design, vol. 26(1), pages 87-116, March.
    17. Kong, Xiang T.R. & Kang, Kai & Zhong, Ray Y. & Luo, Hao & Xu, Su Xiu, 2021. "Cyber physical system-enabled on-demand logistics trading," International Journal of Production Economics, Elsevier, vol. 233(C).
    18. Cheng, Meng & Xu, Su Xiu & Huang, George Q., 2016. "Truthful multi-unit multi-attribute double auctions for perishable supply chain trading," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 21-37.
    19. Yoon, Kiho, 2008. "The participatory Vickrey-Clarke-Groves mechanism," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 324-336, February.
    20. Ryuji Sano, 2021. "Dynamic communication mechanism design," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(1), pages 163-180, July.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    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:inm:ormoor:v:47:y:2022:i:1:p:259-285. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.