Related papers: Logit Equilibrium as an Approximation of Nash Equi…
We consider (i) the problem of finding a (possibly mixed) Nash equilibrium in congestion games, and (ii) the problem of finding an (exponential precision) fixed point of the gradient descent dynamics of a smooth function $f:[0,1]^n…
We show that a proof in multiplicative linear logic can be represented as a decorated surface, such that two proofs are logically equivalent just when their surfaces are geometrically equivalent. This is an extended abstract for…
We suggest a novel stochastic-approximation algorithm to compute a symmetric Nash-equilibrium strategy in a general queueing game with a finite action space. The algorithm involves a single simulation of the queueing process with dynamic…
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentiate between other players. Our results pertain to such games…
We propose the first loss function for approximate Nash equilibria of normal-form games that is amenable to unbiased Monte Carlo estimation. This construction allows us to deploy standard non-convex stochastic optimization techniques for…
We study the problem of computing approximate Nash equilibria of bimatrix games, in a setting where players initially know their own payoffs but not the payoffs of the other player. In order for a solution of reasonable quality to be found,…
In this paper, I prove the existence of a pure-strategy Nash equilibrium for a large class of games with nonconvex strategy spaces. Specifically, if each player's strategies form a compact, connected Euclidean neighborhood retract and if…
This} paper presents relations between least area and normal surfaces, embedded in either a Euclidean or hyperbolic $3$-manifold. A relaxed version of normal surfaces, termed quasi-normal, is introduced, and it is shown that under…
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…
We prove that finding an $\epsilon$-approximate Nash equilibrium is PPAD-complete for constant $\epsilon$ and a particularly simple class of games: polymatrix, degree 3 graphical games, in which each player has only two actions. As…
Computing Nash equilibrium in multi-agent games is a longstanding challenge at the interface of game theory and computer science. It is well known that a general normal form game in N players and k strategies requires exponential space…
The purpose of this paper is to develop a numerical method for finding an equilibrium point in a model, in which the loss function of each object (subject) is described by a convex function with respect to one of its variables. Such models…
Our goal is to identify the type and number of static equilibrium points of solids arising from fine, equidistant $n$-discretrizations of smooth, convex surfaces. We assume uniform gravity and a frictionless, horizontal, planar support. We…
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 prove that a quotient of a Nash manifold $X$ by a closed equivalence relation $R\subset X\times X$, which is submersive over $X$, yields a Nash manifold $X/R$.
Let M be a smooth compact manifold without boundary. We consider two smooth Sub-Semi-Riemannian metrics on M. Under suitable conditions, we show that they are almost conformally isometric in an Lp sense. Assume also that M carries a…
While there have been a number of studies about the efficacy of methods to find exact Nash equilibria in bimatrix games, there has been little empirical work on finding approximate Nash equilibria. Here we provide such a study that compares…
This paper presents a proof of the existence of standard symplectic coordinates near a set of smooth, orthogonally intersecting symplectic submanifolds. It is a generalization of the standard symplectic neighborhood theorem. Moreover, in…
Every real algebraic variety is isomorphic to the set of totally mixed Nash equilibria of some three-person game, and also to the set of totally mixed Nash equilibria of an $N$-person game in which each player has two pure strategies. From…
We prove an analogue for a one-phase free boundary problem of the classical gradient bound for solutions to the minimal surface equation. It follows, in particular, that every energy-minimizing free boundary that is a graph is also smooth.…