The Best of Many Robustness Criteria in Decision Making: Formulation and Application to Robust Pricing
Abstract: In robust decision-making under non-Bayesian uncertainty, different robust optimization criteria, such as maximin performance, minimax regret, and maximin ratio, have been proposed. In many problems, all three criteria are well-motivated and well-grounded from a decision-theoretic perspective, yet different criteria give different prescriptions. This paper initiates a systematic study of overfitting to robustness criteria. How good is a prescription derived from one criterion when evaluated against another criterion? Does there exist a prescription that performs well against all criteria of interest? We formalize and study these questions through the prototypical problem of robust pricing under various information structures, including support, moments, and percentiles of the distribution of values. We provide a unified analysis of three focal robust criteria across various information structures and evaluate the relative performance of mechanisms optimized for each criterion against the others. We find that mechanisms optimized for one criterion often perform poorly against other criteria, highlighting the risk of overfitting to a particular robustness criterion. Remarkably, we show it is possible to design mechanisms that achieve good performance across all three criteria simultaneously, suggesting that decision-makers need not compromise among criteria.
- Maurice Allais. Le comportement de l'homme rationnel devant le risque: Critique des postulats et axiomes de l'École américaine. Econometrica, 21(4):503–546, 1953.
- Prior-independent optimal auctions. Management Science, 66(10):4417–4432, 2020.
- Optimal pricing with a single point. Management Science, 69(10):5866–5882, 2023.
- On the robustness of second-price auctions in prior-independent mechanism design. In Proceedings of the 23rd ACM Conference on Economics and Computation, pages 151–152. ACM, 2022.
- Robust auction design with support information. In Proceedings of the 24th ACM Conference on Economics and Computation, EC '23, page 113, New York, NY, USA, 2023. Association for Computing Machinery.
- Kenneth J. Arrow. Alternative approaches to the theory of choice in risk-taking situations. Econometrica, 19(4):404–437, 1951.
- Optimal and efficient parametric auctions. In Proceedings of the 2013 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 596–604, 2013.
- Parametric digital auctions. In Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, ITCS '13, page 231–232, New York, NY, USA, 2013. Association for Computing Machinery.
- Distributional robustness: From pricing to auctions. In Proceedings of the 23rd ACM Conference on Economics and Computation, EC '22, page 150, New York, NY, USA, 2022.
- Pricing without priors. Journal of the European Economic Association, 6(2-3):560–569, 2008.
- Dimitris Bertsimas and Dick den Hertog. Robust and Adaptive Optimization. Dynamic Ideas LLC, 2022.
- Theory and applications of robust optimization. SIAM Review, 53(3):464–501, 2011.
- Online Computation and Competitive Analysis. Cambridge University Press, 2005.
- Optimal selling mechanisms under moment conditions. Journal of Economic Theory, 177:245–279, 2018.
- Gabriel Carroll. Robustness and separation in multidimensional screening. Econometrica, 85(2):453–488, 2017.
- Monotone approximation of decision problems. Operations Research, 58(4-part-2):1158–1177, 2010.
- Distribution-free pricing. Manufacturing & Service Operations Management, 24(4):1939–1958, 2022.
- Screening with limited information: A dual perspective. Operations Research, 0(0):null, 2024.
- Robust scheduling to hedge against processing time uncertainty in single-stage production. Management Science, 41(2):363–376, 1995.
- Daniel Ellsberg. Risk, ambiguity, and the savage axioms. Quarterly Journal of Economics, 75(4):643–669, 1961.
- Monopoly pricing with limited demand information. Journal of revenue and pricing management, 9(1-2):23–48, 2010.
- Maxmin expected utility with non-unique prior. Journal of Mathematical Economics, 18:141–153, 1989.
- Separation in correlation-robust monopolist problem with budget. In Proceedings of the 2018 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2069–2080, 2018.
- J. C. Harsanyi. Cardinal welfare, individualistic ethics, and interpersonal comparisons of utility. The Journal of Political Economy, 63(4):309–321, 1955.
- Benchmark design and prior-independent optimization. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 294–305, 2020.
- Scientific Reasoning: The Bayesian Approach. Open Court, La Salle, 1989. ISBN 0-8126-9084-2.
- Leonard Hurwicz. Optimality criteria for decision making under ignorance. 1951.
- Prospect theory: An analysis of decision under risk. Econometrica, 47(2):263–291, 1979.
- Richard M. Karp. On-line algorithms versus off-line algorithms: How much is it worth to know the future? In Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I, page 416–429. North-Holland Publishing Co., 1992.
- Security games with interval uncertainty. In Proceedings of the 2013 International Conference on Autonomous Agents and Multi-Agent Systems, AAMAS '13, page 231–238, Richland, SC, 2013. International Foundation for Autonomous Agents and Multiagent Systems.
- Robust multidimensional pricing: separation without regret. Mathematical Programming, 196(1):841–874, 2022.
- Selling to the Mean. CESifo Working Paper Series 5443, CESifo, 2015.
- Roger B. Myerson. Optimal auction design. Mathematics of Operations Research, 6(1):58–73, 1981.
- Regret in the newsvendor model with partial information. Operations Research, 56(1):188–203, 2008.
- Frameworks and Results in Distributionally Robust Optimization. Open Journal of Mathematical Optimization, 3:4, 2022.
- Optimal Selling Strategies: When to Haggle, When to Hold Firm*. The Quarterly Journal of Economics, 98(2):267–289, 05 1983.
- Approximately optimal mechanism design. Annual Review of Economics, 11(1):355–381, 2019.
- Robust assortment optimization in revenue management under the multinomial logit choice model. Operations Research, 60(4):865–882, 2012.
- L. Savage. The Foundations of Statistics. Wiley, New York, 1954.
- Leonard J. Savage. The theory of statistical decision. Journal of the American Statistical Association, 46(253):55–67, 1951.
- Jörg Stoye. Axioms for minimax regret choice correspondences. Journal of Economic Theory, 146(6):2226–2251, 2011. ISSN 0022-0531.
- Alex Suzdaltsev. An Optimal Distributionally Robust Auction. Papers 2006.05192, arXiv.org, June 2020.
- John von Neumann and Oskar Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, 1944.
- Abraham Wald. Statistical decision functions which minimize the maximum risk. Annals of Mathematics, 46:265–280, 1945.
- Shixin Wang. The power of simple menus in robust selling mechanisms, 2023.
- Minimax regret mechanism design with moment information. Technical report, 2024.
- Robust optimization approach to process flexibility designs with contribution margin differentials. Manufacturing & Service Operations Management, 24(1):632–646, 2022.
- Minimax regret robust screening with moment information. Manufacturing & Service Operations Management (forthcoming), 2023.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.