Related papers: Games orbits play and obstructions to Borel reduci…
We consider various notions of equivalence in the space of bounded operators on a Hilbert space, in particular modulo finite rank, modulo Schatten $p$-class, and modulo compact. Using Hjorth's theory of turbulence, the latter two are shown…
In the spirit of Hjorth's turbulence theory, we introduce "unbalancedness": a new dynamical obstruction to classifying orbit equivalence relations by actions of Polish groups which admit a two side invariant metric (TSI). Since abelian…
We study the complexity of the classification problem of conjugacy on dynamical systems on some compact metrizable spaces. Especially we prove that the conjugacy equivalence relation of interval dynamical systems is Borel bireducible to…
We announce some new results regarding the classification problem for separable von Neumann algebras. Our results are obtained by applying the notion of Borel reducibility and Hjorth's theory of turbulence to the isomorphism relation for…
We study the underlying mathematical properties of various partial order models of concurrency based on transition systems, Petri nets, and event structures, and show that the concurrent behaviour of these systems can be captured in a…
Estimating discrete games of complete information is often computationally difficult due to partial identification and the absence of closed-form moment characterizations. This paper proposes computationally tractable approaches to…
We extend classical results on the classification of reversible elements of the group $\mathrm{GL}(n, \mathbb{C})$ (and $\mathrm{GL}(n, \mathbb{R})$) to $\mathrm{GL}(n, \mathbb{H})$ using an infinitesimal version of the classical…
These lecture notes attempt a mathematical treatment of game theory akin to mathematical physics. A game instance is defined as a sequence of states of an underlying system. This viewpoint unifies classical mathematical models for 2-person…
We introduce a new method, involving infinite games and Borel determinacy, which we use to answer several well-known questions in Borel combinatorics.
We establish new results and introduce new methods in the theory of measurable orbit equivalence, using bounded cohomology of group representations. Our rigidity statements hold for a wide (uncountable) class of groups arising from negative…
Recent successes of game-theoretic formulations in ML have caused a resurgence of research interest in differentiable games. Overwhelmingly, that research focuses on methods and upper bounds on their speed of convergence. In this work, we…
We introduce a general systematic procedure for solving any binary-input binary-output game using operator algebraic techniques on the representation theory for the underlying group, which we then illustrate on the prominent class of tilted…
We derive multiparty games that, if the winning chance exceeds a certain limit, prove the incompatibility of the parties' causal relations with any partial order. This, in turn, means that the parties exert a back-action on the causal…
We introduce parallelism into the basic algebra of games to model concurrent game algebraically. Parallelism is treated as a new kind of game operation. The resulted algebra of concurrent games can be used widely to reason the parallel…
The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…
Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial…
Driven by recent successes in two-player, zero-sum game solving and playing, artificial intelligence work on games has increasingly focused on algorithms that produce equilibrium-based strategies. However, this approach has been less…
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…
Optimizing strategic decisions (a.k.a. computing equilibrium) is key to the success of many non-cooperative multi-agent applications. However, in many real-world situations, we may face the exact opposite of this game-theoretic problem --…
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…