Related papers: Selection Games with Minimal Usco Maps

The minority game is a simple congestion game in which the players' main goal is to choose among two options the one that is adopted by the smallest number of players. We characterize the set of Nash equilibria and the limiting behavior of…

We study variations on combinatorial games in which, instead of alternating moves, the players bid with discrete bidding chips for the right to determine who moves next. We consider both symmetric and partisan games, and explore differences…

We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stochastic games played on the transition graph of classic…

Game comonads offer a categorical view of a number of model-comparison games central to model theory, such as pebble and Ehrenfeucht-Fra\"iss\'e games. Remarkably, the categories of coalgebras for these comonads capture preservation of…

We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such…

The paper is concerned with the deterministic limit of mean field games with the nonlocal coupling. It is assumed that the dynamics of mean field games are given by nonlinear Markov processes. This type of games includes stochastic mean…

Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…

This paper develops a unified framework for zero-sum games in which both the pure strategies and the payoff matrices contain complex-valued entries. By leveraging a linear isomorphism between complex and real vector spaces, we extend key…

In a pursuit-evasion game, a team of pursuers attempt to capture an evader. The players alternate turns, move with equal speed, and have full information about the state of the game. We consider the most restictive capture condition: a…

Without further ado, we present the P_3-game. The P_3-game is decidable for elementary classes of graphs such as paths and cycles. From an algorithmic point of view, the connected P_3-game is fascinating. We show that the connected P_3-game…

In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in…

We propose the study of mathematical ludology, which aims to formally interrogate questions of interest to game studies and game design in particular. The goal is to extend our mathematical understanding of complex games beyond…

We use ideas from distributed computing and game theory to study dynamic and decentralized environments in which computational nodes, or decision makers, interact strategically and with limited information. In such environments, which arise…

Temporal graphs are a popular modelling mechanism for dynamic complex systems that extend ordinary graphs with discrete time. Simply put, time progresses one unit per step and the availability of edges can change with time. We consider the…

We extend the open games framework for compositional game theory to encompass also mixed strategies, making essential use of the discrete probability distribution monad. We show that the resulting games form a symmetric monoidal category,…

Concavity and its refinements underpin tractability in multiplayer games, where players independently choose actions to maximize their own payoffs which depend on other players' actions. In concave games, where players' strategy sets are…

Every quasi-attractor of an iterated function system (IFS) of continuous functions on a first-countable Hausdorff topological space is renderable by the probabilistic chaos game. By contrast, we prove that the backward minimality is a…

We study minimum integer representations of weighted games, i.e., representations where the weights are integers and every other integer representation is at least as large in each component. Those minimum integer representations, if the…

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)…

The notion of "pseudocompactness" was introduced by Hewitt. The concept of relatively countably compact subspaces were explored by Marjanovic to show that a $\Psi$-space is pseudocompact. A topological space is said to be DRC (DRS) iff it…