Preference ambiguity and robustness in multistage decision making.
Saved in:
| Title: | Preference ambiguity and robustness in multistage decision making. |
|---|---|
| Authors: | Liu, Jia1,2 (AUTHOR) jialiu@xjtu.edu.cn, Chen, Zhiping1,2 (AUTHOR) zchen@mail.xjtu.edu.cn, Xu, Huifu3 (AUTHOR) hfxu@se.cuhk.edu.hk |
| Source: | Mathematical Programming. Nov2025, Vol. 214 Issue 1/2, p847-939. 93p. |
| Subjects: | Utility functions, Robust optimization, Decision making, Dynamic programming, Expectation-maximization algorithms, Decomposition method |
| Abstract: | In this paper, we consider a multistage expected utility maximization problem where the decision maker's utility function at each stage depends on historical path and the information on the true utility function is incomplete. To mitigate the adverse impact arising from ambiguity regarding the true utility, we propose a maximin robust model where the optimal policy is based on the worst-case sequence of utility functions from an ambiguity set constructed with partially available information about the decision maker's preferences. We show that the multistage maximin problem is time consistent when the utility functions depend on the historical path and provide a counter example demonstrating that the time consistency is not retained when the utility functions are stagewise independent. With the time consistency, we show the maximin problem can be recursively solved by backward induction, where a one-stage maximin problem is solved at each stage starting from the last stage. Moreover, we propose two approaches to construct the ambiguity set: a pairwise comparison approach and a ζ -ball approach where a ball of utility functions centered at a nominal utility function under ζ -metric is considered. To overcome the difficulty arising from solving the infinite-dimensional optimization problem in the computation of the worst-case expected utility value, we propose a piecewise linear approximation of the utility functions and derive error bounds for the approximation under moderate conditions. Finally, we use the stochastic dual dynamic programming method and the nested Benders' decomposition method to solve the multistage historical-path-dependent preference robust problem and the scenario tree method to solve the stagewise-independent problem. We carry out comparative analysis on the efficiency of the computational schemes as well as out-of-sample performances of the historical-path-dependent and stagewise-independent models. The preliminary results show that the historical-path-dependent preference robust model displays overall superiority. [ABSTRACT FROM AUTHOR] |
| Copyright of Mathematical Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In this paper, we consider a multistage expected utility maximization problem where the decision maker's utility function at each stage depends on historical path and the information on the true utility function is incomplete. To mitigate the adverse impact arising from ambiguity regarding the true utility, we propose a maximin robust model where the optimal policy is based on the worst-case sequence of utility functions from an ambiguity set constructed with partially available information about the decision maker's preferences. We show that the multistage maximin problem is time consistent when the utility functions depend on the historical path and provide a counter example demonstrating that the time consistency is not retained when the utility functions are stagewise independent. With the time consistency, we show the maximin problem can be recursively solved by backward induction, where a one-stage maximin problem is solved at each stage starting from the last stage. Moreover, we propose two approaches to construct the ambiguity set: a pairwise comparison approach and a ζ -ball approach where a ball of utility functions centered at a nominal utility function under ζ -metric is considered. To overcome the difficulty arising from solving the infinite-dimensional optimization problem in the computation of the worst-case expected utility value, we propose a piecewise linear approximation of the utility functions and derive error bounds for the approximation under moderate conditions. Finally, we use the stochastic dual dynamic programming method and the nested Benders' decomposition method to solve the multistage historical-path-dependent preference robust problem and the scenario tree method to solve the stagewise-independent problem. We carry out comparative analysis on the efficiency of the computational schemes as well as out-of-sample performances of the historical-path-dependent and stagewise-independent models. The preliminary results show that the historical-path-dependent preference robust model displays overall superiority. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00255610 |
| DOI: | 10.1007/s10107-025-02208-1 |
