Related papers: Elliptic curves in game theory

Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms…

The spaces of invariants of tensor powers of the defining representation of Sp(2n) are provided with the bases parametrized by symplectic wave graphs introduced here especially for this purpose. The proof utilizes a game similar to Tetris,…

Polygonal slap maps are piecewise affine expanding maps of the interval obtained by projecting the sides of a polygon along their normals onto the perimeter of the polygon. These maps arise in the study of polygonal billiards with…

In this paper we introduce polytopal stochastic games, an extension of two-player, zero-sum, turn-based stochastic games, in which we may have uncertainty over the transition probabilities. In these games the uncertainty over the…

We introduce a framework for stochastic games on large sparse graphs, covering continuous-time and discrete-time dynamic games as well as static games. Players are indexed by the vertices of simple, locally finite graphs, allowing both…

We study the intersection theory of punctured pseudoholomorphic curves in $4$-dimensional symplectic cobordisms. We first study the local intersection properties of such curves at the punctures. We then use this to develop topological…

In this note, we study a class of deterministic finite-horizon linear-quadratic difference games with coupled affine inequality constraints involving both state and control variables. We show that the necessary conditions for the existence…

We show that the average number of integral points on elliptic curves, counted modulo the natural involution on a punctured elliptic curve, is bounded from above by $2.1 \times 10^8$. To prove it, we design a descent map, whose prototype…

This paper generalizes L.S. Shapley's celebrated value allocation theory on coalition games by discovering and applying a fundamental connection between stochastic path integration driven by canonical time-reversible Markov chains and…

Stochastic games combine controllable and adversarial non-determinism with stochastic behavior and are a common tool in control, verification and synthesis of reactive systems facing uncertainty. Multi-objective stochastic games are natural…

We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_\epsilon…

Correlated equilibria -- and their generalization $\Phi$-equilibria -- are a fundamental object of study in game theory, offering a more tractable alternative to Nash equilibria in multi-player settings. While computational aspects of…

The class of totally balanced games is a class of transferable-utility coalitional games providing important models of cooperative behavior used in mathematical economics. They coincide with market games of Shapley and Shubik and every…

This paper investigates discrete-time evolutionary games with a general stochastic imitation rule on the toroidal grid, which is a grid network with periodic boundary conditions. The imitation rule has been considered as a fundamental rule…

We introduce a general representation of large-population games in which each player s influence ON the others IS centralized AND limited, but may otherwise be arbitrary.This representation significantly generalizes the class known AS…

We bound the j -invariant of integral points on a modular curve in terms of the congruence group defining the curve. We apply this to prove that the modular curve Xsplit (p3) has no non-trivial rational point if p is a sufficiently large…

We introduce a new class of totally balanced cooperative TU games, namely p -additive games. It is inspired by the class of inventory games that arises from inventory situations with temporary discounts (Toledo, 2002) and contains the class…

In this paper we introduce a novel flow representation for finite games in strategic form. This representation allows us to develop a canonical direct sum decomposition of an arbitrary game into three components, which we refer to as the…

We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike.…

Stochastic games are an important class of problems that generalize Markov decision processes to game theoretic scenarios. We consider finite state two-player zero-sum stochastic games over an infinite time horizon with discounted rewards.…