Screening with Limited Information: A Dual Perspective

References

• Allouah A, Bahamou A, Besbes O (2022) Pricing with samples. Oper. Res. 70(2):1088–1104.Link, Google Scholar
• Balcan MF, Sandholm T, Vitercik E (2017) Generalization guarantees for multi-item profit maximization: Pricing, auctions, and randomized mechanisms. Preprint, submitted April 29, https://arxiv.org/abs/1705.00243.Google Scholar
• Bandi C, Bertsimas D (2014) Optimal design for multi-item auctions: A robust optimization approach. Math. Oper. Res. 39(4):1012–1038.Link, Google Scholar
• Bei X, Chen N, Gravin N, Lu P (2017) Worst-case mechanism design via Bayesian analysis. SIAM J. Comput. 46(4):1428–1448.Crossref, Google Scholar
• Bergemann D, Schlag K (2008) Pricing without priors. J. Eur. Econ. Assoc. 6(2–3):560–569.Crossref, Google Scholar
• Bergemann D, Schlag K (2011) Robust monopoly pricing. J. Econom. Theory. 146(6):2527–2543.Crossref, Google Scholar
• Bergemann D, Castro F, Weintraub G (2022) Third-degree price discrimination vs. uniform pricing. Games Econom. Behav. 131:275–291.Crossref, Google Scholar
• Blanchet J, Murthy K (2019) Quantifying distributional model risk via optimal transport. Math. Oper. Res. 44(2):565–600.Link, Google Scholar
• Börgers T (2015) An Introduction to the Theory of Mechanism Design (Oxford University Press, Cambridge, MA).Crossref, Google Scholar
• Borwein J, Zhuang D (1986) On Fan’s minimax theorem. Math. Program. 34(2):232–234.Crossref, Google Scholar
• Cai Y, Devanur N, Weinberg M (2019) A duality-based unified approach to Bayesian mechanism design. SIAM J. Comput. 50(3):160–200.Google Scholar
• Caldentey R, Liu Y, Lobel I (2017) Intertemporal pricing under minimax regret. Oper. Res. 65(1):104–129.Link, Google Scholar
• Carrasco V, Luz VF, Kos N, Messner M, Monteiro P, Moreira H (2018) Optimal selling mechanisms under moment conditions. J. Econom. Theory. 177:245–279.Crossref, Google Scholar
• Carroll G (2017) Robustness and separation in multidimensional screening. Econometrica 85(2):453–488.Crossref, Google Scholar
• Chen H, Hu M, Perakis G (2022) Distribution-free pricing. Manufacturing. Service Oper. Management 24(4):1939–1958.Link, Google Scholar
• Chen Z, Sim M, Xiong P (2020) Robust stochastic optimization made easy with RSOME. Management Sci. 66(8):3329–3339.Link, Google Scholar
• Cohen M, Lobel R, Perakis G (2018) Dynamic pricing through data sampling. Production Oper. Management 27(6):1074–1088.Crossref, Google Scholar
• Cole R, Roughgarden T (2014) The sample complexity of revenue maximization. Proc. Forty-Sixth Annual ACM Sympos. on Theory of Computing (ACM, New York), 243–252.Google Scholar
• Condorelli D, Szentes B (2020) Information design in the holdup problem. J. Political Econom. 128(2):681–709.Crossref, Google Scholar
• Corless R, Gonnet G, Hare D, Jeffrey D, Knuth D (1996) On the Lambert W function. Adv. Comput. Math. 5(1):329–359.Crossref, Google Scholar
• Daskalakis C, Deckelbaum A, Tzamos C (2017) Strong duality for a multiple-good monopolist. Econometrica 85(3):735–767.Crossref, Google Scholar
• Delage E, Ye Y (2010) Distributionally robust optimization under moment uncertainty with application to data-driven problems. Oper. Res. 58(3):595–612.Link, Google Scholar
• Du S (2018) Robust mechanisms under common valuation. Econometrica 86(5):1569–1588.Crossref, Google Scholar
• Elmachtoub A, Gupta V, Hamilton M (2021) The value of personalized pricing. Management Sci. 67(10):6055–6070.Link, Google Scholar
• Eren S, Maglaras C (2010) Monopoly pricing with limited demand information. J. Revenue Pricing Management 9:23–48.Crossref, Google Scholar
• Gao R, Kleywegt A (2023) Distributionally robust stochastic optimization with Wasserstein distance. Math. Oper. Res. 48(2):603–655.Link, Google Scholar
• Giannakopoulos Y, Koutsoupias E (2014) Duality and optimality of auctions for uniform distributions. Proc. Fifteenth ACM Conf. on Economics and Computation (ACM, New York), 259–276.Google Scholar
• Gravin N, Lu P (2018) Separation in correlation-robust monopolist problem with budget. Proc. Twenty-Ninth Annual ACM-SIAM Sympos. on Discrete Algorithms SIAM, Philadelphia, 2069–2080.Google Scholar
• Kjeldsen TH (2001) John von Neumann’s conception of the minimax theorem: A journey through different mathematical contexts. Arch. Hist. Exact Sci. 56(1):39–68.Crossref, Google Scholar
• Koçyiğit Ç, Iyengar G, Kuhn D, Wiesemann W (2019) Distributionally robust mechanism design. Management Sci. 66(1):159–189.Link, Google Scholar
• Koçyiğit Ç, Rujeerapaiboon N, Kuhn D (2022) Robust multidimensional pricing: Separation without regret. Math. Program. 196:841–874.Crossref, Google Scholar
• Li Y, Lu P, Ye H (2019) Revenue maximization with imprecise distribution. Proc. 18th Internat. Conf. on Autonomous Agents and MultiAgent Systems (ACM, New York), 1582–1590.Google Scholar
• Lim A, Shanthikumar G (2007) Relative entropy, exponential utility, and robust dynamic pricing. Oper. Res. 55(2):198–214.Link, Google Scholar
• Manelli A, Vincent D (2007) Multidimensional mechanism design: Revenue maximization and the multiple-good monopoly. J. Econom. Theory. 137(1):153–185.Crossref, Google Scholar
• Mohajerin Esfahani P, Kuhn D (2018) Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Math. Program. 171(1–2):115–166.Crossref, Google Scholar
• Myerson R (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.Link, Google Scholar
• Perakis G, Roels G (2010) Robust controls for network revenue management. Manufacturing Service Oper. Management 12(1):56–76.Link, Google Scholar
• Pinar MÇ, Kizilkale C (2017) Robust screening under ambiguity. Math. Program. 163(1–2) 273–299.Crossref, Google Scholar
• Rahimian H, Mehrotra S (2019) Distributionally robust optimization: A review. Preprint, submitted August 13, https://arxiv.org/abs/1908.05659.Google Scholar
• Reny P (1999) On the existence of pure and mixed strategy Nash equilibria in discontinuous games. Econometrica. 67(5):1029–1056.Crossref, Google Scholar
• Riley J, Zeckhauser R (1983) Optimal selling strategies: When to haggle, when to hold firm. Quart. J. Econom. 98(2):267–289.Crossref, Google Scholar
• Roesler A-K, Szentes B (2017) Buyer-optimal learning and monopoly pricing. Amer. Econom. Rev. 107(7):2072–2080.Crossref, Google Scholar
• Roos E, Brekelmans R, Van Eekelen W, den Hertog D, Van Leeuwaarden J (2022) Tight tail probability bounds for distribution-free decision making. European J. Oper. Res. 299(3):931–944.Crossref, Google Scholar
• Savage L (1951) The theory of statistical decisions. J. Amer. Statist. Assoc. 46(253):55–67.Crossref, Google Scholar
• Stoye J (2011) Axioms for minimax regret choice correspondences. J. Econom. Theory. 146(6):2226–2251.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
• Talluri K, van Ryzin G (2004) The Theory and Practice of Revenue Management (Springer, New York).Google Scholar
• Vohra R (2011) Mechanism Design: A Linear Programming Approach, vol. 47 (Cambridge University Press, New York).Google Scholar
• Wang S, Liu S, Zhang J (2023) Minimax regret mechanism design with moments information. Preprint, submitted June 9, https://dx.doi.org/10.2139/ssrn.3707021.Google Scholar
• Wiesemann W, Kuhn D, Sim M (2014) Distributionally robust convex optimization. Oper. Res. 62(6):1358–1376.Link, Google Scholar
• Wolitzky A (2016) Mechanism design with maxmin agents: Theory and an application to bilateral trade. Theory Econom. 11(3):971–1004.Crossref, Google Scholar
• Yao ACC (1977) Probabilistic computations: Toward a unified measure of complexity. Proc. 18th Annual Sympos. on Foundations of Computer Science (IEEE, Piscataway, NJ), 222–227.Google Scholar