ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Artificial Intelligence
Volume 172, Issues 8-9, May 2008, Pages 1018-1044
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (364 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.artint.2007.11.008    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2008 Elsevier B.V. All rights reserved.

Complexity results and algorithms for possibilistic influence diagrams

Laurent Garciaa, E-mail The Corresponding Author and Régis Sabbadinb, Corresponding Author Contact Information, E-mail The Corresponding Author

aLERIA, University of Angers, France bINRA-BIA Toulouse, France

Received 30 November 2006; 
revised 27 November 2007; 
accepted 27 November 2007. 
Available online 8 December 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

In this article we present the framework of Possibilistic Influence Diagrams (PID), which allows to model in a compact form problems of sequential decision making under uncertainty, when only ordinal data on transitions likelihood or preferences are available. The graphical part of a PID is exactly the same as that of usual influence diagrams, however the semantics differ. Transition likelihoods are expressed as possibility distributions and rewards are here considered as satisfaction degrees. Expected utility is then replaced by anyone of the two possibilistic qualitative utility criteria (optimistic and pessimistic) for evaluating strategies in a PID. We then describe decision tree-based methods for evaluating PID and computing optimal strategies and we study the computational complexity of PID optimisation problems for both cases. Finally, we propose a dedicated variable elimination algorithm that can be applied to both optimistic and pessimistic cases for solving PID.

Keywords: Decision theory; Possibility theory; Causal networks; Influence diagrams


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.