English
Related papers

Related papers: Game-theoretic variants of cardinal invariants

200 papers

This article deals with certain star variants of the Scheepers property. We introduce and study the star-$K$-Scheepers property and corresponding game. The relationships between the game corresponding to the star-$K$-Scheepers property and…

General Topology · Mathematics 2023-05-09 Debraj Chandra , Nur Alam

The cardinal invariants $ \mathfrak h, \mathfrak b, \mathfrak s$ of $\mathcal P (\omega)$ are known to satisfy that $\omega_1 \leq \mathfrak h \leq\min\{\mathfrak b, \mathfrak s\}$. We prove that all inequalities can be strict. We also…

Logic · Mathematics 2022-02-02 Alan Dow , Saharon Shelah

NF set theory using intuitionistic logic is called iNF. We develop the theories of finite sets and their power sets and mappings, finite cardinals and their ordering, cardinal exponentiation, addition, and multiplication. We follow Rosser…

Logic · Mathematics 2025-10-31 Michael Beeson

This is a continuation of the paper [J. Symb. Log. 87 (2022), 1065--1092]. For an ideal $\mathcal{I}$ on $\omega$ we denote $\mathcal{D}_{\mathcal{I}}=\{f\in\omega^\omega: f^{-1}[\{n\}]\in\mathcal{I} \text{ for every $n\in \omega$}\}$ and…

Logic · Mathematics 2025-02-05 Adam Kwela

The domatic number of a graph is the maximum number of pairwise disjoint dominating sets admitted by the graph. We introduce a game based around this graph invariant. The domatic number game is played on a graph $G$ by two players, Alice…

Combinatorics · Mathematics 2025-08-15 Bert L. Hartnell , Douglas F. Rall

The game domination number is a graph invariant that arises from a game, which is related to graph domination in a similar way as the game chromatic number is related to graph coloring. In this paper we show that verifying whether the game…

Combinatorics · Mathematics 2016-06-20 Boštjan Brešar , Paul Dorbec , Sandi Klavžar , Gašper Košmrlj , Gabriel Renault

In this paper, we consider a game beginning with a multiset of elements from a group. On a move, two elements are replaced by their sum. This is a no strategy game, and can be modeled as a graded poset with the rank of a node equal to the…

Combinatorics · Mathematics 2018-07-02 Caleb Ji

Coloring games are combinatorial games where the players alternate painting uncolored vertices of a graph one of $k > 0$ colors. Each different ruleset specifies that game's coloring constraints. This paper investigates six impartial…

Combinatorics · Mathematics 2012-02-28 Gabriel Beaulieu , Kyle Burke , Eric Duchêne

We introduce a natural variant of weighted voting games, which we refer to as k-Prize Weighted Voting Games. Such games consist of n players with weights, and k prizes, of possibly differing values. The players form coalitions, and the i-th…

Computer Science and Game Theory · Computer Science 2023-03-03 Wei-Chen Lee , David Hyland , Alessandro Abate , Edith Elkind , Jiarui Gan , Julian Gutierrez , Paul Harrenstein , Michael Wooldridge

We introduce a "high probability" framework for repeated games with incomplete information. In our non-equilibrium setting, players aim to guarantee a certain payoff with high probability, rather than in expected value. We provide a high…

Computer Science and Game Theory · Computer Science 2015-09-30 Payam Delgosha , Amin Gohari , Mohammad Akbarpour

Impartial subtraction games on the nonnegative integers have been studied by many and discussed in detail in for example the remarkable work Winning Ways by Conway, Berlekamp and Guy. We describe how comply variations of these games,…

Number Theory · Mathematics 2012-09-11 Urban Larsson

What does it mean to fully understand the behavior of a network of adaptive agents? The golden standard typically is the behavior of learning dynamics in potential games, where many evolutionary dynamics, e.g., replicator, are known to…

Computer Science and Game Theory · Computer Science 2016-10-04 Ioannis Panageas , Georgios Piliouras

The Nakamura number is an appropriate invariant of a simple game to study the existence of social equilibria and the possibility of cycles. For symmetric quota games its number can be obtained by an easy formula. For some subclasses of…

Combinatorics · Mathematics 2018-11-30 Josep Freixas , Sascha Kurz

We investigate some variants of the splitting, reaping, and independence numbers defined using asymptotic density. Specifically, we give a proof of Con($\mathfrak{i}<\mathfrak{s}_{1/2}$), Con($\mathfrak{r}_{1/2}<\mathfrak{b}$) and…

Logic · Mathematics 2025-11-05 David Valderrama

Scale-invariance in games has recently emerged as a widely valued desirable property. Yet, almost all fast convergence guarantees in learning in games require prior knowledge of the utility scale. To address this, we develop learning…

Computer Science and Game Theory · Computer Science 2026-02-13 Taira Tsuchiya , Haipeng Luo , Shinji Ito

Arithmetic functions in Number Theory meet the Sprague-Grundy function from Combinatorial Game Theory. We study a variety of 2-player games induced by standard arithmetic functions, such as Euclidian division, divisors, remainders and…

Number Theory · Mathematics 2021-07-06 Douglas E. Iannucci , Urban Larsson

This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call \emph{Welch games}. Player II having a winning strategy in the Welch game of length $\omega$ on $\kappa$ is…

Logic · Mathematics 2023-08-08 Matthew Foreman , Menachem Magidor , Martin Zeman

A new class of projected dynamical systems of third order is investigated for quasi (parametric) variational inequalities in which the convex set in the classical variational inequality also depends upon the solution explicitly or…

Optimization and Control · Mathematics 2025-01-10 Oday Hazaimah

We generalise the $\alpha$-Ramsey cardinals introduced in Holy and Schlicht (2018) for cardinals $\alpha$ to arbitrary ordinals $\alpha$, and answer several questions posed in that paper. In particular, we show that $\alpha$-Ramseys are…

Logic · Mathematics 2018-10-31 Dan Saattrup Nielsen , Philip Welch

Schmidt's game is a powerful tool for studying properties of certain sets which arise in Diophantine approximation theory, number theory, and dynamics. Recently, many new results have been proven using this game. In this paper we address…

Logic · Mathematics 2019-02-20 Lior Fishman , Tue Ly , David S. Simmons