On the Robustness of Second-Price Auctions in Prior-Independent Mechanism Design

References

• Allouah A, Besbes O (2020) Prior-independent optimal auctions. Management Sci. 66(10):4417–4432.Link, Google Scholar
• Allouah A, Bahamou A, Besbes O (2022) Pricing with samples. Oper. Res. 70(2):1088–1104.Link, Google Scholar
• Allouah A, Bahamou A, Besbes O (2023) Optimal pricing with a single point. Management Sci. 69(10):5866–5882.Link, Google Scholar
• Azar P, Micali S, Daskalakis C, Weinberg MS (2013) Optimal and efficient parametric auctions. Pennock DM, Segal I, Seuken S, eds. Proc. Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 596–604.Google Scholar
• Bachrach N, Talgam-Cohen I (2022) Distributional robustness: From pricing to auctions. Proc. 23rd ACM Conf. Econom. Comput. (ACM, New York), 150.Google Scholar
• Bergemann D, Morris S (2005) Robust mechanism design. Econometrica 73(6):1771–1813.Crossref, Google Scholar
• Bergemann D, Schlag KH (2008) Pricing without priors. J. Eur. Econom. Assoc. 6(2–3):560–569.Crossref, Google Scholar
• Börgers T (2015) An Introduction to the Theory of Mechanism Design (Oxford University Press, Oxford, UK).Crossref, Google Scholar
• Borodin A, El-Yaniv R (2005) Online Computation and Competitive Analysis (Cambridge University Press, Cambridge, UK).Google Scholar
• Bose S, Ozdenoren E, Pape AD (2006) Optimal auctions with ambiguity. Theoretical Econom. 1(4):411–438.Google Scholar
• Bubeck S, Devanur NR, Huang Z, Niazadeh R (2019) Multi-scale online learning: Theory and applications to online auctions and pricing. J. Machine Learn. Res. 20(62):1–37.Google Scholar
• Bulow J, Klemperer P (1996) Auctions vs. negotiations. Amer. Econom. Rev. 86(1):180–194.Google Scholar
• Caldentey R, Liu Y, Lobel I (2017) Intertemporal pricing under minimax regret. Oper. Res. 65(1):104–129.Link, Google Scholar
• Carroll G (2017) Robustness and separation in multidimensional screening. Econometrica 85(2):453–488.Crossref, Google Scholar
• Carroll G (2019) Robustness in mechanism design and contracting. Annu. Rev. Econom. 11(1):139–166.Crossref, Google Scholar
• Che E (2022) Robustly optimal auction design under mean constraints. Proc. 23rd ACM Conf. Econom. Comput. (ACM, New York), 153–181.Google Scholar
• Che Y-K, Zhong W (2021) Robustly-optimal mechanism for selling multiple goods. Proc. 22nd ACM Conf. Econom. Comput. (ACM, New York), 314–315.Google Scholar
• Chiesa A, Micali S, Zhu ZA (2015) Knightian analysis of the Vickrey mechanism. Econometrica 83(5):1727–1754.Crossref, Google Scholar
• Chung KS, Ely JC (2007) Foundations of dominant-strategy mechanisms. Rev. Econom. Stud. 74(2):447–476.Crossref, 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
• David HA, Nagaraja HN (2003) Order Statistics, 3rd ed. (Wiley-Interscience, New York).Crossref, Google Scholar
• Dhangwatnotai P, Roughgarden T, Yan Q (2015) Revenue maximization with a single sample. Games Econom. Behav. 91:318–333.Crossref, Google Scholar
• Eren SS, Maglaras C (2010) Monopoly pricing with limited demand information. J. Revenue Pricing Management 9(1–2):23–48.Crossref, Google Scholar
• Feng Y, Hartline JD, Li Y (2021) Revelation gap for pricing from samples. Proc. 53rd Annual ACM SIGACT Sympos. Theory Comput. (ACM, New York), 1438–1451.Google Scholar
• Fu H, Haghpanah N, Hartline J, Kleinberg R (2021) Full surplus extraction from samples. J. Econom. Theory 193:105230.Crossref, 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–323.Google Scholar
• Guo Y, Shmaya E (2023) Robust monopoly regulation. Preprint, submitted May 24, https://dx.doi.org/10.2139/ssrn.4445497.Google Scholar
• Hartline J (2020) Mechanism design and approximation. Accessed February 5, 2022, https://jasonhartline.com/MDnA/.Google Scholar
• Hartline J, Johnsen A (2024) Equivocal blends: Prior independent lower bounds. Guruswami V, ed. 15th Innovations Theoret. Comput. Sci. Conf. (ITCS 2024), vol. 287 (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany), 59:1–59:21.Google Scholar
• Hartline J, Johnsen A, Li Y (2020) Benchmark design and prior-independent optimization. Proc. IEEE 61st Annual Sympos. Foundations Computer Sci. (IEEE Computer Society, Washington, DC), 294–305.Google Scholar
• Hastie T, Tibshirani R, Friedman JH (2009) The Elements of Statistical Learning: Data Mining, Inference, and Prediction, vol. 2 (Springer, Berlin).Crossref, Google Scholar
• Huang Z, Mansour Y, Roughgarden T (2018) Making the most of your samples. SIAM J. Comput. 47(3):651–674.Crossref, Google Scholar
• Karlin S (1968) Total Positivity (Stanford University Press, Stanford, CA).Google Scholar
• Karlin S, Rinott Y (1980) Classes of orderings of measures and related correlation inequalities. I. Multivariate totally positive distributions. J. Multivariate Anal. 10(4):467–498.Crossref, Google Scholar
• Kleer P, van Leeuwaarden J (2022) Optimal stopping theory for a distributionally robust seller. Preprint, submitted June 6, https://arxiv.org/abs/2206.02477.Google Scholar
• Kleinberg R, Yuan Y (2013) On the ratio of revenue to welfare in single-parameter mechanism design. Proc. 14th ACM Conf. Econom. Comput. (ACM, New York), 589–602.Google Scholar
• Koçyiğit Ç, Kuhn D, Rujeerapaiboon N (2024) Regret minimization and separation in multi-bidder multi-item auctions. INFORMS J. Comput., ePub ahead of print March 4, https://doi.org/10.1287/ijoc.2022.0275.Google Scholar
• Koçyiğit Ç, Rujeerapaiboon N, Kuhn D (2022) Robust multidimensional pricing: Separation without regret. Math. Programming 196(1):841–874.Crossref, Google Scholar
• Krishna V (2010) Auction Theory, 2nd ed. (Academic Press, New York).Google Scholar
• McLachlan GJ, Lee SX, Rathnayake SI (2019) Finite mixture models. Annu. Rev. Statist. Appl. 6(1):355–378.Crossref, Google Scholar
• Milgrom PR, Weber RJ (1982) A theory of auctions and competitive bidding. Econometrica 50(5):1089–1122.Crossref, Google Scholar
• Mitzenmacher M, Vassilvitskii S (2021) Algorithms with Predictions (Cambridge University Press, Cambridge, UK).Google Scholar
• Myerson RB (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.Link, Google Scholar
• Pathak PA, Sönmez T (2008) Leveling the playing field: Sincere and sophisticated players in the Boston mechanism. Amer. Econom. Rev. 98(4):1636–1652.Crossref, Google Scholar
• Riley JG, Samuelson WF (1981) Optimal auctions. Amer. Econom. Rev. 71(3):381–392.Google Scholar
• Suzdaltsev A (2020) An optimal distributionally robust auction. Preprint, submitted June 9, https://arxiv.org/abs/2006.05192.Google Scholar
• Suzdaltsev A (2022) Distributionally robust pricing in independent private value auctions. J. Econom. Theory 206:105555.Crossref, Google Scholar
• Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1):8–37.Crossref, Google Scholar
• Wang S, Liu S, Zhang J (2024) Minimax regret robust screening with moment information. Manufacturing Service Oper. Management, ePub ahead of print February 22, https://doi.org/10.1287/msom.2023.0072.Link, Google Scholar
• Wilson R (1987) Game-theoretic analyses of trading processes in advanced in economic theory. Bewley TF, ed. Advances in Economic Theory Fifth World Congress (Cambridge University Press, Cambridge, UK), 33–70.Crossref, Google Scholar