skip to main content
10.5555/1402383.1402449acmconferencesArticle/Chapter ViewAbstractPublication PagesaamasConference Proceedingsconference-collections
research-article

An exact algorithm for solving MDPs under risk-sensitive planning objectives with one-switch utility functions

Published: 12 May 2008 Publication History

Abstract

One-switch utility functions are an important class of nonlinear utility functions that can model human beings whose decisions change with their wealth level. We study how to maximize the expected utility for Markov decision problems with given one-switch utility functions. We first utilize the fact that one-switch utility functions are weighted sums of linear and exponential utility functions to prove that there exists an optimal policy that is both stationary and deterministic as the wealth level approaches negative infinity. We then develop a solution method, the backward-induction method, that starts with this policy and augments it for higher and higher wealth levels. Our backward-induction method determines maximal expected utilities in finite time, different from the previous functional value iteration method, that typically determines only approximately maximal expected utilities.

References

[1]
D. E. Bell. One-switch utility functions and a measure of risk. Management Science, 34(12):1416--1424, 1988.
[2]
D. E. Bell and P. C. Fishburn. Strong one-switch utility. Management Science, 47(4):601--604, 2001.
[3]
D. P. Bertsekas and J. N. Tsitsiklis. An analysis of stochastic shortest path problems. Mathematics of Operations Research, 16(3):580--595, 1991.
[4]
J. L. Corner and P. D. Corner. Characteristics of decisions in decision analysis practice. The Journal of Operational Research Society, 46:304--314, 1995.
[5]
G. M. Gelles and D. W. Mitchell. Broadly decreasing risk aversion. Management Science, 45:1432--1439, 1999.
[6]
S. Koenig and R. G. Simmons. Risk-sensitive planning with probabilistic decision graphs. In Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR-94), pages 2301--2308, 1994.
[7]
Y. Liu. Decision-Theoretic Planning under Risk-Sensitive Planning Objectives. Dissertation, College of Computing, Georgia Institute of Technology, 2005.
[8]
Y. Liu and S. Koenig. Existence and finiteness conditions for risk-sensitive planning: Results and conjectures. In Proceedings of the Twentieth Annual Conference on Uncertainty in Artificial Intelligence (UAI-05), 2005.
[9]
Y. Liu and S. Koenig. Risk-sensitive planning with one-switch utility functions: Value iteration. In Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), pages 993--999, 2005.
[10]
C. McMillen and M. Veloso. Thresholded rewards: Acting optimally in timed, zero-sum games. In Proceedings of The Twenty-Second Conference on Artificial Intelligence (AAAI-07), 2007.
[11]
Y. Nakamura. Sumex utility functions. Mathematical Social Sciences, 31:39--47, 1996.
[12]
E. Nikolova, M. Brand, and D. R. Karger. Optimal route planning under uncertainty. In Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling (ICAPS-06), 2006.
[13]
S. D. Patek. On terminating Markov decision processes with a risk averse objective function. Automatica, 37(9):1379--1386, 2001.
[14]
P. Perny, O. Spanjaard, and L.-X. Storme. State space search for risk-averse agents. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), pages 2353--2358, 2007.
[15]
M. L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, 1994.
[16]
J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, 1st edition, 1944.

Cited By

View all
  • (2018)Risk-Sensitive Stochastic Orienteering Problems for Trip Optimization in Urban EnvironmentsACM Transactions on Intelligent Systems and Technology10.1145/30805759:3(1-25)Online publication date: 8-Feb-2018
  • (2015)Solving MDPs with skew symmetric bilinear utility functionsProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832415.2832525(1989-1995)Online publication date: 25-Jul-2015
  • (2014)Revisiting risk-sensitive MDPsProceedings of the Twenty-Fourth International Conferenc on International Conference on Automated Planning and Scheduling10.5555/3038794.3038811(136-144)Online publication date: 21-Jun-2014
  • Show More Cited By

Index Terms

  1. An exact algorithm for solving MDPs under risk-sensitive planning objectives with one-switch utility functions

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    AAMAS '08: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
    May 2008
    565 pages
    ISBN:9780981738109

    Sponsors

    Publisher

    International Foundation for Autonomous Agents and Multiagent Systems

    Richland, SC

    Publication History

    Published: 12 May 2008

    Check for updates

    Author Tags

    1. Markov decision problem
    2. decision making
    3. functional value iteration
    4. one-switch utility function
    5. planning
    6. utility theory

    Qualifiers

    • Research-article

    Conference

    AAMAS08
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 07 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2018)Risk-Sensitive Stochastic Orienteering Problems for Trip Optimization in Urban EnvironmentsACM Transactions on Intelligent Systems and Technology10.1145/30805759:3(1-25)Online publication date: 8-Feb-2018
    • (2015)Solving MDPs with skew symmetric bilinear utility functionsProceedings of the 24th International Conference on Artificial Intelligence10.5555/2832415.2832525(1989-1995)Online publication date: 25-Jul-2015
    • (2014)Revisiting risk-sensitive MDPsProceedings of the Twenty-Fourth International Conferenc on International Conference on Automated Planning and Scheduling10.5555/3038794.3038811(136-144)Online publication date: 21-Jun-2014
    • (2012)Risk-variant policy switching to exceed reward thresholdsProceedings of the Twenty-Second International Conference on International Conference on Automated Planning and Scheduling10.5555/3038546.3038557(83-91)Online publication date: 25-Jun-2012
    • (2011)Computing rank dependent utility in graphical models for sequential decision problemsArtificial Intelligence10.1016/j.artint.2010.11.019175:7-8(1366-1389)Online publication date: 1-May-2011
    • (2010)Risk-sensitive planning in partially observable environmentsProceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 110.5555/1838206.1838384(1357-1368)Online publication date: 10-May-2010
    • (2008)Rank-Dependent probability weighting in sequential decision problems under uncertaintyProceedings of the Eighteenth International Conference on International Conference on Automated Planning and Scheduling10.5555/3037281.3037301(148-155)Online publication date: 14-Sep-2008

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media