One-switch utility functions and a measure of risk
Management Science
An analysis of stochastic shortest path problems
Mathematics of Operations Research
Broadly Decreasing Risk Aversion
Management Science
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Decision-Theoretic Control of Planetary Rovers
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
Sensor Planning with Non-linear Utility Functions
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
A decision-support system for quote generation
Eighteenth national conference on Artificial intelligence
Management Science
Decision-theoretic planning under risk-sensitive planning objectives
Decision-theoretic planning under risk-sensitive planning objectives
Brief On terminating Markov decision processes with a risk-averse objective function
Automatica (Journal of IFAC)
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Functional value iteration for decision-theoretic planning with general utility functions
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
A fast analytical algorithm for solving Markov decision processes with real-valued resources
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Computing rank dependent utility in graphical models for sequential decision problems
Artificial Intelligence
Towards a bridge between cost and wealth in risk-aware planning
Applied Intelligence
Probabilistic goal Markov decision processes
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Hi-index | 0.01 |
Decision-theoretic planning with nonlinear utility functions is important since decision makers are often risk-sensitive in high-stake planning situations. One-switch utility functions are an important class of nonlinear utility functions that can model decision makers whose decisions change with their wealth level. We study how to maximize the expected utility of a Markov decision problem for a given one-switch utility function, which is difficult since the resulting planning problem is not decomposable. We first study an approach that augments the states of the Markov decision problem with the wealth level. The properties of the resulting infinite Markov decision problem then allow us to generalize the standard risk-neutral version of value iteration from manipulating values to manipulating functions that map wealth levels to values. We use a probabilistic blocks-world example to demonstrate that the resulting risk-sensitive version of value iteration is practical.