Learning Optimal Commitment to Overcome Insecurity
暂无分享,去创建一个
[1] Vincent Conitzer,et al. Learning and Approximating the Optimal Strategy to Commit To , 2009, SAGT.
[2] Michael Brückner,et al. Double Description Method , 2013 .
[3] P. Gács,et al. Khachiyan’s algorithm for linear programming , 1981 .
[4] Komei Fukuda,et al. Double Description Method Revisited , 1995, Combinatorics and Computer Science.
[5] Milind Tambe,et al. Approximation methods for infinite Bayesian Stackelberg games: modeling distributional payoff uncertainty , 2011, AAMAS.
[6] Sarit Kraus,et al. Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games , 2008, AAMAS.
[7] H. Raiffa,et al. 3. The Double Description Method , 1953 .
[8] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[9] Vincent Conitzer,et al. Computing the optimal strategy to commit to , 2006, EC '06.
[10] Vincent Conitzer,et al. Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness , 2011, J. Artif. Intell. Res..
[11] Milind Tambe,et al. Security and Game Theory - Algorithms, Deployed Systems, Lessons Learned , 2011 .
[12] Vincent Conitzer,et al. Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games , 2010, AAAI.
[13] Sarit Kraus,et al. Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition , 2010, Artif. Intell..
[14] Santosh S. Vempala,et al. Simulated Annealing for Convex Optimization , 2004 .
[15] Gerald Tesauro,et al. Playing repeated Stackelberg games with unknown opponents , 2012, AAMAS.