Related papers: Logit Equilibrium as an Approximation of Nash Equi…
A description of static equilibria in the noisy binary choice (Ising) game on complete and random graphs resulting from maximisation of the likelihood of system configurations is presented. An equivalence of such likelihood equilibria to…
This work proposes a novel distributed approach for computing a Nash equilibrium in convex games with merely monotone and restricted strongly monotone pseudo-gradients. By leveraging the idea of the centralized operator extrapolation method…
In this article, we propose an efficient way to compute equilibria of a general class of set-valued Lur'e dynamical systems, which plays an important role in the asymptotical analysis of the systems. Besides the equilibria computation, our…
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…
We give cohomological criteria for logarithmic good reduction of elliptic surfaces up to modification. Along the way, we prove several more general results about such surfaces in positive characteristic, as well as about log smooth…
The Nash Equilibrium is a much discussed, deceptively complex, method for the analysis of non-cooperative games. If one reads many of the commonly available definitions the description of the Nash Equilibrium is deceptively simple in…
We present a new proof for the existence of a Nash equilibrium, which involves no fixed point theorem. The self-contained proof consists of two parts. The first part introduces the notions of root function and pre-equilibrium. The second…
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…
We consider a general-sum N-player linear-quadratic game with stochastic dynamics over a finite horizon and prove the global convergence of the natural policy gradient method to the Nash equilibrium. In order to prove the convergence of the…
We study analogs of planar-quadrilateral meshes in Laguerre sphere geometry and the approximation of smooth surfaces by them. These new Laguerre meshes can be viewed as watertight surfaces formed by planar quadrilaterals (corresponding to…
Given an undirected and connected graph $G$ on $T$ vertices, suppose each vertex $t$ has a latent signal $x_t \in \mathbb{R}^n$ associated to it. Given partial linear measurements of the signals, for a potentially small subset of the…
We prove two results concerning an Ulam-type stability problem for homomorphisms between lattices. One of them involves estimates by quite general error functions; the other deals with approximate (join) homomorphisms in terms of certain…
We study the asymptotic stability of the logit evolutionary dynamics in population games, possibly with multiple heterogenous populations. For general population games, we prove that, on the one hand, strict Nash equilibria are…
In this paper we study a subclass of subcartesian space-the orbit space of a proper action of Lie group on smooth manifold. We show that continuous functions on orbit space can be approximated by smooth functions.
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…
We construct smooth, non-symmetric plasma equilibria which possess closed, nested flux surfaces and solve the magnetohydrostatic (steady three-dimensional incompressible Euler) equations with a small force. The solutions are also `nearly'…
It is proved the following theorem, if $w$ is a quasiconformal harmonic mappings between two Riemann surfaces with smooth boundary and aproximate analytic metric, then $w$ is a quasi-isometry with respect to Euclidean metric.
This paper investigates the convergence time of log-linear learning to an $\epsilon$-efficient Nash equilibrium in potential games, where an efficient Nash equilibrium is defined as the maximizer of the potential function. Previous…
Although logit quantal response equilibrium (logit QRE) offers a natural equilibrium selection mechanism and converges to Nash equilibrium as the rationality parameter tends to infinity, its computation in extensive-form games is generally…
Using the AdS/CFT correspondence, we identify the symmetry algebra of the Laplacian on Euclidean space as an explicit quotient of the universal enveloping algebra of the Lie algebra of conformal motions. We construct analogues of these…