English
Related papers

Related papers: Compactness properties defined by open-point games

200 papers

We introduce the notions of weakly *-concave and weakly naturally quasi-concave correspondence and prove fixed point theorems and continuous selection theorems for these kind of correspondences. As applications in the game theory, by using…

Optimization and Control · Mathematics 2013-03-29 Monica Patriche

Partially-ordered set games, also called poset games, are a class of two-player combinatorial games. The playing field consists of a set of elements, some of which are greater than other elements. Two players take turns removing an element…

Computer Science and Game Theory · Computer Science 2011-11-22 Adam O. Kalinich

The second author introduced with I. T\"orm\"a a two-player word-building game [Playing with Subshifts, Fund. Inform. 132 (2014), 131--152]. The game has a predetermined (possibly finite) choice sequence $\alpha_1$, $\alpha_2$, $\ldots$ of…

Formal Languages and Automata Theory · Computer Science 2019-09-17 Jarkko Peltomäki , Ville Salo

In this paper we describe several player preferences in games with $N \geq 2$ players, in particular the case $N = 3$, and use them to simplify game trees, using the game of Clobber as our example. We show that, using a fixed starting…

Computer Science and Game Theory · Computer Science 2018-06-05 Luc Edixhoven , Walter Kosters

A Subtraction-Division game is a two player combinatorial game with three parameters: a set S, a set D, and a number n. The game starts at n, and is a race to say the number 1. Each player, on their turn, can either move the total to n-s…

Combinatorics · Mathematics 2012-06-05 Elizabeth Kupin

We present a selection principle $S_1(\mathcal{O},\mathcal{H})$ that characterizes the $G_{\delta}$-diagonal property. We also present a topological game induced by this selection principle and we study the relations between this game and…

General Topology · Mathematics 2016-11-23 Leandro F. Aurichi , Dione A. Lara

If we consider a sequence of warped product length spaces, what conditions on the sequence of warping functions implies compactness of the sequence of distance functions? In particular, we want to know when a subsequence converges to a well…

Differential Geometry · Mathematics 2024-09-12 Brian Allen , Bryan Sanchez , Yahaira Torres

Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier)…

Computer Science and Game Theory · Computer Science 2011-07-05 Masahiro Kumabe , H. Reiju Mihara

We study infinite two-player win/lose games $(A,B,W)$ where $A,B$ are finite and $W \subseteq (A \times B)^\omega$. At each round Player 1 and Player 2 concurrently choose one action in $A$ and $B$, respectively. Player 1 wins iff the…

Computer Science and Game Theory · Computer Science 2021-07-22 Patricia Bouyer , Stéphane Le Roux , Nathan Thomasset

Subset take-away is a two-player game involving a fixed finite set A. Players alternate choosing a proper, non-empty subset of A, with the condition that one may not name a set containing a set that was named earlier. A player unable to…

Combinatorics · Mathematics 2016-05-05 J. Daniel Christensen , Mark Tilford

Assume that $\mathcal{P}$ is a topological property of a space $X$, then we say that $X$ is {\it dense-$\mathcal{P}$} if each dense subset of $X$ has the property $\mathcal{P}$. In this paper, we mainly discuss dense subsets of a space $X$,…

General Topology · Mathematics 2023-04-10 Fucai Lin , Qiyun Wu

This paper reframes approachability theory within the context of population games. Thus, whilst one player aims at driving her average payoff to a predefined set, her opponent is not malevolent but rather extracted randomly from a…

Optimization and Control · Mathematics 2014-07-16 Dario Bauso , Thomas W L Norman

We create a new two-player game on the Sperner Triangle based on Sperner's lemma. Our game has simple rules and several desirable properties. First, the game is always certain to have a winner. Second, like many other interesting games such…

Computer Science and Game Theory · Computer Science 2007-05-23 Kyle Burke , Shang-Hua Teng

Let $X$ be a real or complex Banach space and $T_t:X\to X$ is a power bounded operator (or a $C_0$-semigroup). If there exists a "occasionally" attracting compact subset K (for each x$ in unit ball $\liminf_n \rho(T^n x, K)=0$ then there…

Functional Analysis · Mathematics 2007-05-23 K. Storozhuk

Node Kayles is a well-known two-player impartial game on graphs: Given an undirected graph, each player alternately chooses a vertex not adjacent to previously chosen vertices, and a player who cannot choose a new vertex loses the game. The…

Data Structures and Algorithms · Computer Science 2021-07-15 Yasuaki Kobayashi

Here I discuss ideas that makes a synthesis of topology and probability theory. The idea is the following: given a set $X$, assign a number $p(A)\in [0,1]$ for any subset $A$ of $X$. We can interpret $p(A)$ as the probability of openness of…

General Mathematics · Mathematics 2022-12-02 Yuli B. Rudyak

Let $X$ be a compact metric space and $T:X\longrightarrow X$ be continuous. Let $h^*(T)$ be the supremum of topological sequence entropies of $T$ over all subsequences of $\mathbb Z_+$ and $S(X)$ be the set of the values $h^*(T)$ for all…

Dynamical Systems · Mathematics 2019-05-01 Ľubomír Snoha , Xiangdong Ye , Ruifeng Zhang

This paper shows that for K a local field, k a subfield of K and X a variety over k, X is complete if and only if for every finite field extension K' of K, X(K') is compact in its strong topology.

Algebraic Geometry · Mathematics 2007-05-23 Oliver Lorscheid

Minority game is a model of heterogeneous players who think inductively. In this game, each player chooses one out of two alternatives every turn and those who end up in the minority side wins. It is instructive to extend the minority game…

Statistical Mechanics · Physics 2007-05-23 F. K. Chow , H. F. Chau

Two players take turns claiming empty cells from an $n\times n$ grid. The first player (if any) to occupy a transversal (a set of $ n $ cells having no two cells in the same row or column) is the winner. What is the outcome of the game…

Combinatorics · Mathematics 2025-07-08 Žarko Ranđelović