Related papers: Logit Equilibrium as an Approximation of Nash Equi…

We obtain sharp bounds for the number of n--cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. We prove sharp estimates on both the sum of k-th…

In the context of large population symmetric games, approximate Nash equilibria are introduced through equilibrium solutions of the corresponding mean field game in the sense that the individual gain from optimal unilateral deviation under…

Let F be a holomorphic map whose components satisfy some polynomial relations. We present an algorithm for constructing Nash maps locally approximating F, whose components satisfy the same relations.

For a closed connected surface with a metric g, we consider the regularized trace of the inverse of the Laplace-Beltrami operator. We minimize this on the class of smooth metrics conformal to g having the same area, and show that the…

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…

We show that the isoperimetric profile $h_{g(t)}(\xi)$ of a compact Riemannian manifold $(M,g)$ is jointly continuous when metrics $g(t)$ vary continuously. We also show that, when $M$ is a compact surface and $g(t)$ evolves under…

We show that in any $n$-player $m$-action normal-form game, we can obtain an approximate equilibrium by sampling any mixed-action equilibrium a small number of times. We study three types of equilibria: Nash, correlated and coarse…

Equilibria of realistic multiplayer games constitute a key solution concept both in practical applications, such as online advertising auctions and electricity markets, and in analytical frameworks used to study strategic voting in…

In this paper, we investigate a distributed Nash equilibrium computation problem for a time-varying multi-agent network consisting of two subnetworks, where the two subnetworks share the same objective function. We first propose a…

This note offers a first bridge from machine learning to modern differential geometry. We show that the logits-to-probabilities step implemented by softmax can be modeled as a geometric interface: two potential-generated, conservative…

We establish a correspondence between trisections of smooth, compact, oriented $4$--manifolds with connected boundary and diagrams describing these trisected $4$--manifolds. Such a diagram comes in the form of a compact, oriented surface…

We show a Whitney Approximation Theorem for a continuous map from a manifold to a smooth CW complex. This enables us to show that a topological CW complex is homotopy equivalent to a smooth CW complex in a category of topological spaces. It…

Nash equilibrium is a popular solution concept for solving imperfect-information games in practice. However, it has a major drawback: it does not preclude suboptimal play in branches of the game tree that are not reached in equilibrium.…

In this paper, we introduce a novel equilibrium concept, called the equilibrium cycle, which seeks to capture the outcome of oscillatory game dynamics. Unlike the (pure) Nash equilibrium, which defines a fixed point of mutual best…

A solution manifold is the collection of points in a $d$-dimensional space satisfying a system of $s$ equations with $s<d$. Solution manifolds occur in several statistical problems including hypothesis testing, curved-exponential families,…

This short note aims at (re)proving that the symmetrically normalized graph Laplacian $L=\Id - D^{-1/2}WD^{-1/2}$ (from a graph defined from a Gaussian weighting kernel on a sampled smooth manifold) converges towards the continuous Manifold…

We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.

We consider the motion of an incompressible viscous fluid that completely covers a smooth, compact and embedded hypersurface $\Sigma$ without boundary and flows along $\Sigma$. Local-in-time well-posedness is established in the framework of…

In this paper we present a novel generic mapping between Graphical Games and Markov Random Fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Thus, the problem of deciding whether a…

We discuss the characterization of relative equilibria of Lagrangian systems with symmetry.