Related papers: Ideal games and Ramsey sets
A temporal-theoretic formalism for understanding game theory is described where a strict ordering relation on a set of time points $T$ defines a game on $T$. Using this formalism, a proof of Zermelo's Theorem, which states that every finite…
A classical theorem due to Mycielski states that an equivalence relation $E$ having the Baire property and meager equivalence classes must have a perfect set of pairwise inequivalent elements. We consider equivalence relations with…
A space $X$ is H-separable (Bella et al., 2009) if for every sequence $(Y_n)$ of dense subspaces of $X$ there exists a sequence $(F_n)$ such that for each $n$ $F_n$ is a finite subset of $Y_n$ and every nonempty open set of $X$ intersects…
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignments of $k$-many colors, with respect to Intuitionistic Heyting Arithmetic. We prove that for every natural number $k \geq 2$, Ramsey's…
The Hales-Jewett Theorem states that given any finite nonempty set $\A$ and any finite coloring of the free semigroup $S$ over the alphabet $\A$ there is a {\it variable word\/} over $\A$ all of whose instances are the same color. This…
In this paper we study a new ideal $\mathcal{WR}$. The main result is the following: an ideal is not weakly Ramsey if and only if it is above $\mathcal{WR}$ in the Kat\v{e}tov order. Weak Ramseyness was introduced by Laflamme in order to…
We present a new variant of the potential game and show that certain compact subsets of $\R^n$, including a large class of self-affine sets, are winning in our game. We prove that sets with sufficiently strong winning conditions are…
Two-player (antagonistic) games on (possibly stochastic) graphs are a prevalent model in theoretical computer science, notably as a framework for reactive synthesis. Optimal strategies may require randomisation when dealing with inherently…
Behavioral experiments on the Ultimatum Game have shown that we human beings have remarkable preference in fair play, contradicting the predictions by the game theory. Most of the existing models seeking for explanations, however, strictly…
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…
We consider a team formation setting where agents have varying levels of expertise in a global set of required skills, and teams are ranked with respect to how well the expertise of teammates complement each other. We model this setting as…
A symmetric chain of ideals is a rule that assigns to each finite set $S$ an ideal $I_S$ in the polynomial ring $\mathbb{C}[x_i]_{i \in S}$ such that if $\phi \colon S \to T$ is an embedding of finite sets then the induced homomorphism…
In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees…
This paper addresses the longstanding problem of determining the structure of the $\leq_{\mathrm{LT}}$-order in the Effective Topos, known to effectively embed the Turing degrees. In a surprising discovery, we show that the…
We give an operator-algebraic formulation of robust self-testing in terms of states on C*-algebras. We show that a quantum correlation p is a robust self-test only if among all (abstract) states, there is a unique one achieving p. We show…
We study parameters of the convexity spaces associated with families of sets in $\mathbb{R}^d$ where every intersection between $t$ sets of the family has its Betti numbers bounded from above by a function of $t$. Although the Radon number…
There is a long history in game theory on the topic of Bayesian or "rational" learning, in which each player maintains beliefs over a set of alternative behaviours, or types, for the other players. This idea has gained increasing interest…
Let $G$ be a finite simple graph, and let $I(G)$ denote its edge ideal. In this paper, we investigate the asymptotic behavior of the syzygies of powers of edge ideals through the lens of homological shift ideals $\text{HS}_i(I(G)^k)$. We…
We introduce a class of left ideals (and subalgebras) of nest algebras determined by totally ordered families of partial isometries on a complex Hilbert space $H$. Let $\mathcal{E}$ be a family of partial isometries that is totally ordered…
This work contains the mathematical exploration of a few prototypical games in which central concepts from statistics and probability theory naturally emerge. The first two kinds of games are termed Fisher and Bayesian games, which are…