Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework

References

• Adomavicius G, Gupta A (2005) Toward comprehensive real-time bidder support in iterative combinatorial auctions. Inform. Systems Res. 16(2):169–185.Link, Google Scholar
• Adomavicius G, Gupta A, Yang M (2019) Providing real-time bidder support in homogeneous item combinatorial auctions. MIS Quart. 43(3):721–743.Crossref, Google Scholar
• Adomavicius G, Curley SP, Gupta A, Sanyal P (2012) Effect of information feedback on bidder behavior in continuous combinatorial auctions. Management Sci. 58(4):811–830.Link, Google Scholar
• Adomavicius G, Curley SP, Gupta A, Sanyal P (2013a) Impact of information feedback in continuous combinatorial auctions: An experimental study of economic performance. MIS Quart. 37(1):55–76.Crossref, Google Scholar
• Adomavicius G, Curley SP, Gupta A, Sanyal P (2013b) User acceptance of complex electronic market mechanisms: Role of information feedback. J. Oper. Management 31(6):489–503.Crossref, Google Scholar
• Adomavicius G, Sanyal P, Gupta A. Curley S (2007). Design and effects of information feedback in continuous combinatorial auctions. Proc. Internat. Conf. Inform. Systems (ICIS), Montreal, Canada (Association for Information Systems (AIS)).Google Scholar
• Ausubel LM, Milgrom PR (2002) Ascending auctions with package bidding. Adv. Theoret. Econom. 1(1).Google Scholar
• Ausubel LM, Cramton PC, Milgrom P ( 2005) The clock- proxy auction: A practical combinatorial auction design. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions (MIT Press, Cambridge, MA), 120–140.Crossref, Google Scholar
• Banks JS, Ledyard JO, Porter DP (1989) Allocating uncertain and unresponsive resources: An experimental approach. RAND J. Econom. 20(1):1–25.Crossref, Google Scholar
• Bichler M, Hao Z, Adomavicius G (2017) Coalition-based pricing in ascending combinatorial auctions. Inform. Systems Res. 28(1):159–179.Link, Google Scholar
• Bichler M, Shabalin P, Pikovsky A (2009) A computational analysis of linear price iterative combinatorial auction formats. Inform. Systems Res. 20(1):33–59.Link, Google Scholar
• Bichler M, Davenport A, Hohner G, Kalagnanam J (2006) Industrial procurement auctions. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions (MIT Press, Cambridge, MA), 593–612.Google Scholar
• Brewer PJ, Plott CR (1996) A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks. Internat. J. Indust. Organ. 14(6):857–886.Crossref, Google Scholar
• Caplice C (2007) Electronic markets for truckload transportation. Production Oper. Management 16(4):423–436.Crossref, Google Scholar
• Cramton P (2013) Spectrum auction design. Rev. Indust. Organ. 42(2):161–190.Crossref, Google Scholar
• Cramton P, Shoham Y, Steinberg R (2006) Introduction to combinatorial auctions. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions (MIT Press, Cambridge, MA), 1–13.Google Scholar
• Day RW, Cramton P (2012) Quadratic core-selecting payment rules for combinatorial auctions. Oper. Res. 60(3):588–603.Link, Google Scholar
• de Vries S, Vohra RV (2003) Combinatorial auctions: A survey. INFORMS J. Comput. 15(3):284–309.Link, Google Scholar
• Goeree JK, Holt CA (2010) Hierarchical package bidding: A paper & pencil combinatorial auction. Games Econom. Behav. 70(1):146–169.Crossref, Google Scholar
• Gonen R, Lehmann D (2000) Optimal solutions for multi-unit combinatorial auctions: Branch and bound heuristics. Proc. 2nd ACM Conf. Electronic Commerce, Minneapolis (Association for Computing Machinery (ACM)), 13–20.Google Scholar
• Katok E, Roth AE (2004) Auctions of homogeneous goods with increasing returns: Experimental comparison of alternative “Dutch” auctions. Management Sci. 50(8):1044–1063.Link, Google Scholar
• Kim SW, Olivares M, Weintraub GY (2014) Measuring the performance of large-scale combinatorial auctions: A structural estimation approach. Management Sci. 60(5):1180–1201.Link, Google Scholar
• Kwasnica AM, Ledyard JO, Porter D, DeMartini C (2005) A new and improved design for multiobject iterative auctions. Management Sci. 51(3):419–434.Link, Google Scholar
• Leskela RL, Teich J, Wallenius H, Wallenius J (2007) Decision support for multi-unit combinatorial bundle auctions. Decision Support Systems 43(2):420–434.Crossref, Google Scholar
• Leyton-Brown K, Shoham Y, Tennenholtz M (2000) An algorithm for multi-unit combinatorial auctions. Proc. 17th Natl. Conf. Artificial Intelligence and 12th Conf. Innovative Appl. Artificial Intelligence, Austin, TX (American Association for Artificial Intelligence), 56–61.Google Scholar
• Moreno A, Terwiesch C (2014) Doing business with strangers: Reputation in online service marketplaces. Inform. Systems Res. 25(4):865–886.Link, Google Scholar
• Narahari Y, Dayama P (2005) Combinatorial auctions for electronic business. Sadhana 30(2–3):179–211.Crossref, Google Scholar
• Nisan N (2000) Bidding and allocation in combinatorial auctions. Proc. 2nd ACM Conf. Electronic Commerce, Minneapolis (Association for Computing Machinery (ACM)), 1–12.Google Scholar
• Nisan N (2006) Bidding languages. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions (MIT Press, Cambridge, MA), 400–420.Google Scholar
• Olivares M, Weintraub GY, Epstein R, Yung D (2012) Combinatorial auctions for procurement: An empirical study of the Chilean school meals auction. Management Sci. 58(8):1458–1481.Link, Google Scholar
• Parkes DC (1999) iBundle: An efficient ascending price bundle auction. Proc. 1st ACM Conf. Electronic Commerce, Denver, CO (Association for Computing Machinery (ACM)), 148–157.Google Scholar
• Pekec A, Rothkopf MH (2003) Combinatorial auction design. Management Sci. 49(11):1485–1503.Link, Google Scholar
• Petrakis I, Ziegler G, Bichler M (2013) Ascending combinatorial auctions with allocation constraints: On game theoretical and computational properties of generic pricing rules. Inform. Systems Res. 24(3):768–786.Link, Google Scholar
• Rassenti SJ, Smith VL, Bulfin RL (1982) A combinatorial auction mechanism for airport time slot allocation. Bell J. Econom. 13(2):402–417.Crossref, Google Scholar
• Rothkopf MH (2007) Thirteen reasons why the Vickrey-Clarke-Groves process is not practical. Oper. Res. 55(2):191–197.Link, Google Scholar
• Rothkopf MH, Pekec A, Harstad RM (1998) Computationally manageable combinatorial auctions. Management Sci. 44(8):1131–1147.Link, Google Scholar
• Sandholm T (1999) An algorithm for optimal winner determination in combinatorial auctions. Proc. 16th Internat. Joint Conf. Artificial Intelligence, Stockholm, Sweden (International Joint Conference on Artificial Intelligence), 542–547.Google Scholar
• Sandholm T (2002) eMediator: A next generation electronic commerce server. Computational Intelligence 18(4):656–676.Crossref, Google Scholar
• Sandholm T, Suri S (2003) BOB: Improved winner determination in combinatorial auctions and generalizations. Artificial Intelligence 145(1–2):33–58.Crossref, Google Scholar
• Sandholm T, Suri S, Gilpin A, Levine D (2002) Winner determination in combinatorial auction generalizations. Proc. 1st Internat. Joint Conf. Autonomous Agents Multiagent Systems: Part 1, Bologna, Italy (Association for Computing Machinery (ACM)), 69–76.Google Scholar
• Sandholm T, Suri S, Gilpin A, Levine D (2005) CABOB: A fast optimal algorithm for winner determination in combinatorial auctions. Management Sci. 51(3):374–390.Link, Google Scholar
• Scheffel T, Pikovsky A, Bichler M, Guler K (2011) An experimental comparison of linear and nonlinear price combinatorial auctions. Inform. Systems Res. 22(2):346–368.Link, Google Scholar
• Vazirani V (2003) Approximation Algorithms (Springer, Berlin).Crossref, Google Scholar
• Xia M, Stallaert J, Whinston AB (2005) Solving the combinatorial double auction problem. Eur. J. Oper. Res. 164(1):239–251.Crossref, Google Scholar