Solving extensive-form games with double-oracle methods
暂无分享,去创建一个
[1] Milind Tambe,et al. Security and Game Theory - Algorithms, Deployed Systems, Lessons Learned , 2011 .
[2] Branislav Bosanský,et al. Computing time-dependent policies for patrolling games with mobile targets , 2011, AAMAS.
[3] Avrim Blum,et al. Planning in the Presence of Cost Functions Controlled by an Adversary , 2003, ICML.
[4] Branislav Bosanský,et al. Using Double-Oracle Method and Serialized Alpha-Beta Search for Pruning in Simultaneous Move Games , 2013, IJCAI.
[5] Branislav Bosanský,et al. Iterative Algorithm for Solving Two-player Zero-sum Extensive-form Games with Imperfect Information , 2012, ECAI.
[6] Michael H. Bowling,et al. Regret Minimization in Games with Incomplete Information , 2007, NIPS.
[7] Marc Lanctot,et al. Computing Approximate Nash Equilibria and Robust Best-Responses Using Sampling , 2011, J. Artif. Intell. Res..
[8] D. Koller,et al. Efficient Computation of Equilibria for Extensive Two-Person Games , 1996 .
[9] Kevin Waugh,et al. Monte Carlo Sampling for Regret Minimization in Extensive Games , 2009, NIPS.
[10] Javier Peña,et al. Smoothing Techniques for Computing Nash Equilibria of Sequential Games , 2010, Math. Oper. Res..
[11] Branislav Bosanský,et al. Double-oracle algorithm for computing an exact nash equilibrium in zero-sum extensive-form games , 2013, AAMAS.