English
Related papers

Related papers: Games with finitely generated structures

200 papers

We present a version of the Banach-Mazur game, where open sets are replaced by elements of a fixed partially ordered set. We show how to apply it in the theory of Fraisse limits and beyond, obtaining simple proofs of universality of certain…

Logic · Mathematics 2015-05-06 Wieslaw Kubiś

We give topological and game theoretic definitions and theorems nec- essary for defining a Banach-Mazur game, and apply these definitions to formalize the game. We then state and prove two theorems which give necessary conditions for…

General Topology · Mathematics 2018-06-12 Anumat Srivastava

Matthew Baker investigated, in previous work, an elegant, infinite-length game that may be used to study subsets of real numbers. We present two accessible examples of how an important technique from set theory, or a different technique…

Logic · Mathematics 2022-09-07 Will Brian , Steven Clontz

The classical Banach-Mazur game is directly related to the Baire property and the property of being a productively Baire space. In this paper, we discuss two variations of this classic game that are even more related to these properties.

General Topology · Mathematics 2021-04-09 Leandro Fiorini Aurichi , Maddalena Bonanzinga , Gabriel Andre Asmat Medina

We discuss a variant of the Banach-Mazur game which has applications to topological open mapping and closed graph theorems.

General Topology · Mathematics 2022-11-02 Dominikus Noll

Pursuing a new approach to the study of infinite games in combinatorics, we introduce the categories $\mathbf{Game}_{A}$ and $\mathbf{Game}_{B}$ and improve some classical results concerning topological games related to the duality between…

General Topology · Mathematics 2025-11-11 Matheus Duzi , Paul Szeptycki , Walter Tholen

We present a simple and natural infinite game building an increasing chain of finite-dimensional Banach spaces. We show that one of the players has a strategy with the property that, no matter how the other player plays, the completion of…

Functional Analysis · Mathematics 2021-08-25 W. Kubiś

We introduce two new mathematical games, the Banach-Mazur-Schmidt game and the Banach-Mazur-McMullen game, merging well-known games. We investigate the properties of the games, as well as providing an application to Diophantine…

Number Theory · Mathematics 2015-11-03 Lior Fishman , Vanessa Reams , David Simmons

In 2006, Varacca and V\"olzer proved that on finite graphs, omega-regular large sets coincide with omega-regular sets of probability 1, by using the existence of positional strategies in the related Banach-Mazur games. Motivated by this…

Logic in Computer Science · Computer Science 2013-07-18 Thomas Brihaye , Quentin Menet

An infinite game on the set of real numbers appeared in Matthew Baker's work [Math. Mag. 80 (2007), no. 5, pp. 377--380] in which he asks whether it can help characterize countable subsets of the reals. This question is in a similar spirit…

Logic · Mathematics 2024-08-28 Tonatiuh Matos-Wiederhold , Luciano Salvetti

We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…

Computer Science and Game Theory · Computer Science 2016-07-13 Stéphane Le Roux , Arno Pauly

We study classes of graded structures satisfying the properties of amalgamation, joint embedding and hereditariness. Given appropriate conditions, we can build a graded analogue of the Fraisse limit. Some examples such as the class of all…

Logic · Mathematics 2018-09-24 Guillermo Badia , Carles Noguera

We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…

Computer Science and Game Theory · Computer Science 2017-01-03 Stéphane Le Roux , Arno Pauly

Relying on recent generalizations of the Fra\"iss\'e theory to a broader category-theoretic context, we study the class of abstract finite games played between two players and show the existence of an infinitetly countable game which is…

General Mathematics · Mathematics 2025-11-18 Matheus Duzi , Paul Szeptycki , Walter Tholen

There are many combinatorial games in which a move can terminate the game, such as a checkmate in chess. These moves give rise to diverse situations that fall outside the scope of the classical normal play structure. To analyze these games,…

Combinatorics · Mathematics 2024-02-09 Urban Larsson , Richard J. Nowakowski , Carlos P. Santos

We study a natural hierarchy in first-order logic, namely the quantifier structure hierarchy, which gives a systematic classification of first-order formulas based on structural quantifier resource. We define a variant of…

Logic in Computer Science · Computer Science 2015-07-01 Yuguo He

Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic…

Combinatorics · Mathematics 2019-05-03 Nicholas Ham

Intuitionistic fuzzy Banach algebra is introduced and a few properties of it is studied. The properties of invertible elements and relation among invertible elements, open set, closed set are emphasized. Topological divisors of zero is…

General Mathematics · Mathematics 2010-09-20 Bivas Dinda , T. K. Samanta , U. K. Bera

Given a free ideal J of subsets of a set X, we consider games where player ONE plays an increasing sequence of elements of the sigma completion of J, and TWO tries to cover the union of this sequence by playing one set at a time from J. We…

Logic · Mathematics 2009-09-25 Tomek Bartoszynski , Winfried Just , Marion Scheepers

Two-player stochastic games are games with two 2 players and a randomised entity called "nature". A natural question to ask in this framework is the existence of strategies that ensure that an event happens with probability 1 (almost-sure…

Computer Science and Game Theory · Computer Science 2018-06-27 Youssouf Oualhadj , Léo Tible , Daniele Varacca
‹ Prev 1 2 3 10 Next ›