Related papers: On local uniqueness of normalized Nash equilibria
This paper considers a class of generalized convex games where each player is associated with a convex objective function, a convex inequality constraint and a convex constraint set. The players aim to compute a Nash equilibrium through…
Existence and uniqueness of solutions for nonlocal Cahn-Hilliard equations with degenerate potential is shown. The nonlocality is described by means of a symmetric singular kernel not falling within the framework of any previous existence…
Congestion games offer a primary model in the study of pure Nash equilibria in non-cooperative games, and a number of generalized models have been proposed in the literature. One line of generalization includes weighted congestion games, in…
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…
Several notions of game enjoy a Nash-like notion of equilibrium without guarantee of existence. There are different ways of weakening a definition of Nash-like equilibrium in order to guarantee the existence of a weakened equilibrium.…
In this paper we study the existence and uniqueness of Nash equilibria (solution to competition-wise problems, with several controls trying to reach possibly different goals) associated to linear partial differential equations and show…
In this paper, we propose an asynchronous distributed algorithm for the computation of generalized Nash equilibria in noncooperative games, where the players interact via an undirected communication graph. Specifically, we extend the paper…
We study the existence and computation of Nash equilibria in concave games where the players' admissible strategies are subject to shared coupling constraints. Under playerwise concavity of constraints, we prove existence of Nash…
Although it has been known since the 1970s that a globally optimal strategy profile in a common-payoff game is a Nash equilibrium, global optimality is a strict requirement that limits the result's applicability. In this work, we show that…
We address Nash equilibrium problems in a partial-decision information scenario, where each agent can only exchange information with some neighbors, while its cost function possibly depends on the strategies of all agents. We characterize…
In this work, we study the distributed Nash equilibrium seeking problem for monotone generalized noncooperative games with set constraints and shared affine inequality constraints. A distributed regularized penalty method is proposed. The…
Computational aspects of solution notions such as Nash equilibrium have been extensively studied, including settings where the ultimate goal is to find an equilibrium that possesses some additional properties. Furthermore, in order to…
We consider a repeatedly played generalized Nash equilibrium game. This induces a multi-agent online learning problem with joint constraints. An important challenge in this setting is that the feasible set for each agent depends on the…
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…
In this paper, we consider a class of infinitely degenerate partial differential systems to obtain the Nash equilibria in the mean field games. The degeneracy in the diffusion and the Hamiltonian may be different. This feature brings…
To generalize complementarities for games, we introduce some conditions weaker than quasisupermodularity and the single crossing property. We prove that the Nash equilibria of a game satisfying these conditions form a nonempty complete…
In this paper, a distributed non-model based seeking algorithm which combines the extremum seeking control (ESC) jointly with learning algorithms is proposed to seek a generalized Nash equilibrium (GNE) for a class of noncooperative games…
We give a natural notion of nondegeneracy for singular points of integrable non-Hamiltonian systems, and show that such nondegenerate singularities are locally geometrically linearizable and deformation rigid in the analytic case. We…
The constraint nondegeneracy condition is one of the most relevant and useful constraint qualifications in nonlinear semidefinite programming. It can be characterized in terms of any fixed orthonormal basis of the, let us say,…
We consider the stochastic generalized Nash equilibrium problem (SGNEP) with joint feasibility constraints and expected-value cost functions. We propose a distributed stochastic projected reflected gradient algorithm and show its almost…