Computational Results for Extensive-Form Adversarial Team Games
暂无分享,去创建一个
[1] Avrim Blum,et al. Planning in the Presence of Cost Functions Controlled by an Adversary , 2003, ICML.
[2] Adam Tauman Kalai,et al. The myth of the folk theorem , 2008, Games Econ. Behav..
[3] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .
[4] D. Koller,et al. The complexity of two-person zero-sum games in extensive form , 1992 .
[5] Nicola Basilico,et al. Team-Maxmin Equilibrium: Efficiency Bounds and Algorithms , 2016, AAAI.
[6] Milind Tambe,et al. Security and Game Theory - Algorithms, Deployed Systems, Lessons Learned , 2011 .
[7] Yoav Shoham,et al. Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .
[8] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[9] Giorgio Ausiello,et al. Theoretical Computer Science Approximate Solution of Np Optimization Problems * , 2022 .
[10] Nikolaos V. Sahinidis,et al. A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..
[11] B. Stengel,et al. Efficient Computation of Behavior Strategies , 1996 .
[12] David P. Williamson,et al. The Design of Approximation Algorithms , 2011 .
[13] L. S. Shapley,et al. 3. BASIC SOLUTIONS OF DISCRETE GAMES , 1951 .
[14] Kristoffer Arnsfelt Hansen,et al. Approximability and Parameterized Complexity of Minmax Values , 2008, WINE.
[15] Vincent Conitzer,et al. Computing the optimal strategy to commit to , 2006, EC '06.
[16] R. Aumann. Subjectivity and Correlation in Randomized Strategies , 1974 .
[17] B. Stengel,et al. Team-Maxmin Equilibria☆ , 1997 .
[18] R. Selten. Reexamination of the perfectness concept for equilibrium points in extensive games , 1975, Classics in Game Theory.
[19] F. Forges. Published by: The , 2022 .
[20] Bernhard von Stengel,et al. Extensive-Form Correlated Equilibrium: Definition and Computational Complexity , 2008, Math. Oper. Res..
[21] Tuomas Sandholm,et al. Combining local search techniques and path following for bimatrix games , 2012, UAI.
[22] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[23] H. W. Kuhn,et al. 11. Extensive Games and the Problem of Information , 1953 .
[24] J. Mertens,et al. ON THE STRATEGIC STABILITY OF EQUILIBRIA , 1986 .