Related papers: Game-theoretic variants of cardinal invariants
We consider combining the definition of a cardinal invariant and the notion of an infinite game. We focus on the splitting number $\mathfrak{s}$ since the corresponding cardinal invariants behave in an interesting way. We introduce three…
We investigate a variety of cut and choose games, their relationship with (generic) large cardinals, and show that they can be used to characterize a number of properties of ideals and of partial orders: certain notions of distributivity,…
We prove two $\mathrm{ZFC}$ inequalities between cardinal invariants. The first inequality involves cardinal invariants associated with an analytic P-ideal, in particular the ideal of subsets of $\omega$ of asymptotic density $0$. We obtain…
We introduce a two-parameter modification of the cofinality invariant of ideals. This allows us to include the interaction of a pair of ideals in the study of base-like structures. We find the values (cardinal numbers or well-known cardinal…
We study selective and game-theoretic versions of properties like the ccc, weak Lindel\"ofness and separability, giving various characterizations of them and exploring connections between these properties and some classical cardinal…
Domination game [SIAM J.\ Discrete Math.\ 24 (2010) 979--991] and total domination game [Graphs Combin.\ 31 (2015) 1453--1462] are by now well established games played on graphs by two players, named Dominator and Staller. In this paper,…
Cruz Chapital, Goto, Hayashi and the author showed that the game-theoretic variants $\mathfrak{s}_{\mathrm{game}^*}^\mathrm{I}$ and $\mathfrak{s}_{\mathrm{game}^{**}}^\mathrm{I}$ of the splitting number $\mathfrak{s}$ are consistently…
The paper is devoted to inverse Stackelberg games with many players. We consider both static and differential games. The main assumption of the paper is the compactness of the strategy sets. We obtain the characterization of inverse…
Using the concept of constant evasion to different sorts of suitable binary relations, we establish many cardinal invariants derived from the established cardinal invariants $\mathfrak{e}^\mathrm{const}_{n}$ and…
Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…
We introduce a new type of game on natural numbers of variable countable length, which can be regarded as a diagonalization of all games of fixed countable length on natural numbers. Building on previous work by Trang and Woodin, we show…
Game theory relies heavily on the availability of cardinal utility functions, but in fields such as matching markets, only ordinal preferences are typically elicited. The literature focuses on mechanisms with simple dominant strategies, but…
The paper is an extensive and systematic study of cardinal invariants we call slalom numbers, describing the combinatorics of sequences of sets of natural numbers. Our general approach, based on relational systems, covers many such cardinal…
We propose a continuous version of the classical Gale--Berlekamp switching game. We also study a weighted version of this new continuous game. The main results of this paper concern growth estimates for the corresponding optimization…
We present a computational formulation for the approximate version of several variational inequality problems, investigating their computational complexity and establishing PPAD-completeness. Examining applications in computational game…
The focus of this essay is a rigorous treatment of infinite games. An infinite game is defined as a play consisting of a fixed number of players whose sequence of moves is repeated, or iterated ad infinitum. Each sequence corresponds to a…
The paper proposes a natural measure space of zero-sum perfect information games with upper semicontinuous payoffs. Each game is specified by the game tree, and by the assignment of the active player and of the capacity to each node of the…
In [8] the authors initiate the study of selective versions of the notion of $\theta$-separability in non-regular spaces. In this paper we continue this investigation by establishing connections between the familiar cardinal numbers arising…
We introduce new cardinal invariants of a poset, called the comparability number and the incomparability number. We determine their value for well-known posets, such as $\omega^\omega$, $\mathcal{P}(\omega)/\mathrm{fin}$, the Turing degrees…
In [CMRM24], it was proved that it is relatively consistent that \emph{bounding number} $\mathfrak{b}$ is smaller than the uniformity of $\mathcal{MA}$, where $\mathcal{MA}$ denotes the ideal of the meager-additive sets of $2^{\omega}$. To…