Abstract
We present a new algorithm for exactly solving decision-making problems represented as an influence diagram. We do not require the usual assumptions of no forgetting and regularity, which allows us to solve problems with limited information. The algorithm, which implements a sophisticated variable elimination procedure, is empirically shown to outperform a state-of-the-art algorithm in randomly generated problems of up to 150 variables and 10 64 strategies.
Original language | English |
---|---|
Title of host publication | Proceedings of 25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011 |
Pages | 603-611 |
Number of pages | 9 |
Publication status | Published - 1 Dec 2011 |
Externally published | Yes |
Event | 25th Annual Conference on Neural Information Processing Systems, NIPS 2011 - Granada, Spain Duration: 12 Dec 2011 → 14 Dec 2011 Conference number: 25 |
Publication series
Name | Advances in Neural Information Processing Systems |
---|---|
Volume | 24 |
Conference
Conference | 25th Annual Conference on Neural Information Processing Systems, NIPS 2011 |
---|---|
Abbreviated title | NIPS 2011 |
Country/Territory | Spain |
City | Granada |
Period | 12/12/11 → 14/12/11 |
Bibliographical note
(spotlight presentation, double-blind peer reviewed by >3 reviewers)Keywords
- influence diagrams