Prior-Independent Optimal Auctions

References

• Araman VF, Caldentey RA (2009) Dynamic pricing for non-perishable products with demand learning. Oper. Res. 57(5):1169–1188.Google Scholar
• Azar P, Micali S (2012) Optimal parametric auctions. CSAIL Technical Report MIT-CSAIL-TR-2012-015, Massachusetts Institute of Technology, Cambridge.Crossref, Google Scholar
• Azar P, Daskalakis C, Micali S, Weinberg SM (2013) Optimal and efficient parametric auctions. Khanna S, ed. Proc. 24th Annual ACM-SIAM Sympos. Discrete Algorithms (ACM, New York), 596–604.Google Scholar
• Bandi C, Bertsimas D (2014) Optimal design for multi-item auctions: A robust optimization approach. Math. Oper. Res. 39(4):1012–1038.Crossref, Google Scholar
• Barlow RE, Proschan F (1975) Statistical theory of reliability and life testing: Probability models. Technical report, Florida State University, Tallahassee.Crossref, Google Scholar
• Bergemann D, Morris S (2013) An introduction to robust mechanism design. Foundations Trends Microeconom. 8(3):169–230.Crossref, Google Scholar
• Bergemann D, Schlag KH (2008) Pricing without priors. J. Eur. Econom. Assoc. 6(2–3):560–569.Crossref, Google Scholar
• Bergemann D, Brooks, BA, Morris S (2016) Informationally robust optimal auction design. Cowles Foundation Discussion Paper 2065, Yale University, New Haven, CT.Google Scholar
• Besbes O, Zeevi A (2009) Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms. Oper. Res. 57(6):1407–1420.Google Scholar
• Besbes O, Zeevi A (2015) On the (surprising) sufficiency of linear models for dynamic pricing with demand learning. Management Sci. 61(4):723–739.Google Scholar
• Borodin A, El-Yaniv R (1998) Online Computation and Competitive Analysis (Cambridge University Press, New York).Google Scholar
• Bose S, Daripa A (2009) A dynamic mechanism and surplus extraction under ambiguity. J. Econom. Theory 144(5):2084–2114.Google Scholar
• Bose S, Ozdenoren E, Pape A (2006) Optimal auctions with ambiguity. Theoret. Econom. 1(4):411–438.Google Scholar
• Bulow J, Klemperer P (1996) Auctions vs. negotiations. Amer. Econom. Rev. 86(1):180–194.Google Scholar
• Caillaud B, Robert J (2005) Implementation of the revenue-maximizing auction by an ignorant seller. Rev. Econom. Design 9(2):127–143.Google Scholar
• Caldentey R, Liu Y, Lobel I (2016) Intertemporal pricing under minimax regret. Oper. Res. 65(1):104–129.Google Scholar
• Carrasco V, Farinha Luz V, Monteiro P, Moreira H (2015) Robust selling mechanisms. Discussion Paper 641, Pontifical Catholic University of Rio de Janeiro, Rio de Janeiro.Crossref, Google Scholar
• Carroll G (2019) Robustness in mechanism design and contracting. Annual Rev. Econom. 11(1):139–166.Google Scholar
• Chen H, Hu M, Perakis G (2017) Distribution-free pricing. Working paper, Chinese Academy of Sciences, Beijing.Crossref, Google Scholar
• Chiesa A, Micali S, Zhu ZA (2015) Knightian analysis of the Vickrey mechanism. Econometrica 83(5):1727–1754.Crossref, Google Scholar
• Chung K-S, Ely JC (2007) Foundations of dominant-strategy mechanisms. Rev. Econom. Stud. 74(2):447–476.Crossref, Google Scholar
• Clarkson JA, Adams CR (1933) On definitions of bounded variation for functions of two variables. Trans. Amer. Math. Soc. 35(4):824–854.Crossref, Google Scholar
• Cohen MC, Perakis G, Pindyck RS (2016) Pricing with limited knowledge of demand. Proc. 2016 ACM Conf. Econom. Comput. (ACM, New York), 657.Crossref, Google Scholar
• Cole R, Rao S (2015) Applications of α-strongly regular distributions to Bayesian auctions. Markakis E, Schäfer G, eds. Proc. 11th Internat. Conf. Web Internet Econom. (Springer, Berlin), 244–257.Google Scholar
• Cole R, Roughgarden T (2014) The sample complexity of revenue maximization. Proc. 46th Annual ACM Sympos. Theory Comput. (ACM, New York), 243–252.Google Scholar
• Daskalakis C, Pierrakos G (2011) Simple, optimal and efficient auctions. Chen N, Elkind E, Koutsoupias E, eds. Proc. 7th Internat. Workshop Internet Network Econom. (Springer, Berlin), 109–121.Google Scholar
• den Boer AV (2015) Dynamic pricing and learning: Historical origins, current research, and new directions. Surveys Oper. Res. Management Sci. 20(1):1–18.Google Scholar
• Dhangwatnotai P, Roughgarden T, Yan Q (2015) Revenue maximization with a single sample. Games Econom. Behav. 91(May):318–333.Google Scholar
• Eren SS, Maglaras C (2010) Monopoly pricing with limited demand information. J. Revenue Pricing Management 9(1–2):23–48.Google Scholar
• Ewerhart C (2013) Regular type distributions in mechanism design and ρ-concavity. Econom. Theory 53(3):591–603.Google Scholar
• Farias VF, Van Roy B (2010) Dynamic pricing with a prior on market response. Oper. Res. 58(1):16–29.Google Scholar
• Fu H, Immorlica N, Lucier B, Strack P (2015) Randomization beats second price as a prior-independent auction. Proc. 16th ACM Conf. Econom. Comput. (ACM, New York), 323.Google Scholar
• Goldberg AV, Hartline JD, Karlin AR, Saks M, Wright A (2006) Competitive auctions. Games Econom. Behav. 55(2):242–269.Google Scholar
• Harstad RM, Kagel JH, Levin D (1990) Equilibrium bid functions for auctions with an uncertain number of bidders. Econom. Lett. 33(1):35–40.Google Scholar
• Hartline JD (2013) Bayesian mechanism design. Foundations Trends® Theoret. Comput. Sci. 8(3):143–263.Crossref, Google Scholar
• Hartline JD, Roughgarden T (2009) Simple vs. optimal mechanisms. Proc. 10th ACM Conf. Electronic Commerce (ACM, New York), 225–234.Google Scholar
• Hartline J, Mirrokni V, Sundararajan M (2008) Optimal marketing strategies over social networks. Proc. 17th Internat. Conf. World Wide Web (ACM, New York), 189–198.Crossref, Google Scholar
• Huang Z, Mansour Y, Roughgarden T (2015) Making the most of your samples. Proc. 16th ACM Conf. Econom. Comput. (ACM, New York), 45–60.Crossref, Google Scholar
• Keskin NB, Zeevi A (2014) Dynamic pricing with an unknown demand model: Asymptotically optimal semi-myopic policies. Oper. Res. 62(5):1142–1167.Google Scholar
• Kleinberg RD, Leighton T (2003) The value of knowing a demand curve: Bounds on regret for online posted-price auctions. Proc. 44th Annual IEEE Sympos. Foundations Comput. Sci. (IEEE, Piscataway, NJ), 594–605.Crossref, Google Scholar
• Koçyiğit Ç, Iyengar G, Kuhn D, Wiesemann W (2020) Distributionally robust mechanism design. Management Sci. 66(1):159–189.Google Scholar
• Krishna V (2009) Auction Theory (Academic Press, New York).Google Scholar
• Levin D, Ozdenoren E (2004) Auctions with uncertain numbers of bidders. J. Econom. Theory 118(2):229–251.Crossref, Google Scholar
• McAfee RP, McMillan J (1987) Auctions with a stochastic number of bidders. J. Econom. Theory 43(1):1–19.Crossref, Google Scholar
• Myerson RB (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.Google Scholar
• Neeman Z (2003) The effectiveness of English auctions. Games Econom. Behav. 43(2):214–238.Crossref, Google Scholar
• Schweizer N, Szech N (2016) The quantitative view of Myerson regularity. Working paper, Tilburg School of Economics, Tilburg, Netherlands.Crossref, Google Scholar
• Sivan B, Syrgkanis V (2013) Vickrey auctions for irregular distributions. Chen Y, Immorlica N, eds. Internat. Conf. Web Internet Econom. (Springer, Berlin), 422–435.Crossref, Google Scholar
• Talluri KT, Van Ryzin GJ (2006) The Theory and Practice of Revenue Management, International Series in Operations Research and Management Science, vol. 68 (Springer Science & Business Media, New York).Google Scholar
• Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1):8–37.Google Scholar
• Wang Z, Deng S, Ye Y (2014) Close the gaps: A learning-while-doing algorithm for single-product revenue management problems. Oper. Res. 62(2):318–331.Google Scholar
• Wilson R (1987) Game theoretic analyses of trading processes. Bewley TF, ed. Adv. Econom. Theory: Fifth World Congress (Cambridge University Press, Cambridge, UK), 33–70.Google Scholar