Automated Design of Revenue-Maximizing Combinatorial Auctions

References

• Adams WJ, Yellen JL (1976) Commodity bundling and the burden of monopoly. Quart. J. Econom. 90(3):475–498.Crossref, Google Scholar
• Armstrong M (2000) Optimal multi-object auctions. Rev. Econom. Stud. 67:455–481.Crossref, Google Scholar
• Avery C, Hendershott T (2000) Bundling and optimal auctions of multiple products. Rev. Econom. Stud. 67:483–497.Crossref, Google Scholar
• Bakos Y, Brynjolfsson E (1999) Bundling information goods: Pricing, profits, and efficiency. Management Sci. 45(12):1613–1630.Link, Google Scholar
• Balcan MF, Blum A, Mansour Y (2008b) Item pricing for revenue maximization. Proc. ACM Conf. Electronic Commerce (ACM-EC), Chicago, IL (ACM, New York), 50–59.Crossref, Google Scholar
• Balcan MF, Blum A, Hartline J, Mansour Y (2008a) Reducing mechanism design to algorithm design via machine learning. J. Comput. System Sci. 74:78–89.Crossref, Google Scholar
• Bartal Y, Gonen R, Nisan N (2003) Incentive compatible multi-unit combinatorial auctions. Theoretical Aspects of Rationality and Knowledge (TARK) (Bloomington, IN).Crossref, Google Scholar
• Benisch M, Sandholm T (2011) A framework for automated bundling and pricing using purchase data. Proc. Conf. Auctions, Market Mechanisms and Their Appl., AMMA ’11 (Springer, Berlin), 40–52.Google Scholar
• Chawla S, Hartline J, Kleinberg R (2007) Algorithmic pricing via virtual valuations. Proc. ACM Conf. Electronic Commerce, EC ’07 (ACM, New York), 243–251.Crossref, Google Scholar
• Clarke EH (1971) Multipart pricing of public goods. Public Choice 11:17–33.Crossref, Google Scholar
• Conitzer V, Sandholm T (2002) Complexity of mechanism design. Proc. 18th Annual Conf. Uncertainty in Artificial Intelligence, UAI ’02 (Morgan Kaufmann, San Francisco), 103–110.Google Scholar
• Conitzer V, Sandholm T (2003) Applications of automated mechanism design. UAI-03 Workshop on Bayesian Modeling Appl., Acapulco, Mexico.Google Scholar
• Conitzer V, Sandholm T (2004) Self-interested automated mechanism design and implications for optimal combinatorial auctions. Proc. ACM Conf. Electronic Commerce, ACM-EC ’04 (ACM, New York), 132–141.Crossref, Google Scholar
• Conitzer V, Sandholm T (2006) Failures of the VCG mechanism in combinatorial auctions and exchanges. Internat. Conf. Autonomous Agents and Multi-Agent Systems, AAMAS ’06 (ACM, New York), 521–528.Crossref, Google Scholar
• Cramton P, Shoham Y, Steinberg R (2006) Combinatorial Auctions (MIT Press, Boston).Google Scholar
• Goldberg A, Hartline J, Wright A (2001) Competitive auctions and digital goods. Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ’01 (ACM, New York), 735–744.Google Scholar
• Groves T (1973) Incentives in teams. Econometrica 41:617–631.Crossref, Google Scholar
• Guruswami V, Hartline J, Karlin A, Kempe D, Kenyon C, McSherry F (2005) On profit-maximizing envy-free pricing. Annual ACM-SIAM Sympos. Discrete Algorithms, SODA ’05 (SIAM, Philadelphia), 1164–1173.Google Scholar
• Hartline J, Karlin A (2007) Profit maximization in mechanism design. Algorithmic Game Theory, Chapter 13 (Cambridge University Press, Cambridge, UK), 331–362.Crossref, Google Scholar
• Hartline J, Roughgarden T (2008) Optimal mechanism design and money burning. Proc. Annual Sympos. Theory of Comput., STOC ’08 (ACM, New York), 75–84.Crossref, Google Scholar
• Hitt LM, Chen P (2005) Bundling with customer self-selection: A simple approach to bundling low-marginal-cost goods. Management Sci. 51(10):1481–1493.Link, Google Scholar
• Jehiel P, Meyer-Ter-Vehn M, Moldovanu B (2007) Mixed bundling auctions. J. Econom. Theory 127(1):494–512.Crossref, Google Scholar
• Krishna V (2002) Auction Theory (Academic Press, San Diego).Google Scholar
• Kroer C, Sandholm T (2015) Computational bundling for auctions. Internat. Conf. Autonomous Agents and Multi-Agent Systems, AAMAS ’15 (IFAAMAS, Richland County, SC), 317–326. Extended version: Carnegie Mellon University, Computer Science Department technical report CMU-CS-13-111, 2013.Google Scholar
• Lavi R, Mu’alem A, Nisan N (2003) Towards a characterization of truthful combinatorial auctions. Proc. Annual Sympos. Foundations of Comput. Sci., FOCS ’03 (IEEE Computer Society, Washington, DC), 574–583.Crossref, Google Scholar
• Ledyard JO (2007) Optimal combinatoric auctions with single-minded bidders. Proc. ACM Conf. Electronic Commerce, ACM-EC ’07 (ACM, New York), 237–242.Crossref, Google Scholar
• Lehmann D, O’Callaghan LI, Shoham Y (2002) Truth revelation in rapid, approximately efficient combinatorial auctions. J. ACM 49(5):577–602.Crossref, Google Scholar
• Levin J (1997) An optimal auction for complements. Games Econom. Behav. 18:176–192.Crossref, Google Scholar
• Likhodedov A, Sandholm T (2004) Methods for boosting revenue in combinatorial auctions. Proc. National Conf. Artificial Intelligence, AAAI ’04 (AAAI Press, Palo Alto, CA), 232–237.Google Scholar
• Likhodedov A, Sandholm T (2005) Approximating revenue-maximizing combinatorial auctions. Proc. National Conf. Artificial Intelligence, AAAI ’05 (AAAI Press, Palo Alto, CA), 267–274.Google Scholar
• Maskin E, Riley J (1989) Optimal multi-unit auctions. Hahn F, ed. The Economics of Missing Markets, Information, and Games, Chapter 14 (Clarendon Press, Oxford, UK), 312–335.Google Scholar
• McAfee RP, McMillan J, Whinston MD (1989) Multiproduct monopoly, commodity bundling, and correlation of values. Quart. J. Econom. 104(2):371–383.Crossref, Google Scholar
• Micali S, Valiant P (2008) Revenue in truly combinatorial auctions and adversarial mechanism design. Technical report, MIT, MIT-CSAIL-TR-2008-039, June 26.Google Scholar
• Mitchell T (1997) Machine Learning (McGraw-Hill, New York).Google Scholar
• Monderer D, Tennenholtz M (2005) Asymptotically optimal multi-object auctions. Mimeo.Google Scholar
• Mu’alem A, Nisan N (2002) Truthful approximate mechanisms for restricted combinatorial auctions. Proc. National Conf. Artificial Intelligence, AAAI ’02 (AAAI Press, Palo Alto, CA), 379–384.Google Scholar
• Myerson R (1981) Optimal auction design. Math. Oper. Res. 6:58–73.Link, Google Scholar
• Myerson R, Satterthwaite M (1983) Efficient mechanisms for bilateral trading. J. Econom. Theory 28:265–281.Crossref, Google Scholar
• Palfrey T (1983) Bundling decisions by a multiproduct monopolist with incomplete information. Econometrica 51:463–484.Crossref, Google Scholar
• Roberts K (1979) The characterization of implementable social choice rules. Laffont J-J, ed. Aggregation and Revelation of Preferences (North-Holland, Amsterdam), 312–348.Google Scholar
• Rothkopf M, Pekeč A, Harstad R (1998) Computationally manageable combinatorial auctions. Management Sci. 44(8):1131–1147.Link, Google Scholar
• Sandholm T (2002) Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135:1–54.Crossref, Google Scholar
• Sandholm T (2006) Optimal winner determination algorithms. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions, Chapter 14 (MIT Press, Cambridge, MA), 337–368.Google Scholar
• Sandholm T (2007) Expressive commerce and its application to sourcing: How we conducted $35 billion of generalized combinatorial auctions. AI Magazine 28(3):45–58.Google Scholar
• Sandholm T (2013) Very-large-scale generalized combinatorial multi-attribute auctions: Lessons from conducting $60 billion of sourcing. Neeman Z, Roth A, Vulkan N, eds. Handbook of Market Design (Oxford University Press, Oxford, UK), 379–412.Crossref, Google Scholar
• Stoer J, Bulirsch R (1980) Introduction to Numerical Analysis (Springer, New York).Crossref, Google Scholar
• Tang P, Sandholm T (2012) Mixed-bundling auctions with reserve prices. Internat. Conf. Autonomous Agents and Multi-Agent Systems, AAMAS ’12, (ACM, New York), 729–736.Google Scholar
• Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16:8–37.Crossref, Google Scholar
• Vohra R (2001) Research problems in combinatorial auctions. Mimeo, version Oct. 29.Google Scholar
• Wu S, Hitt LM, Chen P, Anandalingam G (2008) Customized bundle pricing for information goods: A nonlinear mixed-integer programming approach. Management Sci. 54(3):608–622.Link, Google Scholar