Related papers: Games orbits play and obstructions to Borel reduci…

We prove that orbit equivalence relations (ERs, for brevity) of generically turbulent Polish actions are not Borel reducible to ER s of a family which includes Polish actions of S_\infty, the group of all permutations of N, and is closed…

We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable…

In this article, we consider some simple combinatorial game and a winning strategy in this game. This game is then used to prove several known results about non-repetitive sequences and approximations with denominators from a lacunary…

Game comonads offer a categorical view of a number of model-comparison games central to model theory, such as pebble and Ehrenfeucht-Fra\"iss\'e games. Remarkably, the categories of coalgebras for these comonads capture preservation of…

Orbit harmonics is a tool in combinatorial representation theory which promotes the (ungraded) action of a linear group $G$ on a finite set $X$ to a graded action of $G$ on a polynomial ring quotient by viewing $X$ as a $G$-stable point…

By building on our earlier work, we establish uncertainty principles in terms of Heisenberg inequalities and of the ambiguity functions associated with magnetic structures on certain coadjoint orbits of infinite-dimensional Lie groups.…

LP-duality theory has played a central role in the study of cores of games, right from the early days of this notion to the present time. The classic paper of Shapley and Shubik \cite{Shapley1971assignment} introduced the "right" way of…

Cooperative interval games are a generalized model of cooperative games in which the worth of every coalition corresponds to a closed interval representing the possible outcomes of its cooperation. Selections are all possible outcomes of…

We present a one-to-one correspondence between equivalence classes of unitary irreducible representations and coadjoint orbits for a class of pro-Lie groups including all connected locally compact nilpotent groups and arbitrary infinite…

Let $G$ be a connected reductive algebraic group over an algebraically closed field ${\bf k}$ of characteristic not equal to 2, let $\B$ be the variety of all Borel subgroups of $G$, and let $K$ be a symmetric subgroup of $G$. Fixing a…

We introduce a new game-theoretic semantics (GTS) for the modal mu-calculus. Our so-called bounded GTS replaces parity games with alternative evaluation games where only finite paths arise; infinite paths are not needed even when the…

Multipartite information principles are needed to understand nonlocal quantum correlations. Towards that end, we provide optimal bounds on genuine multipartite nonlocality for classes of THRESHOLD games using the LOCCG (Local Operations…

In game-theoretic learning, several agents are simultaneously following their individual interests, so the environment is non-stationary from each player's perspective. In this context, the performance of a learning algorithm is often…

We review the notion of reducibility and we introduce and discuss the notion of orbital reducibility for autonomous ordinary differential equations of first order. The relation between (orbital) reducibility and (orbital) symmetry is…

Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, un- der the assumption that optimal worst-case…

In this paper, we introduce post-selection games, a generalization of nonlocal games where each round can be not only won or lost by the players, but also discarded by the referee. Such games naturally formalize possibilistic proofs of…

Clifford theory relates the representation theory of finite groups to those of a fixed normal subgroup by means of induction and restriction, which is an adjoint pair of functors. We generalize this result to the situation of a…

Understanding invertibility in restricted mis\`ere play has been challenging; in particular, the possibility of non-conjugate inverses posed difficulties. Advances have been made in a few specific universes, but a general theorem was…

We introduce and investigate a range of general notions of a game. Our principal notion is based on a set of agents modifying a relational structure in a discrete evolution sequence. We also introduce and study a variety of ways to model…

We introduce a class of extensive form games where players might not be able to foresee the possible consequences of their decisions and form a model of their opponents which they exploit to achieve a more profitable outcome. We improve…