Related papers: The generalized Nash game proposed by Rosen
In this paper, we present a novel consensus-based zeroth-order algorithm tailored for non-convex multiplayer games. The proposed method leverages a metaheuristic approach using concepts from swarm intelligence to reliably identify global…
A new combinatorial game is given. It generalizes both Substraction and Nim. It is proved the computation of Nash equilibrium points in this new game is NP-hard.
We study Nash equilibria for the deterministic ergodic N-players game. We introduce pure strategies, mixed strategies and Nash equilibria associated with those. We show that a Nash equilibrium in mixed strategies exists and it is a Mather…
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 introduce a new mean field kinetic model for systems of rational agents interacting in a game theoretical framework. This model is inspired from non-cooperative anonymous games with a continuum of players and Mean-Field Games. The large…
Due to the lack of coordination, it is unlikely that the selfish players of a strategic game reach a socially good state. A possible way to cope with selfishness is to compute a desired outcome (if it is tractable) and impose it. However…
We consider a generalized Nash equilibrium problem (GNEP) for a network of players. Each player tries to minimize a local objective function subject to some resource constraints where both the objective functions and the resource…
In this article we study the convergence of the Nash Equilibria in a N-player differential game towards the optimal strategies in the Mean Field Games, when the dynamic of the generic player includes a reflection process which guarantees…
The emergence of cooperation figures among the main goal of game theory in competitive-cooperative environments. Potential games have long been hinted as viable alternatives to study realistic player behavior. Here, we expand the potential…
We propose a simple yet rich model to extend the notions of Nash equilibria and correlated equilibria of strategic games to the quantum setting, in which we then study the relations between classical and quantum equilibria. Unlike the…
This paper develops a distributed Nash Equilibrium seeking algorithm for heterogeneous multi-robot systems. The algorithm utilises distributed optimisation and output control to achieve the Nash equilibrium by leveraging information shared…
In this paper, we consider stochastic monotone Nash games where each player's strategy set is characterized by possibly a large number of explicit convex constraint inequalities. Notably, the functional constraints of each player may depend…
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…
In the present work we deal with set-valued equilibrium problems for which we provide sufficient conditions for the existence of a solution. The conditions that we consider are imposed not on the whole domain, but rather on a self…
Inspired by a paper of R. W. Rosenthal, we investigate generalized Nash-equilibria of integer programming games. We show that generalized Nash-equilibria always exist and are related to an optimal solution of a so-called N-fold integer…
Generalized Nash equilibrium problem (GNEP) is fundamental for practical applications where multiple self-interested agents work together to make optimal decisions. In this work, we study GNEP with shared distributionally robust chance…
We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike.…
We present a polynomial-time algorithm that always finds an (approximate) Nash equilibrium for repeated two-player stochastic games. The algorithm exploits the folk theorem to derive a strategy profile that forms an equilibrium by…
This paper considers the privacy-preserving Nash equilibrium seeking strategy design for a class of networked aggregative games, in which the players' objective functions are considered to be sensitive information to be protected. In…
The concept of Nash equilibrium in behavioral strategies (NashEBS) was formulated By Nash~\cite{Nash (1951)} for an extensive-form game through global rationality of nonconvex payoff functions. Kuhn's payoff equivalence theorem resolves the…