English
Related papers

Related papers: Countable Fan Tightness and Selection Games in Gro…

200 papers

We propose and study a new model for competitions, specifically sports multi-player leagues where the initial strengths of the teams are independent i.i.d. random variables that evolve during different days of the league according to…

Probability · Mathematics 2025-09-10 Jacopo Borga , Benedetta Cavalli

We consider a variant of the game of Cops and Robbers, called Containment, in which cops move from edge to adjacent edge, the robber moves from vertex to adjacent vertex (but cannot move along an edge occupied by a cop). The cops win by…

Combinatorics · Mathematics 2015-05-08 Pawel Pralat

Multiagent systems where agents interact among themselves and with a stochastic environment can be formalized as stochastic games. We study a subclass named Markov potential games (MPGs) that appear often in economic and engineering…

Multiagent Systems · Computer Science 2018-05-23 Sergio Valcarcel Macua , Javier Zazo , Santiago Zazo

Inspired by work of Scheepers and Tall, we use properties defined by topological games to provide bounds for the cardinality of topological spaces. We obtain a partial answer to an old question of Bell, Ginsburg and Woods regarding the…

General Topology · Mathematics 2013-02-22 Angelo Bella , Santi Spadaro

TheMinority Game (MG) has become a paradigm to probe complex social and economical phenomena where adaptive agents compete for a limited resource, and it finds applications in statistical and nonlinear physics as well. In the traditional MG…

Adaptation and Self-Organizing Systems · Physics 2012-04-16 Zi-Gang Huang , Ji-Qiang Zhang , Jia-Qi Dong , Liang Huang , Ying-Cheng Lai

In this note we study the open-point topological games in order to analyze the least upper bound for density of dense subsets of a topological space. This way we may also analyze the behavior of such cardinal invariants in taking products…

General Topology · Mathematics 2015-09-08 Jarno Talponen

We consider 2-player games played on a finite state space for infinite rounds. The games are concurrent: in each round, the two players choose their moves simultaneously; the current state and the moves determine the successor. We consider…

Computer Science and Game Theory · Computer Science 2013-06-21 Krishnendu Chatterjee

Let (G, X) be a second-countable transformation group with G acting freely on X. It is shown that measure-theoretic accumulation of the action and topological strength of convergence in the orbit space X/G provide equivalent ways of…

Operator Algebras · Mathematics 2007-05-23 Robert Archbold , Astrid an Huef

We consider a nonzero-sum N-player Markov game on an abstract measurable state space with compact metric action spaces. The payoff functions are bounded Carath\'eodory functions and the transitions of the system are assumed to have a…

Optimization and Control · Mathematics 2023-05-09 François Dufour , Tomás Prieto-Rumeau

Partially Observable Markov Games (POMGs) provide a general framework for modeling multi-agent sequential decision-making under asymmetric information. A common approach is to reformulate a POMG as a fully observable Markov game over belief…

Multiagent Systems · Computer Science 2026-04-08 Lan Sang , Chinmay Maheshwari

An old question of A.V. Arhangel'skii asks if the Menger property of a Tychonoff space $X$ is preserved by homeomorphisms of its function space $C_p(X)$. We provide affirmative answer in the case of linear homeomorphisms. To this end, we…

General Topology · Mathematics 2023-11-27 Mikołaj Krupski

We study two-player reachability games on finite graphs. At each state the interaction between the players is concurrent and there is a stochastic Nature. Players also play stochastically. The literature tells us that 1) Player B, who wants…

Computer Science and Game Theory · Computer Science 2021-10-29 Benjamin Bordais , Patricia Bouyer , Stéphane Le Roux

It is well-known that for infinitely repeated games, there are computable strategies that have best responses, but no computable best responses. These results were originally proved for either specific games (e.g., Prisoner's dilemma), or…

Computer Science and Game Theory · Computer Science 2020-06-11 Jakub Dargaj , Jakob Grue Simonsen

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

The goal of this paper is to show that the local Gr\"obner fan is a polyhedral fan for ideals in the ring of power series and the homogenized ring of analytic differential operators. We will also discuss about relations between the local…

Algebraic Geometry · Mathematics 2007-05-23 Rouchdi Bahloul , Nobuki Takayama

Markov games with coupling constraints model constrained dynamical decision-making involving self-interested agents, where the feasibility of an individual agent's strategy depends on the joint strategies of the others. Such games arise in…

Computer Science and Game Theory · Computer Science 2026-05-27 Tingting Ni , Anna Maddux , Maryam Kamgarpour

Using a game-theoretic approach we present a generalization of the classical result of Brzuchowski, Cicho\'n, Grzegorek and Ryll-Nardzewski on non-measurable unions. We also present applications of obtained results to Marczewski--Burstin…

General Topology · Mathematics 2022-06-14 Taras Banakh , Robert Rałowski , Szymon Żeberski

In this paper we consider the question of when the space $C_p(X)$ of continuous real-valued functions on $X$ with the pointwise convergence topology is countable dense homogeneous. In particular, we focus on the case when $X$ is countable…

General Topology · Mathematics 2022-01-19 Rodrigo Hernández-Gutiérrez

We show that the *-algebra of the product of two synchronous games is the tensor product of the corresponding *-algebras. We prove that the product game has a perfect C*-strategy if and only if each of the individual games does, and that in…

Operator Algebras · Mathematics 2024-09-25 Laura Mančinska , Vern I. Paulsen , Ivan G. Todorov , Andreas Winter

We study stochastic zero-sum games on graphs, which are prevalent tools to model decision-making in presence of an antagonistic opponent in a random environment. In this setting, an important question is the one of strategy complexity: what…

Computer Science and Game Theory · Computer Science 2024-02-14 Patricia Bouyer , Youssouf Oualhadj , Mickael Randour , Pierre Vandenhove