Related papers: Generalized Ordinal Nash Games: Variational Approa…

In this paper, we investigate the noncooperative games of multi-agent systems. Different from existing noncooperative games, our formulation involves the high-order nonlinear dynamics of players, and the communication topologies among…

The paper explores n-player multi-objective interval differential games, where the terminal payoff function and integral payoff function of players are both interval-vector-valued functions. Firstly, by leveraging the partial order…

We introduce a general representation of large-population games in which each player s influence ON the others IS centralized AND limited, but may otherwise be arbitrary.This representation significantly generalizes the class known AS…

We study the problem of computing an approximate Nash equilibrium of a game whose strategy space is continuous without access to gradients of the utility function. Such games arise, for example, when players' strategies are represented by…

We study public goods games, a type of game where every player has to decide whether or not to produce a good which is public, i.e., neighboring players can also benefit from it. Specifically, we consider a setting where the good is…

We present a framework for computing approximate mixed-strategy Nash equilibria of continuous-action games. It is a modification of the traditional double oracle algorithm, extended to multiple players and continuous action spaces. Unlike…

Public goods games in undirected networks are generally known to have pure Nash equilibria, which are easy to find. In contrast, we prove that, in directed networks, a broad range of public goods games have intractable equilibrium problems:…

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…

We investigate the existence of certain types of equilibria (Nash, $\varepsilon$-Nash, subgame perfect, $\varepsilon$-subgame perfect, Pareto-optimal) in multi-player multi-outcome infinite sequential games. We use two fundamental…

This paper explores distributed Nash equilibrium seeking problems for games in which the players have limited knowledge on other players' actions. In particular, the involved players are considered to be high-order integrators with their…

We consider existence and uniqueness of Nash equilibria in an $N$-player game of utility maximization under relative performance criteria of multiplicative form in complete semimartingale markets. For a large class of players' utility…

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…

Strategic games admit a multi-graph representation, in which two kinds of relations, accessibility, and preferences, are used to describe how the players compare the possible outcomes. A category of games with a fixed set of players…

This paper introduces a class of games, called unit-sphere games, where strategies are real vectors with unit 2-norms (or, on a unit-sphere). As a result, they can no longer be interpreted as probability distributions over actions, but…

A classic model to study strategic decision making in multi-agent systems is the normal-form game. This model can be generalised to allow for an infinite number of pure strategies leading to continuous games. Multi-objective normal-form…

We present two distributed algorithms for the computation of a generalized Nash equilibrium in monotone games. The first algorithm follows from a forward-backward-forward operator splitting, while the second, which requires the…

We prove the existence of Bayesian Nash Equilibrium (BNE) of general-sum Bayesian games with continuous types and finite actions under the conditions that the utility functions and the prior type distributions are continuous concerning the…

We consider a general-sum N-player linear-quadratic game with stochastic dynamics over a finite horizon and prove the global convergence of the natural policy gradient method to the Nash equilibrium. In order to prove the convergence of the…

Playing a symmetric bi-matrix game is usually physically implemented by sharing pairs of 'objects' between two players. A new setting is proposed that explicitly shows effects of quantum correlations between the pairs on the structure of…

This paper introduces risk-revising players to a class of games with incomplete information. These players enter the game with ex ante risk preferences represented by coherent risk measures and develop time-consistent interim revisions of…