Related papers: Fictitious Play in $3\times 3$ games: chaos and di…
This article explores the interaction of two agents during a geopolitical operation. Collaborative work is considered, rather than being done alone. However, each agent has the goal of maximizing personal net profit. We will have 3…
We examine the long-run behavior of a wide range of dynamics for learning in nonatomic games, in both discrete and continuous time. The class of dynamics under consideration includes fictitious play and its regularized variants, the…
We study a three-player variation of the impartial avoidance game introduced by Anderson and Harary. Three players take turns selecting previously-unselected elements of a finite group. The losing player is the one who selects an element…
We investigate how well continuous-time fictitious play in two-player games performs in terms of average payoff, particularly compared to Nash equilibrium payoff. We show that in many games, fictitious play outperforms Nash equilibrium on…
We introduce a geometric dynamical system where iteration is defined as a cycling composition of different maps acting on a space composed of three or more lines in $\mathbb{R}^2$. This system is motivated by the dynamics of iterated…
A discrete-time version of the replicator equation for two-strategy games is studied. The stationary properties differ from that of continuous time for sufficiently large values of the parameters, where periodic and chaotic behavior replace…
An important task in the analysis of multiagent systems is to understand how groups of selfish players can form coalitions, i.e., work together in teams. In this paper, we study the dynamics of coalition formation under bounded rationality.…
This paper considers information sharing in a multi-player repeated game. Every round, each player observes a subset of components of a random vector and then takes a control action. The utility earned by each player depends on the full…
Modern applications require robots to comply with multiple, often conflicting rules and to interact with the other agents. We present Posetal Games as a class of games in which each player expresses a preference over the outcomes via a…
We introduce and prove numerous new results about the orbits of the $T$-fractal billiard. Specifically, in Section 3, we give a variety of sufficient conditions for the existence of a sequence of compatible periodic orbits. In Section 4, we…
Inspired by asynchronous cooperative Parrondo's games we introduce two new types of games in which all players simultaneously play game A or game B or a combination of these two games. These two types of games differ in the way a…
Spatial evolutionary games provide a valuable framework for elucidating the emergence and maintenance of cooperative behavior. However, most previous studies assume that individuals are profiteers and neglect to consider the effects of…
In this paper we introduce novel algorithmic strategies for effciently playing two-player games in which the players have different or identical player roles. In the case of identical roles, the players compete for the same objective (that…
We analyze a nonlinear discrete-time Cournot duopoly game, where players have heterogeneous expectations. Two types of players are considered: boundedly rational and naive expectations. In this study we show that the dynamics of the duopoly…
The paper is concerned with distributed learning in large-scale games. The well-known fictitious play (FP) algorithm is addressed, which, despite theoretical convergence results, might be impractical to implement in large-scale settings due…
In this work we analyze an evolutionary game that incorporates the ideas presented by Cipolla in his work \textit{The fundamental laws of human stupidity}. The game considers four strategies, three of them are inherent to the player…
A patient player privately observes a persistent state that directly affects his myopic opponents' payoffs, and can be one of the several commitment types that plays the same mixed action in every period. I characterize the set of…
In this note we discuss a theory of combinatorial games that involve transmitting the moves through a noisy channel that can introduce errors during the transmission. Players are aware of this interference and incorporate this variable into…
Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players. We identify a class of games for which joint winning…
We consider a 3-player game in the normal form, in which each player has two actions. We assume that the game is symmetric and repeated infinitely many times. At each stage players make their choices knowing only the average payoffs from…