相关论文: Nash Equilibria via Duality and Homological Select…

An axiomatic characterization of Nash equilibrium is provided for games in normal form. The Nash equilibrium correspondence is shown to be fully characterized by four simple and intuitive axioms, two of which are inspired by contraction and…

We investigate the set of Nash equilibrium payoffs for two person differential games. The main result of the paper is the characterization of the set of Nash equilibrium payoffs in the terms of nonsmooth analysis. Also we obtain the…

We consider the computation of a Nash equilibrium in attack and defense games on networks (Bloch et al. [1]). We prove that a Nash Equilibrium of the game can be computed in polynomial time with respect to the number of nodes in the…

Strategic interactions can be represented more concisely, and analyzed and solved more efficiently, if we are aware of the symmetries within the multiagent system. Symmetries also have conceptual implications, for example for equilibrium…

Variational relation problems allow a general approach for variational inequalities, equilibrium problems, optimization problems, variational inclusions. In this paper we consider a system of quasi-variational relations and determine some…

We revisit the duality theorem for multimarginal optimal transportation problems. In particular, we focus on the Coulomb cost. We use a discrete approximation to prove equality of the extremal values and some careful estimates of the…

We consider the problem of computing stationary points in min-max optimization, with a particular focus on the special case of computing Nash equilibria in (two-)team zero-sum games. We first show that computing $\epsilon$-Nash equilibria…

Nash equilibrium is the most commonly-used notion of equilibrium in game theory. However, it suffers from numerous problems. Some are well known in the game theory community; for example, the Nash equilibrium of repeated prisoner's dilemma…

In this paper, we aim to develop distributed continuous-time algorithms over directed graphs to seek the Nash equilibrium in a noncooperative game. Motivated by the recent consensus-based designs, we present a distributed algorithm with a…

We propose local symplectic surgery, a two-timescale procedure for finding local Nash equilibria in two-player zero-sum games. We first show that previous gradient-based algorithms cannot guarantee convergence to local Nash equilibria due…

A theorem of Functorial Affinization of Nash's manifold is proven here giving necessary and sufficient conditions to lift a holomorphic arc to the smooth locus of the Nash manifold. In addition a theorem about valuations is proven.

Nash equilibrium has long been a desired solution concept in multi-player games, especially for those on continuous strategy spaces, which have attracted a rapidly growing amount of interests due to advances in research applications such as…

Existing methods for learning Stackelberg equilibria typically assume that the followers' (variational, generalized) Nash equilibrium is unique. However, in the presence of multiple equilibria, without a selection convention, the problem…

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,…

In this paper two algorithms with the goal of generating the equilibrium set of the power allocation game first developed in \cite{allocation} are proposed. Based on the first algorithm, the geometric property of the pure strategy Nash…

We consider a multi-player stochastic differential game with linear McKean-Vlasov dynamics and quadratic cost functional depending on the variance and mean of the state and control actions of the players in open-loop form. Finite and…

We study markets of indivisible items in which price-based (Walrasian) equilibria often do not exist due to the discrete non-convex setting. Instead we consider Nash equilibria of the market viewed as a game, where players bid for items,…

We propose a novel method to find Nash equilibria in games with binary decision variables by including compensation payments and incentive-compatibility constraints from non-cooperative game theory directly into an optimization framework in…

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…

We consider an augmented version of Merton's portfolio choice problem, where trading by large investors influences the price of underlying financial asset leading to strategic interaction among investors, with investors deciding their…