Robust Auction Design with Support Information

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
• Anunrojwong J, Balseiro SR, Besbes O (2025) On the robustness of second-price auctions in prior-independent mechanism design. Oper. Res. 73(3):1659–1674.Link, Google Scholar
• Azar P, Micali S, Daskalakis C, Weinberg SM (2013) Optimal and efficient parametric auctions. Proc. Annu. ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 596–604.Google Scholar
• Babaioff M, Lavi R, Pavlov E (2009) Single-value combinatorial auctions and algorithmic implementation in undominated strategies. J. ACM 56(1):1–32.Crossref, Google Scholar
• Bachrach N, Talgam-Cohen I (2022) Distributional robustness: From pricing to auctions. Proc. 23rd ACM Conf. Econom. Comput. (ACM, New York), 50–150.Google Scholar
• Bergemann D, Morris S (2005) Robust mechanism design. Econometrica 73(6):1771–1813.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, Heumann T, Morris S, Sorokin C, Winter E (2022) Optimal information disclosure in classic auctions. Amer. Econom. Rev. Insights 4(3):371–388.Crossref, Google Scholar
• Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev. 53(3):464–501.Crossref, Google Scholar
• Borodin A, El-Yaniv R (2005) Online Computation and Competitive Analysis (Cambridge University Press, Cambridge, UK).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 (2019) Robustness in mechanism design and contracting. Annu. Rev. Econom. 11(1):139–166.Crossref, Google Scholar
• Carroll G, Segal I (2018) Robustly optimal auctions with unknown resale opportunities. Rev. Econom. Stud. 86(4):1527–1555.Crossref, Google Scholar
• Che E (2022) Robustly optimal auction design under mean constraints. Proc. 23rd ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 153–181.Google Scholar
• Che Y-K, Kim J (2006) Robustly collusion-proof implementation. Econometrica 74(4):1063–1107.Crossref, Google Scholar
• Che Y-K, Kim J (2009) Optimal collusion-proof auctions. J. Econom. Theory 144(2):565–603.Crossref, Google Scholar
• Chung K-S, 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 Annu. ACM Sympos. Theory Comput. (Association for Computing Machinery, 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
• Feldman M, Gravin N, Tang ZG, Wald A (2022) Lookahead auctions with pooling. Kanellopoulos P, Kyropoulou M, Voudouris A, ed. Algorithmic Game Theory (Springer International Publishing, Cham, Switzerland), 60–77.Crossref, Google Scholar
• Feng Y, Hartline JD, Li Y (2021) Revelation gap for pricing from samples. Proc. 53rd Annu. ACM SIGACT Sympos. Theory Comput. (Association for Computing Machinery, 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
• Guo Y, Shmaya E (2025) Robust monopoly regulation. Amer. Econom. Rev. 115(2):599–634. Google Scholar
• Hartline J (2020) Mechanism Design and Approximation (Northwestern University, Evanston, IL).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. 36(6):1543–1561.Link, Google Scholar
• Laffont J-J, Robert J (1996) Optimal auction with financially constrained buyers. Econom. Lett. 52(2):181–186.Crossref, Google Scholar
• Milgrom PR, Weber RJ (1982) A theory of auctions and competitive bidding. Econometrica 50(5):1089–1122.Crossref, Google Scholar
• Myerson RB (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.Link, Google Scholar
• Pai MM, Vohra R (2014) Optimal auctions with financially constrained buyers. J. Econom. Theory 150:383–425.Crossref, Google Scholar
• Rahimian H, Mehrotra S (2022) Frameworks and results in distributionally robust optimization. Open J. Math. Optim. 3:4.Google Scholar
• Riley JG, Samuelson WF (1981) Optimal auctions. Amer. Econom. Rev. 71(3):381–392.Google Scholar
• Roughgarden T, Talgam-Cohen I (2019) Approximately optimal mechanism design. Annu. Rev. Econom. 11(1):355–381.Crossref, 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
• 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
• Zhang W (2021) Correlation-robust optimal auctions. Preprint, submitted May 10, https://arxiv.org/abs/2105.04697.Google Scholar
• Zhang W (2022) Auctioning multiple goods without priors. Preprint, submitted April 28, https://arxiv.org/abs/2204.13726.Google Scholar