Related papers: Affine Normal Play
We give a strict mathematical description for a refinement of the Marinatto-Weber quantum game scheme. The model allows the players to choose projector operators that determine the state on which they perform their local operators. The game…
This paper develops the category $\mathbf{NCG}$. Its objects are node-and-choice games, which include essentially all extensive-form games. Its morphisms allow arbitrary transformations of a game's nodes, choices, and players, as well as…
Playing impartial games under the normal and misere conventions may differ a lot. However, there are also many "exceptions" for which the normal and misere plays are very similar. As early as in 1901 Bouton noticed that this is the case…
We examine the long-run behavior of a wide range of dynamics for learning in nonatomic games, in both discrete and continuous time. The class of dynamics under consideration includes fictitious play and its regularized variants, the…
The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes computable games,…
In this paper we will be examining impartial scoring play games. We first give the basic definitions for what impartial scoring play games are and look at their general structure under the disjunctive sum. We will then examine the game of…
In general, Nash equilibria in normal-form games may require players to play (probabilistically) mixed strategies. We define a measure of the complexity of finite probability distributions and study the complexity required to play Nash…
We develop the theory of mixed finite elements in terms of special inverse systems of complexes of differential forms, defined over cellular complexes. Inclusion of cells corresponds to pullback of forms. The theory covers for instance…
Often, a given selection game studied in the literature has a known dual game. In dual games, a winning strategy for a player in either game may be used to create a winning strategy for the opponent in the dual. For example, the Rothberger…
We show that any normal algebraic monoid is an extension of an abelian variety by a normal affine algebraic monoid. This extends (and builds on) Chevalley's structure theorem for algebraic groups.
The classes of relativized relation algebras (whose units are not necessarily transitive as binary relations) are known to be finitely axiomatizable. In this article, we give a new proof for this fact that is easier and more transparent…
This paper presents a general closed graph property for (randomized strategy) Nash equilibrium correspondence in large games. In particular, we show that for any large game with a convergent sequence of fiinite-player games, the limit of…
A functor of sets $\mathbb X$ over the category of $K$-commutative algebras is said to be an affine functor if its functor of functions, $\mathbb A_{\mathbb X}$, is reflexive and $\mathbb X=\Spec \mathbb A_{\mathbb X}$. We prove that affine…
Fictitious play (FP) is one of the most fundamental game-theoretical learning frameworks for computing Nash equilibrium in $n$-player games, which builds the foundation for modern multi-agent learning algorithms. Although FP has provable…
We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour. They presented an FPTAS for computing an approximated equilibrium, and conjectured that there is a polynomial…
The number of quantifiers needed to express first-order properties is captured by two-player combinatorial games called multi-structural (MS) games. We play these games on linear orders and strings, and introduce a technique we call…
Impartial subtraction games on the nonnegative integers have been studied by many and discussed in detail in for example the remarkable work Winning Ways by Conway, Berlekamp and Guy. We describe how comply variations of these games,…
Partial methods play an important role in formal methods and beyond. Recently such methods were developed for parity games, where polynomial-time partial solvers decide the winners of a subset of nodes. We investigate here how effective…
In many multiagent environments, a designer has some, but limited control over the game being played. In this paper, we formalize this by considering incompletely specified games, in which some entries of the payoff matrices can be chosen…
Classical affine Lie algebras appear e.g. as symmetries of infinite dimensional integrable systems and are related to certain differential equations. They are central extensions of current algebras associated to finite-dimensional Lie…