Related papers: On the Equilibria Computation of Set-Valued Lur'e …
A Nash equilibrium has become important solution concept for analyzing the decision making in Game theory. In this paper, we consider the problem of computing Nash equilibria of a subclass of generic finite normal form games. We define…
Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing demand on Nash equilibrium computation, especially for Internet…
This work proposes a novel set of techniques for approximating a Nash equilibrium in a finite, normal-form game. It achieves this by constructing a new reformulation as solving a parameterized system of multivariate polynomials with tunable…
We consider a class of games with continuum of players where equilibria can be obtained by the minimization of a certain functional related to optimal transport as emphasized in [7]. We then use the powerful entropic regularization…
We study the problem of computing all Nash equilibria of a subclass of finite normal form games. With algebraic characterization of the games, we present a method for computing all its Nash equilibria. Further, we present a method for…
In this work, we present a novel characterization of approximate Nash equilibria in a class of convex games over the simplex. To achieve this, we regularize the utility functions using the Shannon entropy term, connect the solutions to the…
The Nash equilibrium is an important benchmark for behaviour in systems of strategic autonomous agents. Polymatrix games are a succinct and expressive representation of multiplayer games that model pairwise interactions between players. The…
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing optimal strategies and the values of competitive games…
Nash equilibria are crucial for understanding game behavior and systems in economics, physics, biology, and computer science. A significant application arises from the connection between Nash equilibria and optimization problems . However,…
Motivated by the fact that in many game-theoretic settings, the game analyzed is only an approximation to the game being played, in this work we analyze equilibrium computation for the broad and natural class of bimatrix games that are…
We propose a framework to compute approximate Nash equilibria in integer programming games with nonlinear payoffs, i.e., simultaneous and non-cooperative games where each player solves a parametrized mixed-integer nonlinear program. We…
We consider seeking a Nash equilibrium (NE) of a monotone game, played by dynamic agents which are modeled as a class of lower-triangular nonlinear uncertain dynamics with external disturbances. We establish a general framework that…
This paper presents a novel data-driven approach for approximating the $\varepsilon$-Nash equilibrium in continuous-time linear quadratic Gaussian (LQG) games, where multiple agents interact with each other through their dynamics and…
Dynamic nonzero sum games are widely used to model multi agent decision making in control, economics, and related fields. Classical methods for computing Nash equilibria, especially in linear quadratic settings, rely on strong structural…
We compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with pre-fixed structure. Using this representation, we show conditions under which a game has the maximum possible number of this…
In this paper, we study the problem of learning the set of pure strategy Nash equilibria and the exact structure of a continuous-action graphical game with quadratic payoffs by observing a small set of perturbed equilibria. A…
This paper develops a novel methodology to study robust stability properties of Nash equilibrium points in dynamic games. Small-gain techniques in modern mathematical control theory are used for the first time to derive conditions…
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structures of the graph (in particular elementary cycles) and the set…
This work proposes a novel distributed approach for computing a Nash equilibrium in convex games with restricted strongly monotone pseudo-gradients. By leveraging the idea of the centralized operator extrapolation method presented in [4] to…
A new class of projected dynamical systems of third order is investigated for quasi (parametric) variational inequalities in which the convex set in the classical variational inequality also depends upon the solution explicitly or…