Iterative Auction Design for Tree Valuations

References

• Abraham I, Babaioff M, Dughmi S, Roughgarden T (2012) Combinatorial auctions with restricted complements. Proc. 13th ACM Conf. Electronic Commerce (ACM, New York), 3–16.Crossref, Google Scholar
• Ausubel L (2004) An efficient ascending-bid auction for multiple objects. Amer. Econom. Rev. 94(5):1452–1475.Crossref, Google Scholar
• Ausubel L (2006) An efficient dynamic auction for heterogeneous commodities. Amer. Econom. Rev. 96(3):602–629.Crossref, Google Scholar
• Ausubel L, Cramton P, McAfee R, McMillan J (1997) Synergies in wireless telephony: Evidence from the broadband PCS auctions. J. Econom. Management Strategy 6(3):497–527.Crossref, Google Scholar
• Ausubel L, Milgrom P (2002) Ascending auctions with package bidding. The BE J. Theoret. Econom. 1(1):1–42.Google Scholar
• Baldwin E, Klemperer P (2014) Tropical geometry to analyse demand. Technical report, Working paper, Oxford University, Oxford.Google Scholar
• Bertsekas D (1996) Dynamic Programming and Optimal Control, Vols. 1 and 2 (Athena Scientific, Belmont, MA).Google Scholar
• Bertsekas D (1998) Network Optimization: Continuous and Discrete Models (Athena Scientific, Belmont, MA).Google Scholar
• Bertsimas D, Tsitsiklis J (1997) Introduction to Linear Optimization (Athena Scientific, Belmont, MA).Google Scholar
• Bikhchandani S, Mamer J (1997) Competitive equilibrium in an exchange economy with indivisibilities. J. Econom. Theory 74(2):385–413.Crossref, Google Scholar
• Bikhchandani S, Ostroy J (2002) The package assignment model. J. Econom. Theory 107(2):377–406.Crossref, Google Scholar
• Bikhchandani S, de Vries S, Schummer J, Vohra R (2002) Linear programming and Vickrey auctions. Dietrich B, Vohra R, eds. Mathematics of the Internet: E-Auction and Markets. (Springer, New York), 75–116.Crossref, Google Scholar
• Bikhchandani S, de Vries S, Schummer J, Vohra R (2011) An ascending Vickrey auction for selling bases of a matroid. Oper. Res. 59(2):400–413.Link, Google Scholar
• Blumrosen L, Nisan N (2010) On the computational power of demand queries. SIAM J. Comput. 39(4):1372–1391.Crossref, Google Scholar
• Candogan O (2013) Dynamic strategic interactions: Analysis and mechanism design. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
• Candogan O, Ozdaglar A, Parrilo PA (2014) Iterative auction design for graphical valuations part ii: General graphs. Working paper, University of Chicago, Chicago.Google Scholar
• Candogan O, Pekeč S (2014) Efficient iterative auctions for multi-featured items: A network flow approach. Working paper, University of Chicago, Chicago.Google Scholar
• Conitzer V, Sandholm T, Santi P (2005) Combinatorial auctions with k-wise dependent valuations. AAAI 5:248–254.Google Scholar
• Cramton P, Shoham Y, Steinberg R (2006) Combinatorial Auctions (MIT Press, Cambridge, MA).Google Scholar
• De Vries S, Schummer J, Vohra R (2007) On ascending Vickrey auctions for heterogeneous objects. J. Econom. Theory 132(1):95–118.Crossref, Google Scholar
• De Vries S, Vohra R (2003) Combinatorial auctions: A survey. INFORMS J. Comput. 15(3):284–309.Link, 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
• Hansen P, Simeone B (1986) Unimodular functions. Discrete Appl. Math. 14(3):269–281.Crossref, Google Scholar
• Kelso A, Crawford V (1982) Job matching, coalition formation, and gross substitutes. Econometrica: J. Econometric Soc. 1483–1504.Crossref, Google Scholar
• Lahaie S (2009) A kernel method for market clearing. Proc. 21st Internat. Joint Conf. Artifical Intelligence, IJCAI ’09 (Morgan Kaufmann, San Francisco), 208–213.Google Scholar
• Lahaie S (2011) A kernel-based iterative combinatorial auction. Proc. 25th AAAI Conf. Artificial Intelligence, AAAI ’11, (AAAI Press, Palo Alto, CA), 695–700..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
• Mas-Collel A, Whinston MD, Green J (1995) Microeconomic Theory (Oxford University Press, Oxford, UK).Google Scholar
• Mishra D, Parkes D (2007) Ascending price Vickrey auctions for general valuations. J. Econom. Theory 132(1):335–366.Crossref, Google Scholar
• Mishra D, Parkes D (2009) Multi-item Vickrey–Dutch auctions. Games Econom. Behav. 66(1):326–347.Crossref, Google Scholar
• Moreton P, Spiller P (1998) What’s in the air: Interlicense synergies in the federal communications commission’s broadband personal communication service spectrum auctions. J. Law Econom. 41(2):677–716.Crossref, 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
• Parkes D (1999) i-bundle: An efficient ascending price bundle auction. Proc. 1st ACM Conf. Electronic Commerce, EC’99 (ACM, New York), 148–157.Crossref, Google Scholar
• Parkes D (2006) Iterative combinatorial auctions. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions (MIT Press, Cambridge, MA), 41–77.Google Scholar
• Sandholm T, Boutilier C (2006) Preference elicitation in combinatorial auctions. Cramton P, Shoham Y, Steinberg R, eds. Combinatorial Auctions (MIT Press, Cambridge, MA), 233–263.Google Scholar
• Sun N, Yang Z (2006) Equilibria and indivisibilities: Gross substitutes and complements. Econometrica 74(5):1385–1402.Crossref, Google Scholar
• Sun N, Yang Z (2009) A double-track adjustment process for discrete markets with substitutes and complements. Econometrica 77(3):933–952.Crossref, Google Scholar
• Vohra RV (2011) Mechanism Design: A Linear Programming Approach (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Zhou H, Berry R, Honig M, Vohra R (2009) Complementarities in spectrum markets. 47th Ann. Allerton Conf. Comm., Control, and Comput., (IEEE, Piscataway, NJ), 499–506.Crossref, Google Scholar