| Human-level play in the game of Diplomacy by combining language models with strategic reasoning Meta Fundamental AI Research Diplomacy Team (FAIR)†, A Bakhtin, ... Science 378 (6624), 1067-1074, 2022 | 76 | 2022 |
| Online convex optimization for sequential decision processes and extensive-form games G Farina, C Kroer, T Sandholm Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1917-1925, 2019 | 60 | 2019 |
| No-regret learning dynamics for extensive-form correlated equilibrium A Celli, A Marchesi, G Farina, N Gatti Advances in Neural Information Processing Systems 33, 7722-7732, 2020 | 52 | 2020 |
| Faster game solving via predictive Blackwell approachability: Connecting regret matching and mirror descent G Farina, C Kroer, T Sandholm Proceedings of the AAAI Conference on Artificial Intelligence 35 (6), 5363-5371, 2021 | 46 | 2021 |
| Ex ante coordination and collusion in zero-sum multi-player extensive-form games G Farina, A Celli, N Gatti, T Sandholm Advances in Neural Information Processing Systems 31, 2018 | 44 | 2018 |
| Solving large sequential games with the excessive gap technique C Kroer, G Farina, T Sandholm Advances in Neural Information Processing Systems, 864-874, 2018 | 44 | 2018 |
| Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions. G Farina, C Kroer, T Sandholm Conference on Neural Information Processing Systems, 2019 | 43 | 2019 |
| Correlation in extensive-form games: Saddle-point formulation and benchmarks G Farina, CK Ling, F Fang, T Sandholm Advances in Neural Information Processing Systems, 9233-9243, 2019 | 41 | 2019 |
| Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games I Anagnostides, C Daskalakis, G Farina, M Fishelson, N Golowich, ... Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 37 | 2022 |
| Modeling strong and human-like gameplay with KL-regularized search AP Jacob, DJ Wu, G Farina, A Lerer, H Hu, A Bakhtin, J Andreas, N Brown International Conference on Machine Learning, 9695-9728, 2022 | 33 | 2022 |
| Regret Circuits: Composability of Regret Minimizers G Farina, C Kroer, T Sandholm Thirty-sixth International Conference on Machine Learning, 2019 | 33 | 2019 |
| Regret minimization in behaviorally-constrained zero-sum games G Farina, C Kroer, T Sandholm International Conference on Machine Learning, 1107-1116, 2017 | 33 | 2017 |
| Stable-Predictive Optimistic Counterfactual Regret Minimization G Farina, C Kroer, N Brown, T Sandholm Thirty-sixth International Conference on Machine Learning, 2019 | 31 | 2019 |
| Robust Stackelberg equilibria in extensive-form games and extension to limited lookahead C Kroer, G Farina, T Sandholm Thirty-Second AAAI Conference on Artificial Intelligence, 2018 | 30 | 2018 |
| Stochastic regret minimization in extensive-form games G Farina, C Kroer, T Sandholm International Conference on Machine Learning, 3018-3028, 2020 | 27 | 2020 |
| Simple uncoupled no-regret learning dynamics for extensive-form correlated equilibrium G Farina, A Celli, A Marchesi, N Gatti Journal of the ACM 69 (6), 1-41, 2022 | 26 | 2022 |
| Coarse correlation in extensive-form games G Farina, T Bianchi, T Sandholm Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1934-1941, 2020 | 25 | 2020 |
| On last-iterate convergence beyond zero-sum games I Anagnostides, I Panageas, G Farina, T Sandholm International Conference on Machine Learning, 536-581, 2022 | 24 | 2022 |
| Smoothing Method for Approximate Extensive-Form Perfect Equilibrium C Kroer, G Farina, T Sandholm International Joint Conferences on Artificial Intelligence, 2017 | 24 | 2017 |
| Extensive-Form Perfect Equilibrium Computation in Two-Player Games G Farina, N Gatti AAAI Conference on Artificial Intelligence, 2017 | 23 | 2017 |
Tuomas SandholmAngel Jordan University Professor of Computer Science, Carnegie Mellon UniversityПотвърден имейл адрес: cs.cmu.edu
