English
Related papers

Related papers: On Robustness Properties in Empirical Centroid Fic…

200 papers

Counterfactual Regret Minimization (CFR) and its variants developed based upon Regret Matching (RM) have been considered to be the best method to solve incomplete information extensive form games. In addition to RM and CFR, Fictitious Play…

Computer Science and Game Theory · Computer Science 2023-11-14 Qi Ju

Self-play reinforcement learning has demonstrated significant success in learning complex strategic and interactive behaviors in competitive multi-agent games. However, achieving such behaviors in continuous decision spaces remains…

Machine Learning · Computer Science 2025-11-18 Akash Karthikeyan , Yash Vardhan Pant

We study two-layer neural networks in the mean field limit, where the number of neurons tends to infinity. In this regime, the optimization over the neuron parameters becomes the optimization over the probability measures, and by adding an…

Optimization and Control · Mathematics 2023-08-17 Fan Chen , Zhenjie Ren , Songbo Wang

In this paper we introduce the novel framework of distributionally robust games. These are multi-player games where each player models the state of nature using a worst-case distribution, also called adversarial distribution. Thus each…

Optimization and Control · Mathematics 2017-07-25 Dario Bauso , Jian Gao , Hamidou Tembine

Hindsight rationality is an approach to playing general-sum games that prescribes no-regret learning dynamics for individual agents with respect to a set of deviations, and further describes jointly rational behavior among multiple agents…

Computer Science and Game Theory · Computer Science 2022-06-03 Dustin Morrill , Ryan D'Orazio , Marc Lanctot , James R. Wright , Michael Bowling , Amy R. Greenwald

We study a class of stochastic dynamic games that exhibit strategic complementarities between players; formally, in the games we consider, the payoff of a player has increasing differences between her own state and the empirical…

Computer Science and Game Theory · Computer Science 2010-12-13 Sachin Adlakha , Ramesh Johari

In this paper, we apply the idea of fictitious play to design deep neural networks (DNNs), and develop deep learning theory and algorithms for computing the Nash equilibrium of asymmetric $N$-player non-zero-sum stochastic differential…

Optimization and Control · Mathematics 2020-09-07 Ruimeng Hu

We investigate convergence of decentralized fictitious play (DFP) in near-potential games, wherein agents preferences can almost be captured by a potential function. In DFP agents keep local estimates of other agents' empirical frequencies,…

Computer Science and Game Theory · Computer Science 2022-01-31 Sarper Aydin , Sina Arefizadeh , Ceyhun Eksin

A mean-field game (MFG) seeks the Nash Equilibrium of a game involving a continuum of players, where the Nash Equilibrium corresponds to a fixed point of the best-response mapping. However, simple fixed-point iterations do not always…

Optimization and Control · Mathematics 2025-07-15 Jiajia Yu , Xiuyuan Cheng , Jian-Guo Liu , Hongkai Zhao

Hindsight rationality is an approach to playing general-sum games that prescribes no-regret learning dynamics for individual agents with respect to a set of deviations, and further describes jointly rational behavior among multiple agents…

Computer Science and Game Theory · Computer Science 2022-06-24 Dustin Morrill , Ryan D'Orazio , Marc Lanctot , James R. Wright , Michael Bowling , Amy Greenwald

A recent emerging trend in the literature on learning in games has been concerned with providing faster learning dynamics for correlated and coarse correlated equilibria in normal-form games. Much less is known about the significantly more…

Computer Science and Game Theory · Computer Science 2022-02-14 Ioannis Anagnostides , Gabriele Farina , Christian Kroer , Andrea Celli , Tuomas Sandholm

Considering the interaction through mutual interference of the different radio devices, the channel selection (CS) problem in decentralized parallel multiple access channels can be modeled by strategic-form games. Here, we show that the CS…

Computer Science and Game Theory · Computer Science 2010-09-28 S. M. Perlaza , H. Tembine , S. Lasaulce , V. Quintero-Florez

We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously;…

Computer Science and Game Theory · Computer Science 2012-01-04 Krishnendu Chatterjee

We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of…

Computer Science and Game Theory · Computer Science 2014-04-24 Krishnendu Chatterjee , Rasmus Ibsen-Jensen

We initiate the study of trembling-hand perfection in sequential (i.e., extensive-form) games with correlation. We introduce the extensive-form perfect correlated equilibrium (EFPCE) as a refinement of the classical extensive-form…

Computer Science and Game Theory · Computer Science 2020-12-14 Alberto Marchesi , Nicola Gatti

High level declarative constraints provide a powerful (and popular) way to define and construct control policies; however, most synthesis algorithms do not support specifying the degree of randomness (unpredictability) of the resulting…

Robotics · Computer Science 2021-06-30 Marcell Vazquez-Chanlatte , Sebastian Junges , Daniel J. Fremont , Sanjit Seshia

Certain but important classes of strategic-form games, including zero-sum and identical-interest games, have the fictitious-play-property (FPP), i.e., beliefs formed in fictitious play dynamics always converge to a Nash equilibrium (NE) in…

Computer Science and Game Theory · Computer Science 2022-05-24 Muhammed O. Sayin , Kaiqing Zhang , Asuman Ozdaglar

Understanding team formations and player positioning is crucial for tactical analysis in football (soccer). This paper presents a flexible method for formation recognition and player position assignment in football using predefined static…

Machine Learning · Computer Science 2025-07-01 Joris Bekkers

Fictitious play (FP) is a natural learning dynamic in two-player zero-sum games. Samuel Karlin conjectured in 1959 that FP converges at a rate of $O(t^{-1/2})$ to Nash equilibrium, where $t$ is the number of steps played. However,…

Computer Science and Game Theory · Computer Science 2025-07-15 Yuanhao Wang

In general, two-agent decision-making problems can be modeled as a two-player game, and a typical solution is to find a Nash equilibrium in such game. Counterfactual regret minimization (CFR) is a well-known method to find a Nash…

Computer Science and Game Theory · Computer Science 2020-12-07 Huale Li , Xuan Wang , Shuhan Qi , Jiajia Zhang , Yang Liu , Yulin Wu , Fengwei Jia