Near-Optimal Interdiction of Factored MDPs
暂无分享,去创建一个
[1] Vincent Conitzer,et al. Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness , 2011, J. Artif. Intell. Res..
[2] Carlos Guestrin,et al. Max-norm Projections for Factored MDPs , 2001, IJCAI.
[3] Daphne Koller,et al. Computing Factored Value Functions for Policies in Structured MDPs , 1999, IJCAI.
[4] Jesse Hoey,et al. APRICODD: Approximate Policy Construction Using Decision Diagrams , 2000, NIPS.
[5] D. Koller,et al. Planning under uncertainty in complex structured environments , 2003 .
[6] Yevgeniy Vorobeychik,et al. Optimal interdiction of attack plans , 2013, AAMAS.
[7] Daphne Koller,et al. Policy Iteration for Factored MDPs , 2000, UAI.
[8] Shobha Venkataraman,et al. Efficient Solution Algorithms for Factored MDPs , 2003, J. Artif. Intell. Res..
[9] Craig Boutilier,et al. Decision-Theoretic Planning: Structural Assumptions and Computational Leverage , 1999, J. Artif. Intell. Res..
[10] Ryan O'Donnell,et al. Some topics in analysis of boolean functions , 2008, STOC.
[11] Sarit Kraus,et al. Bayesian stackelberg games and their application for security at Los Angeles international airport , 2008, SECO.
[12] Craig Boutilier,et al. Stochastic dynamic programming with factored representations , 2000, Artif. Intell..
[13] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[14] Thomas G. Dietterich. Hierarchical Reinforcement Learning with the MAXQ Value Function Decomposition , 1999, J. Artif. Intell. Res..
[15] Sarit Kraus,et al. Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games , 2008, AAMAS.