Rank-dependent Probability Weighting in Sequential Decision Problems under Uncertainty

Gildas Jeantet 1 Olivier Spanjaard 1
1 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper is devoted to the computation of optimal strategies in automated sequential decision problems. We consider here problems where one seeks a strategy which is optimal for rank dependent utility (RDU). RDU generalizes von Neumann and Morgenstern's expected utility (by probability weighting) to encompass rational decision behaviors that EU cannot accomodate. The induced algorithmic problem is however more difficult to solve since the optimality principle does not hold anymore. More crucially, we prove here that the search for an optimal strategy (w.r.t. RDU) in a decision tree is an NP-hard problem. We propose an implicit enumeration algorithm to compute optimal rank dependent utility in decision trees. The performances of our algorithm on randomly generated instances and real-world instances of different sizes are presented and discussed.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01302969
Contributor : Lip6 Publications <>
Submitted on : Tuesday, July 11, 2017 - 12:14:49 PM
Last modification on : Thursday, March 21, 2019 - 2:19:32 PM
Document(s) archivé(s) le : Thursday, January 25, 2018 - 3:46:41 AM

File

gjos.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01302969, version 1

Citation

Gildas Jeantet, Olivier Spanjaard. Rank-dependent Probability Weighting in Sequential Decision Problems under Uncertainty. International Conference on Automated Planning and Scheduling, 2008, Sydney, Australia. AAAI Press, International Conference on Automated Planning and Scheduling, pp.148-155. 〈hal-01302969〉

Share

Metrics

Record views

72

Files downloads

30