Download

Full Text

• Allouah A, Besbes O (2020) Prior-independent optimal auctions. Management Sci. 66(10):4417–4432.
• Bandi C, Bertsimas D (2014) Optimal design for multi-item auctions: A robust optimization approach. Math. Oper. Res. 39(4):1012–1038.
• Bei X, Gravin N, Lu P, Tang ZG (2019) Correlation-robust analysis of single item auction. Proc. 30th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 193–208.
• Bergemann D, Schlag K (2008) Pricing without priors. J. Eur. Econom. Assoc. 6(2–3):560–569.
• Bose S, Ozdenoren E, Pape A (2006) Optimal auctions with ambiguity. Theoretical Econom. 1(4):411–438.
• Bulow J, Klemperer P (1996) Auctions vs. negotiations. Amer. Econom. Rev. 86(1):180–194.
• Cai Y, Devanur NR, Weinberg SM (2021) A duality-based unified approach to Bayesian mechanism design. SIAM J. Comput. 50(3):STOC16-160–STOC16-200.
• Caldentey R, Liu Y, Lobel I (2017) Intertemporal pricing under minimax regret. Oper. Res. 65(1):104–129.
• Carroll G (2017) Robustness and separation in multidimensional screening. Econometrica 85(2):453–488.
• Chen H, Hu M, Perakis G (2022) Distribution-free pricing. Manufacturing Service Oper. Management 24(4):1939–1958.
• Cremer J, McLean RP (1988) Full extraction of the surplus in Bayesian and dominant strategy auctions. Econometrica 56(6):1247–1257.
• Daskalakis C, Deckelbaum A, Tzamos C (2013) Mechanism design via optimal transport. Proc. 14th ACM Conf. Electronic Commerce (Association for Computing Machinery, New York), 269–286.
• Daskalakis C, Deckelbaum A, Tzamos C (2014) The complexity of optimal mechanism design. Proc. 25th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 1302–1318.
• Daskalakis C, Deckelbaum A, Tzamos C (2017) Strong duality for a multiple-good monopolist. Econometrica 85(3):735–767.
• Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3):595–612.
• Dhangwatnotai P, Roughgarden T, Yan Q (2015) Revenue maximization with a single sample. Games Econom. Behav. 91:318–333.
• Giannakopoulos Y, Koutsoupias E (2014) Duality and optimality of auctions for uniform distributions. Proc. 15th ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 259–276.
• Gravin N, Lu P (2018) Separation in correlation-robust monopolist problem with budget. Proc. 29th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 2069–2080.
• Hart S, Nisan N (2017) Approximate revenue maximization with multiple items. J. Econom. Theory 172:313–347.
• Hart S, Nisan N (2019) Selling multiple correlated goods: Revenue maximization and menu-size complexity. J. Econom. Theory 183:991–1029.
• Koçyiğit Ç, Kuhn D, Rujeerapaiboon N (2023) Regret minimization and separation in multibidder, multi-item auctions. https://dx.doi.org/10.1287/ijoc.2022.0275.cd, https://github.com/INFORMSJoC/2022.0275.
• Koçyiğit Ç, Rujeerapaiboon N, Kuhn D (2022) Robust multidimensional pricing: Separation without regret. Math. Programming 196:841–874.
• Koçyiğit Ç, Iyengar G, Kuhn D, Wiesemann W (2020) Distributionally robust mechanism design. Management Sci. 66(1):159–189.
• Krishna V (2009) Auction Theory (Academic Press, Burlington, MA).
• Kuhn D, Mohajerin Esfahani P, Nguyen VA, Shafieezadeh-Abadeh S (2019) Wasserstein distributionally robust optimization: Theory and applications in machine learning. Netessine S, ed. Operations Research & Management Science in the Age of Analytics (INFORMS, Catonsville, MD), 130–166.
• Myerson RB (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.
• Poursoltani M, Delage E (2022) Adjustable robust optimization reformulations of two-stage worst-case regret minimization problems. Oper. Res. 70(5):2906–2930.
• Suzdaltsev A (2020) An optimal distributionally robust auction. Preprint, submitted June 9, https://arxiv.org/abs/2006.05192.