Adaptive Pricing in Combinatorial Auctions

References

• Abernethy J, Lahaie S, Telgarsky M (2016) Rate of price discovery in iterative combinatorial auctions. Proc. 17th Conf. Econom. Comput., 809.Google Scholar
• Afriat SN (1967) The construction of utility functions from expenditure data. Internat. Econom. Rev. 8(1):67–77.Crossref, Google Scholar
• Andersson A, Tenhunen M, Ygge F (2000) Integer programming for combinatorial auction winner determination. Werner B, ed. Proc. 4th Internat. Conf. Multi-Agent Systems (IEEE, New York), 39–46.Google Scholar
• Ausubel LM (2006) An efficient dynamic auction for heterogeneous commodities. Amer. Econom. Rev. 96(3):602–629.Crossref, Google Scholar
• Ausubel LM, Baranov OV (2014) Market design and the evolution of the combinatorial clock auction. Amer. Econom. Rev. 104(5):446–451.Crossref, Google Scholar
• Ausubel LM, Baranov OV (2017) A practical guide to the Combinatorial Clock auction. Econom. J. 127:F334–F350.Google Scholar
• Ausubel LM, Baranov OV (2020) Revealed preference and activity rules in dynamic auctions. Internat. Econom. Rev. 61(2):471–502.Crossref, Google Scholar
• Ausubel LM, Cramton P (2010) Virtual power plant auctions. Utility Policy 18(4):201–208.Crossref, Google Scholar
• Ausubel LM, Milgrom PR (2002) Ascending auctions with package bidding. Frontiers Theoret. Econom. (The Berkeley Electronic Press, Berkeley, CA), 1–42.Google Scholar
• Ausubel LM, Cramton P, Milgrom P (2006) The clock-proxy auction: A practical combinatorial auction design. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions (MIT Press, Cambridge, MA), 115–138.Google Scholar
• Ausubel LM, Cramton P, McAfee RP, McMillan J (1997) Synergies in wireless telephony: Evidence from the broadband PCS auctions. J. Econom. Management Strategy 6(3):497–527.Crossref, Google Scholar
• Balas E, Ceria S, Cornuéjols G, Natraj N (1996) Gomory cuts revisited. Oper. Res. Lett. 19(1):1–9.Crossref, Google Scholar
• Baldwin E, Klemperer P (2019) Understanding preferences: “Demand types”, and the existence of equilibrium with indivisibilities. Econometrica 87(3):867–932.Crossref, Google Scholar
• Bertsimas D, Tsitsiklis JN (1997) Introduction to Linear Optimization, vol. 6 (Athena Scientific, Nashua, NH).Google Scholar
• Bichler M, Goeree JK (2017) Handbook of Spectrum Auction Design (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Bichler M, Fux V, Goeree JK (2019) Designing combinatorial exchanges for the reallocation of resource rights. Proc. Natl. Acad. Sci. USA 116(3):786–791.Crossref, 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, Shabalin P, Ziegler G (2013) Efficiency with linear prices? A game-theoretical and computational analysis of the combinatorial clock auction. Inform. Systems Res. 24(2):394–417.Link, Google Scholar
• Bikhchandani S, Ostroy JM (2002) The package assignment model. J. Econom. Theory 107(2):377–406.Crossref, Google Scholar
• Bikhchandani S, de Vries S, Schummer J, Vohra RV (2001) Linear programming and Vickrey auctions. IMA Volume Math. Appl. 127:75–116.Google Scholar
• Blum A, Jackson J, Sandholm T, Zinkevich M (2004) Preference elicitation and query learning. J. Machine Learn. Res. 5(Jun):649–667.Google Scholar
• Blumrosen L, Nisan N (2010) On the computational power of demand queries. SIAM J. Comput. 39(4):1372–1391.Crossref, Google Scholar
• Brero G, Lubin B, Seuken S (2017) Probably approximately efficient combinatorial auctions via machine learning. Proc. 31st AAAI Conf. Artificial Intelligence (AAAI Press, Washington, DC), 397–405.Google Scholar
• Brero G, Lubin B, Seuken S (2018) Combinatorial auctions via machine learning-based preference elicitation. Lang J, ed. Proc. 27th Joint Internat. Conf. Artificial Intelligence (AAAI Press, Washington, DC), 128–136.Google Scholar
• Candogan O, Ozdaglar A, Parrilo P (2018) Pricing equilibria and graphical valuations. ACM Trans. Econom. Comput. 6(1):2:1–2:26.Google Scholar
• Cramton P (2013) Spectrum auction design. Rev. Industrial Organ. 42(2):161–190.Crossref, Google Scholar
• Day R (2018) Linear prices in combinatorial auctions. Bichler M, ed. Proc. INFORMS Workshop Math. Optim. Market Design (INFORMS, Catonsville, MD).Google Scholar
• Day R, Milgrom P (2008) Core-selecting package auctions. Internat. J. Game Theory 36(3):393–407.Crossref, Google Scholar
• de Vries S, Vohra RV (2003) Combinatorial auctions: A survey. INFORMS J. Comput. 15(3):284–309.Link, Google Scholar
• de Vries S, Schummer J, Vohra RV (2007) On ascending Vickrey auctions for heterogeneous objects. J. Econom. Theory 132(1):95–118.Crossref, Google Scholar
• Goetzendorf A, Bichler M, Shabalin P, Day RW (2015) Compact bid languages and core pricing in large multi-item auctions. Management Sci. 61(7):1684–1703.Link, Google Scholar
• Gomory RE (1963) An algorithm for integer solutions to linear programs. Graves RL, Wolfe P, eds. Recent Advances in Mathematical Programming (McGraw-Hill, New York), 269–302.Google Scholar
• Gul F, Stacchetti E (1999) Walrasian equilibrium with gross substitutes. J. Econom. Theory 87(1):95–124.Crossref, Google Scholar
• Gul F, Stacchetti E (2000) The English auction with differentiated commodities. J. Econom. Theory 92(1):66–95.Crossref, Google Scholar
• Hohner G, Rich J, Ng E, Reid G, Davenport AJ, Kalagnanam JR, Lee HS, et al. (2003) Combinatorial and quantity-discount procurement auctions benefit Mars, Incorporated and its suppliers. INFORMS Interfaces 33(1):23–35.Link, Google Scholar
• Industry Canada (2015) Canadian 700MHz auction. Retrieved May 7, https://ised-isde.canada.ca/site/spectrum-management-telecommunications/en/spectrum-allocation/auctions/700-mhz-2014/final-results-700-mhz-auction-2014.Google Scholar
• Kelso AS, Crawford VP (1982) Job matching, coalition formation, and gross substitutes. Econometrica 50(6):1483–1504.Crossref, 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
• Lahaie S, Lubin B (2019) Adaptive-price combinatorial auctions. Immorlica N, Johari R, eds. Proc 20th Conf. Econom. Comp. (ACM, New York), 749–750.Google Scholar
• Lahaie S, Parkes DC (2004) Applying learning algorithms to preference elicitation. Feigenbaum J, Seltzer M, eds. Proc. 5th Conf. Electronic Comm. (ACM, New York), 180–188.Google Scholar
• Lahaie S, Parkes DC (2009) Fair package assignment. Das S, Ostrovsky M, Pennock D, Szymanksi B, eds. Proc. 1st Conf. Auctions Market Mechanisms Appl. (Springer Nature, London).Google Scholar
• Laurent M (2003) A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0–1 programming. Math. Oper. Res. 28(3):470–496.Link, Google Scholar
• Ledyard JO, Olson M, Porter D, Swanson JA, Torma DP (2002) The first use of a combined-value auction for transportation services. INFORMS Interfaces 32(5):4–12.Link, Google Scholar
• Lehmann B, Lehmann D, Nisan N (2006) Combinatorial auctions with decreasing marginal utilities. Games Econom. Behav. 55(2):270–296.Crossref, Google Scholar
• Leyton-Brown K, Milgrom P, Segal I (2017) Economics and computer science of a radio spectrum reallocation. Mason JM, Tygar D, eds. Proc. Natl. Acad. Sci. USA 114(28):7202–7209.Crossref, Google Scholar
• Leyton-Brown K, Pearson M, Shoham Y (2000) Toward a universal test suite for combinatorial auction algorithms. Mason JM, Tygar D, eds. Proc. 2nd Conf. Electronic Comm. (ACM, New York), 66–76.Google Scholar
• Milgrom P (2000) Putting auction theory to work: The simultaneous ascending auction. J. Political Econom. 108(2):245–272.Crossref, Google Scholar
• Mishra D, Parkes DC (2007) Ascending price Vickrey auctions for general valuations. J. Econom. Theory 132(1):335–366.Crossref, Google Scholar
• Nisan N (2000) Bidding and allocation in combinatorial auctions. Mason JM, Tygar D, eds. Proc. 2nd Conf. Electronic Comm. (ACM, New York), 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
• Nisan N, Segal I (2006) The communication requirements of efficient allocations and supporting prices. J. Econom. Theory 129(1):192–224.Crossref, Google Scholar
• Paes Leme R (2017) Gross substitutability: An algorithmic survey. Games Econom. Behav. 106:294–316.Crossref, Google Scholar
• Parkes DC (1999) iBundle: An efficient ascending price bundle auction. Feldman S, Wellman M, eds. Proc. 1st Conf. Electronic Comm. (ACM, New York), 148–157.Google Scholar
• Parkes DC (2006) Iterative combinatorial auctions. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions (MIT Press, Cambridge, MA), 96–149.Google Scholar
• Pikovsky A, Shabalin P, Bichler M (2006) Iterative combinatorial auctions with linear prices: Results of numerical experiments. Wu KL, ed. Proc. 8th IEEE Internat. Conf. Enterprise Comput. E-Commerce E-Services (IEEE Computer Society, Washington, DC), 39.Google Scholar
• Porter D, Rassenti S, Roopnarine A, Smith V (2003) Combinatorial auction design. Proc. Natl. Acad. Sci. USA 100(19):11153–11157.Crossref, Google Scholar
• Rothkopf MH, Teisberg TJ, Kahn EP (1990) Why are Vickrey auctions rare? J. Political Econom. 98(1):94–109.Crossref, Google Scholar
• Sandholm T (2006) Optimal winner determination algorithms. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions (MIT Press, Cambridge, MA), 337–368.Google Scholar
• Sandholm T (2013) Very-large-scale generalized combinatorial multi-attribute auctions: Lessons from conducting $60 billion of sourcing. Vulkan N, Roth AE, Neeman Z, eds. The Handbook of Market Design (Oxford University Press, Oxford, UK).Crossref, Google Scholar
• Scheffel T, Ziegler G, Bichler M (2012) On the impact of package selection in combinatorial auctions: An experimental study in the context of spectrum auction design. Experiment. Econom. 15(4):667–692.Crossref, 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
• Schneider S, Shabalin P, Bichler M (2010) On the robustness of non-linear personalized price combinatorial auctions. Eur. J. Oper. Res. 206(1):248–259.Crossref, Google Scholar
• Sherali HD, Adams WP (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3):411–430.Crossref, Google Scholar
• Varian HR (1992) Microeconomic Analysis (W. W. Norton & Company, New York).Google Scholar
• Walras L (1874) Éléments d’économie politique pure, ou, Théorie de la richesse sociale (L. Corbaz, Lausanne, Switzerland).Google Scholar
• Weissteiner J, Seuken S (2020) Deep learning-powered iterative combinatorial auctions. Conitzer V, Sha F, eds. Proc. 34th AAAI Conf. Artificial Intelligence (AAAI Press, Washington, DC), 2284–2293.Google Scholar
• Wolsey LA, Nemhauser GL (1999) Integer and Combinatorial Optimization, vol. 55 (John Wiley & Sons, Hoboken, NJ).Google Scholar