Truthful Bundle/Multiunit Double Auctions

Published Online:https://doi.org/10.1287/mnsc.1090.1015

References

  • Babaioff M., Walsh W. Incentive-compatible, budget-balanced, yet highly efficient auctions for supply chain formation. Fourth ACM Conf. Electronic Commerce (2003) (ACM, New York) 64–75CrossrefGoogle Scholar
  • Babaioff M., Nisan N., Pavlov E. Mechanisms for a spatially distributed market. Fifth ACM Conf. Electronic Commerce (2004) (ACM, New York) 9–20CrossrefGoogle Scholar
  • Bapna R., Goes P., Gupta A., Karuga G. Optimal design of the online auction channel: Analytical, empirical and computational insights. Decision Sci. (2002) 33(4):557–577CrossrefGoogle Scholar
  • Bazaraa M. S., Jarvis J. J., Sherali H. D.Linear Programming and Network Flows (1990) 2nd ed.(John Wiley & Sons, New York) Google Scholar
  • Chu L. Y., Shen Z.-J. Agent competition double auction mechanism. Management Sci. (2006) 52(8):1215–1222LinkGoogle Scholar
  • Chu L. Y., Shen Z.-J. Trade reduction vs. multi-stage: A comparison of double-auction design approaches. Eur. J. Oper. Res. (2007) 180(2):677–691CrossrefGoogle Scholar
  • Chu L. Y., Shen Z.-J. Truthful double-auction mechanisms. Oper. Res. (2008) 56(1):102–120LinkGoogle Scholar
  • Clarke E. H. Multipart pricing of public goods. Public Choice (1971) 11:17–33CrossrefGoogle Scholar
  • de Vries S., Vohra R. V. Combinatorial auctions: A survey. INFORMS J. Comput. (2003) 15(3):284–309LinkGoogle Scholar
  • Elmaghraby W. The importance of ordering in sequential auctions. Management Sci. (2003) 49(5):673–682LinkGoogle Scholar
  • Fan M., Stallaert J., Whinston A. B. Decentralized mechanism design for supply chain organizations using an auction market. Inform. Systems Res. (2003) 14(1):1–22LinkGoogle Scholar
  • Gallien J., Wein L. M. A smart market for industrial procurement with capacity constraints. Management Sci. (2005) 51(1):76–91LinkGoogle Scholar
  • Gonen M., Gonen R., Pavlov E. Generalized trade reduction mechanisms. Eighth ACM Conf. Electronic Commerce (2007) (ACM, New York) 20–29CrossrefGoogle Scholar
  • Groves T. Incentives in teams. Econometrica (1973) 41(4):617–631CrossrefGoogle Scholar
  • Guo Z., Koehler G. J., Whinston A. B. A market-based optimization algorithm for distributed systems. Management Sci. (2007) 53(8):1345–1358LinkGoogle Scholar
  • Huang P., Scheller-Wolf A., Sycara K. Design of a multi-unit double-auction e-market. Comput. Intelligence (2002) 18(4):596–617CrossrefGoogle Scholar
  • Jain R., Varaiya P. The combinatorial seller's bid double-auction: An asymptotically efficient market mechanism. J. Econom. Theory (2006) . Working paper, IBM Watson Research, Hawthorne, New YorkGoogle Scholar
  • Jennergren L. P., Muller W. Simulation experiments of resource-allocation decisions in two-level organizations. Soc. Sci. Res. (1973) 2:333–352CrossrefGoogle Scholar
  • Ledyard J. O. Optimal combinatoric auctions with single-minded bidders. Eighth ACM Conf. Electronic Commerce (2007) (ACM, New York) 237–242CrossrefGoogle Scholar
  • Lehmann D., O'Callaghan I., Shoham Y. Truth revelation in approximately efficient combinatorial auctions. J. ACM (2002) 49(5):577–602CrossrefGoogle Scholar
  • McAfee R. P. A dominant strategy double auction. J. Econom. Theory (1992) 56(2):434–450CrossrefGoogle Scholar
  • Myerson R. B., Satterthwaite M. A. Efficient mechanisms for bilateral trading. J. Econom. Theory (1983) 28:265–281CrossrefGoogle Scholar
  • Pekeč A., Rothkopf M. H. Combinatorial auction design. Management Sci. (2003) 49(11):1485–1503LinkGoogle Scholar
  • Pinker E. J., Seidmann A., Vakrat Y. The design of online auctions: Business issues and current research. Management Sci. (2003) 49(11):1457–1484LinkGoogle Scholar
  • Rothkopf M. H., Harstad R. M. Modeling competitive bidding: A critical essay. Management Sci. (1994) 40(3):364–384LinkGoogle Scholar
  • Vickrey W. Counterspeculation, auctions, and competitive sealed tenders. J. Finance (1961) 16(1):8–37CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.