Related papers: Infinite sequential Nash equilibrium
Establishing the existence of Nash equilibria for partially observed stochastic dynamic games is known to be quite challenging, with the difficulties stemming from the noisy nature of the measurements available to individual players…
Consider a set of agents who play a network game repeatedly. Agents may not know the network. They may even be unaware that they are interacting with other agents in a network. Possibly, they just understand that their payoffs depend on an…
Contemporary applications of machine learning in two-team e-sports and the superior expressivity of multi-agent generative adversarial networks raise important and overlooked theoretical questions regarding optimization in two-team games.…
In the traditional game-theoretic set up, where agents select actions and experience corresponding utilities, an equilibrium is a configuration where no agent can improve their utility by unilaterally switching to a different action. In…
We use techniques from the statistical mechanics of disordered systems to analyse the properties of Nash equilibria of bimatrix games with large random payoff matrices. By means of an annealed bound, we calculate their number and analyse…
We analyze the performance of the best-response dynamic across all normal-form games using a random games approach. The playing sequence -- the order in which players update their actions -- is essentially irrelevant in determining whether…
Many efficient algorithms have been designed to recover Nash equilibria of various classes of finite games. Special classes of continuous games with infinite strategy spaces, such as polynomial games, can be solved by semidefinite…
Synthesis of finite-state controllers from high-level specifications in multi-agent systems can be reduced to solving multi-player concurrent games over finite graphs. The complexity of solving such games with qualitative objectives for…
A noncooperative differential (dynamic) game model of opinion dynamics is proposed. In this game, the agents' motives are shaped by their expectations of the nature of others' opinions as well as how susceptible they are to get influenced…
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…
For any two-by-two game $\G$, we define a new two-player game $\G^Q$. The definition is motivated by a vision of players in game $\G$ communicating via quantum technology according to a certain standard protocol originally introduced by…
We provide a game-theoretic analysis of consensus, assuming that processes are controlled by rational agents and may fail by crashing. We consider agents that \emph{care only about consensus}: that is, (a) an agent's utility depends only on…
Graphon games are a class of games with a continuum of agents, introduced to approximate the strategic interactions in large network games. The first result of this study is an equilibrium existence theorem in graphon games, under the same…
One of the natural objectives of the field of the social networks is to predict agents' behaviour. To better understand the spread of various products through a social network arXiv:1105.2434 introduced a threshold model, in which the nodes…
We consider the relation between Sion's minimax theorem for a continuous function and a Nash equilibrium in a multi-players game with two groups which is zero-sum and symmetric in each group. We will show the following results. 1. The…
We consider a system of single- or double integrator agents playing a generalized Nash game over a network, in a partial-information scenario. We address the generalized Nash equilibrium seeking problem by designing a fully-distributed…
We introduce a novel class of Nash equilibrium seeking dynamics for non-cooperative games with a finite number of players, where the convergence to the Nash equilibrium is bounded by a KL function with a settling time that can be upper…
Games with incomplete preferences are an important model for studying rational decision-making in scenarios where players face incomplete information about their preferences and must contend with incomparable outcomes. We study the problem…
Nash equilibrium serves as a fundamental mathematical tool in economics and game theory. However, it classically assumes knowledge of player utilities, whereas economics generally regards preferences as more fundamental. To leverage…
For a mean field game model with a major and infinite minor players, we characterize a notion of Nash equilibrium via a system of so-called master equations, namely a system of nonlinear transport equations in the space of measures. Then,…