Related papers: Noncommutative Nullstellens\"atze and Perfect Game…
In the game theory literature, there appears to be little research on equilibrium selection for normal-form games with an infinite strategy space and discontinuous utility functions. Moreover, many existing selection methods are not…
We study some ergodicity property of zero-sum stochastic games with a finite state space and possibly unbounded payoffs. We formulate this property in operator-theoretical terms, involving the solvability of an optimality equation for the…
We introduce and examine three subclasses of the family of quantum no-signalling (QNS) correlations introduced by Duan and Winter: quantum commuting, quantum and local. We formalise the notion of a universal TRO of a block operator…
In this paper, we introduce a framework of new mathematical representation of Game Theory, including static classical game and static quantum game. The idea is to find a set of base vectors in every single-player strategy space and to…
We prove that an imitation game has a perfect quantum approximate strategy if and only if there exists a bi-tracial state on the minimal tensor product of two universal C${^*}$-algebras, which induces the perfect correlation. Moreover, we…
We revisit tensor algebras of subproduct systems with Hilbert space fibers, resolving some open questions in the case of infinite dimensional fibers. We characterize when a tensor algebra can be identified as the algebra of uniformly…
Coordination games have been of interest to game theorists, economists, and ecologists for many years to study such problems as the emergence of local conventions and the evolution of cooperative behavior. Approaches for understanding the…
Simple stochastic games are two-player zero-sum stochastic games with turn-based moves, perfect information, and reachability winning conditions. We present two new algorithms computing the values of simple stochastic games. Both of them…
A unital $C^*$-algebra is called $N$-subhomogeneous if its irreducible representations are finite dimensional with dimension at most $N$. We extend this notion to operator systems, replacing irreducible representations by boundary…
The paper is concerned with various types of noncommutative Positivstellens\"atze for the matrix algebra $M_n(\cA)$, where $\cA$ is an algebra of operators acting on a unitary space, a path algebra, a cyclic algebra or a formally real…
Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…
Given a target set $A\subseteq \mathbb{R}^d$ and a real number $\beta\in (0,1)$, McMullen introduced the notion of $A$ being an absolutely $\beta$-winning set. This involves a two player game which we call the $\beta$-McMullen game. We…
This paper proves several Tauberian theorems for general iterations of operators, and provides two applications to zero-sum stochastic games where the total payoff is a weighted sum of the stage payoffs. The first application is to provide…
The existence of ideal objects, such as maximal ideals in nonzero rings, plays a crucial role in commutative algebra. These are typically justified using Zorn's lemma, and thus pose a challenge from a computational point of view. Giving a…
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…
Hilbert's Nullstellensatz characterizes polynomials that vanish on the vanishing set of an ideal in C[x]. In the free algebra C<X> the vanishing set of a two-sided ideal I is defined in a dimension-free way using images in…
A notion of partial ideal for an operator algebra is a weakening the notion of ideal where the defining algebraic conditions are enforced only in the commutative subalgebras. We show that, in a von Neumann algebra, the ultraweakly closed…
In this work, we present a logic based on first-order CTL, namely Game Analysis Logic (GAL), in order to reason about games. We relate models and solution concepts of Game Theory as models and formulas of GAL, respectively. Precisely, we…
This paper proposes a new equilibrium concept "robust perfect equilibrium" for non-cooperative games with a continuum of players, incorporating three types of perturbations. Such an equilibrium is shown to exist (in symmetric mixed…
We introduce a new and extensive theory of noncommutative convexity along with a corresponding theory of noncommutative functions. We establish noncommutative analogues of the fundamental results from classical convexity theory, and apply…