Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/3504035.3504181guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
research-article
Free access

MUDA: a truthful multi-unit double-auction mechanism

Published: 02 February 2018 Publication History

Abstract

In a seminal paper, McAfee (1992) presented a truthful mechanism for double auctions, attaining asymptotically-optimal gain-from-trade without any prior information on the valuations of the traders. McAfee's mechanism handles single-parametric agents, allowing each seller to sell a single unit and each buyer to buy a single unit. This paper presents a double-auction mechanism that handles multi-parametric agents and allows multiple units per trader, as long as the valuation functions of all traders have decreasing marginal returns. The mechanism is prior-free, ex-post individually-rational, dominant-strategy truthful and strongly-budget-balanced. Its gain-from-trade approaches the optimum when the market size is sufficiently large.

References

[1]
Babaioff, M., and Walsh, W. 2006. Incentive Compatible Supply Chain Auctions. In Multiagent based Supply Chain Management, volume 28. Springer. 315-350.
[2]
Babaioff, M.; Lucier, B.; Nisan, N.; and Paes Leme, R. 2014. On the efficiency of the walrasian mechanism. In Proc. EC '14, 783-800.
[3]
Babaioff, M.; Nisan, N.; and Pavlov, E. 2004. Mechanisms for a Spatially Distributed Market. In Proc. EC, 9-20.
[4]
Balcan, M.-F.; Devanur, N.; Hartline, J. D.; and Talwar, K. 2007. Random Sampling Auctions for Limited Supply. Technical report, Carnegie Mellon University.
[5]
Balcan, M.-F.; Blum, A.; Hartline, J. D.; and Mansour, Y. 2008. Reducing mechanism design to algorithm design via machine learning. J Comput. Sys. Sci. 74(8):1245-1270.
[6]
Baliga, S., and Vohra, R. 2003. Market Research and Market Design. Advances in Theoretical Economics 3(1).
[7]
Blumrosen, L., and Dobzinski, S. 2014. Reallocationx Mechanisms. In Proc. EC, 617. ACM.
[8]
Brustle, J.; Cai, Y.; Wu, F.; and Zhao, M. 2017. Approximating gains from trade in two-sided markets via simple mechanisms. In Proc. EC '17.
[9]
Chawla, S.; Hartline, J. D.; Malec, D. L.; and Sivan, B. 2010. Multi-parameter Mechanism Design and Sequential Posted Pricing. In Proc. STOC, 311-320.
[10]
Chu, L. Y., and Shen, Z.-J. M. 2006. Agent Competition Double-Auction Mechanism. Management Science 52(8):1215-1222.
[11]
Colini-Baldeschi, R.; de Keijzer, B.; Leonardi, S.; and Turchetta, S. 2016. Approximately Efficient Double Auctions with Strong Budget Balance. In Proc. SODA '16.
[12]
Colini-Baldeschi, R.; Goldberg, P. W.; de Keijzer, B.; Leonardi, S.; Roughgarden, T.; and Turchetta, S. 2017. Approximately efficient two-sided combinatorial auctions. In Proc. EC '17, 591-608.
[13]
Deshmukh, K.; Goldberg, A. V.; Hartline, J. D.; and Karlin, A. R. 2002. Truthful and Competitive Double Auctions. In Proc. ESA, volume 2461 of Lecture Notes in Computer Science. Springer. 361-373.
[14]
Devanur, N. R., and Hayes, T. P. 2009. The Adwords Problem: Online Keyword Matching with Budgeted Bidders Under Random Permutations. In Proc. EC, 71-78.
[15]
Devanur, N. R.; Hartline, J. D.; and Yan, Q. 2015. Envy freedom and prior-free mechanism design. JET 156:103-143.
[16]
Dütting, P.; Talgam-Cohen, I.; Roughgarden, T.; et al. 2017. Modularity and greed in double auctions. Games and Economic Behavior 105(C):59-83.
[17]
Feldman, M., and Gonen, R. 2016. Double-sided markets with strategic multi-dimensional players. arXiv preprint arXiv:1603.08717.
[18]
Godby, R. 1999. Market power in emission permit double auctions. Research in experimental economics 7:121-162.
[19]
Goel, G.; Leonardi, S.; Mirrokni, V.; Nikzad, A.; and Paes-Leme, R. 2016. Reservation exchange markets for internet advertising. In LIPIcs, volume 55.
[20]
Goldberg, A. V.; Hartline, J. D.; Karlin, A. R.; Saks, M.; and Wright, A. 2006. Competitive auctions. GEB 55:242-269.
[21]
Goldberg, A. V.; Hartline, J. D.; and Wright, A. 2001. Competitive Auctions and Digital Goods. In Proc. SODA '01.
[22]
Gonen, R., and Egri, O. 2017. Dycom: A dynamic truthful budget balanced double-sided combinatorial market. In Proc. AAMAS '17, 1556-1558.
[23]
Gonen, M.; Gonen, R.; and Pavlov, E. 2007. Generalized Trade Reduction Mechanisms. In Proc. EC, 20-29.
[24]
Gul, F., and Stacchetti, E. 2000. The English Auction with Differentiated Commodities. JET 92(1):66-95.
[25]
Hasbrouck, J. 1992. Using the torq database. New York Stock Exchange 11.
[26]
Hirai, H., and Sato, R. 2017. Polyhedral clinching auctions for two-sided markets. arXiv preprint arXiv:1708.04881.
[27]
Hsu, J.; Morgenstern, J.; Rogers, R.; Roth, A.; and Vohra, R. 2016. Do prices coordinate markets? SIGecom Exch. 15(1):84-88.
[28]
Huang, P.; Scheller-Wolf, A.; and Sycara, K. 2002. Design of a multi-unit double auction e-market. Computational Intelligence 18(4):596-617.
[29]
Kojima, F., and Yamashita, T. 2014. Double auction with interdependent values: Incentives and efficiency. Th.Econ.
[30]
Lee, C. M., and Radhakrishna, B. 2000. Inferring investor behavior: Evidence from torq data. Journal of Financial Markets 3(2):83-111.
[31]
Leyton-Brown, K.; Milgrom, P.; and Segal, I. 2017. Economics and computer science of a radio spectrum reallocation. Proceedings of the National Academy of Sciences 114(28):7202-7209.
[32]
Loertscher, S., and Mezzetti, C. 2016. Dominant strategy, double clock auctions with estimation-based tâtonnement. Technical report. https://sites.google.com/site/clamezzetti/work-papers.
[33]
McAfee, R. P. 1992. A dominant strategy double auction. JET 56(2):434-450.
[34]
Myerson, R. B., and Satterthwaite, M. A. 1983. Efficient mechanisms for bilateral trading. JET 29(2):265-281.
[35]
Nisan, N.; Roughgarden, T.; Tardos, E.; and Vazirani, V., eds. 2007. Algorithmic Game Theory. Cambridge University Press.
[36]
Plott, C. R., and Gray, P. 1990. The multiple unit double auction. Journal of Economic Behavior & Organization 13(2):245-258.
[37]
Rustichini, A.; Satterthwaite, M. A.; and Williams, S. R. 1994. Convergence to efficiency in a simple market with incomplete information. Econometrica 1041-1063.
[38]
Segal-Halevi, E., and Hassidim, A. 2017. Truthful Bilateral Trade is Impossible even with Fixed Prices. arXiv preprint.
[39]
Segal-Halevi, E.; Hassidim, A.; and Aumann, Y. 2016a. Mida: A multi item-type double-auction mechanism. arXiv preprint 1604.06210.
[40]
Segal-Halevi, E.; Hassidim, A.; and Aumann, Y. 2016b. Sbba: A strongly-budget-balanced double-auction mechanism. In Proc. SAGT '16, 260-272.
[41]
Sturm, B. 2008. Double auction experiments and their relevance for emissions trading. In Emissions Trading. Springer. 49-68.
[42]
Vickrey, W. 1961. Counterspeculation, Auctions, and Competitive Sealed Tenders. J Finance 16(1):8-37.
[43]
Wang, S.; Xu, P.; Xu, X.; Tang, S.; Li, X.; and Liu, X. 2010. TODA: Truthful Online Double Auction for Spectrum Allocationx in Wireless Networks. In New Frontiers in Dynamic Spectrum, 1-10. IEEE.
[44]
Xu, H.; Jin, J.; and Li, B. 2010. A Secondary Market for Spectrum. In Proc. INFOCOM, 1-5. IEEE.
[45]
Yao, E.; Lu, L.; and Jiang, W. 2011. An efficient truthful double spectrum auction design for dynamic spectrum access. In Proc. CROWNCOM, 181-185. IEEE.
[46]
Yoon, K. 2008. The participatory vickrey-clarke-groves mechanism. JME 44(3):324-336.

Index Terms

  1. MUDA: a truthful multi-unit double-auction mechanism
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image Guide Proceedings
      AAAI'18/IAAI'18/EAAI'18: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence
      February 2018
      8223 pages
      ISBN:978-1-57735-800-8

      Sponsors

      • Association for the Advancement of Artificial Intelligence

      Publisher

      AAAI Press

      Publication History

      Published: 02 February 2018

      Qualifiers

      • Research-article
      • Research
      • Refereed limited

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 109
        Total Downloads
      • Downloads (Last 12 months)97
      • Downloads (Last 6 weeks)9
      Reflects downloads up to 13 Jan 2025

      Other Metrics

      Citations

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media