Selecting Strategies for Infinite-Horizon Dynamic LIMIDS

Marcel van Gerven, Francisco Javier Díez
2006 European Workshop on Probabilistic Graphical Models  
In previous work we have introduced dynamic limited-memory influence diagrams (DLIM-IDs) as an extension of LIMIDs aimed at representing infinite-horizon decision processes. If a DLIMID respects the first-order Markov assumption then it can be represented by 2TLIMIDS. Given that the treatment selection algorithm for LIMIDs, called single policy updating (SPU), can be infeasible even for small finite-horizon models, we propose two alternative algorithms for treatment selection with 2TLIMIDS.
more » ... t, single rule updating (SRU) is a hill-climbing method inspired upon SPU which needs not iterate exhaustively over all possible policies at each decision node. Second, a simulated annealing algorithm can be used to avoid the local-maximum policies found by SPU and SRU.
dblp:conf/pgm/GervenD06 fatcat:zz7ekshkavhjvoyy34qe3q64va