Related papers: Elliptic curves in game theory
Finite-horizon probabilistic multiagent concurrent game systems, also known as finite multiplayer stochastic games, are a well-studied model in computer science due to their ability to represent a wide range of real-world scenarios…
We study strong equilibria in symmetric capacitated cost-sharing games. In these games, a graph with designated source $s$ and sink $t$ is given, and each edge is associated with some cost. Each agent chooses strategically an $s$-$t$ path,…
We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…
A notion of dual curve for pseudoholomorphic curves in 4--manifolds turns out to be possible only if the notion of almost complex structure structure is slightly generalized. The resulting structure is as easy (perhaps easier) to work with,…
We study the problem of characterizing the set of games that are consistent with observed equilibrium play. Our contribution is to develop and analyze a new methodology based on convex optimization to address this problem for many classes…
We conduct a comprehensive analysis of the discrete-time exponential-weights dynamic with a constant step size on all general-sum and symmetric $2 \times 2$ normal-form games, i.e. games with $2$ pure strategies per player, and where the…
We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state graph. We focus on the important sub-class of ergodic games where all states are visited infinitely often with probability 1. The algorithmic study of…
Recently, a new model extending the standard replicator equation to a finite set of players connected on an arbitrary graph was developed in evolutionary game dynamics. The players are interpreted as subpopulations of multipopulations…
A central challenge in game theory and learning systems such as GANs is understanding which algorithms can efficiently compute equilibria across the heterogeneous landscape of games. Equilibrium computation is typically studied solver by…
We present an algorithm for computing evolutionarily stable strategies (ESSs) in symmetric perfect-recall extensive-form games of imperfect information. Our main algorithm is for two-player games, and we describe how it can be extended to…
We study continuous stochastic games with heterogeneous mean field interactions and jumps on large networks and explore their limit counterparts. We introduce the graphon game model based on a controlled graphon mean field stochastic…
We initiate the study of simple games from the point of view of combinatorial topology. The starting premise is that the losing coalitions of a simple game can be identified with a simplicial complex. Various topological constructions and…
Whether a PTAS (polynomial-time approximation scheme) exists for game equilibria has been an open question, and its absence has indications and consequences in three fields: the practicality of methods in algorithmic game theory,…
Let $E$ be an elliptic curve described by either an Edwards model or a twisted Edwards model over $\mathbb{F}_p$, namely, $E$ is defined by one of the following equations $x^2+y^2=a^2(1+x^2y^2),\, a^5-a\not\equiv 0$ mod $p$, or,…
We study strategic games on weighted directed graphs, in which the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy, augmented by a fixed non-negative integer bonus for picking a…
The space of finite games can be decomposed into three orthogonal subspaces [5], which are the subspaces of pure potential games, nonstrategic games and pure harmonic games. The orthogonal projections onto these subspaces are represented as…
The numbers game is a one-player game played on a finite simple graph with certain ``amplitudes'' assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
We consider a class of Nash games, termed as aggregative games, being played over a networked system. In an aggregative game, a player's objective is a function of the aggregate of all the players' decisions. Every player maintains an…
Understanding how agents coordinate or compete from limited behavioral data is central to modeling strategic interactions in traffic, robotics, and other multi-agent systems. In this work, we investigate the following complementary…
This paper provides theoretical bounds for empirical game theoretical analysis of complex multi-agent interactions. We provide insights in the empirical meta game showing that a Nash equilibrium of the meta-game is an approximate Nash…