Related papers: Selection Games on Hyperspaces
Consider a situation with $n$ agents or players where some of the players form a coalition with a certain collective objective. Simple games are used to model systems that can decide whether coalitions are successful (winning) or not…
We develop a new method to compute the homology groups of finite topological spaces (or equivalently of finite partially ordered sets) by means of spectral sequences giving a complete and simple description of the corresponding…
Recommender systems are designed to predict user preferences over collections of items. These systems process users' previous interactions to decide which items should be ranked higher to satisfy their desires. An ensemble recommender…
Linkages are mechanical devices constructed from rigid bars and freely rotating joints studied both for their utility in engineering and as mathematical idealizations in a number of physical systems. Recently, there has been a resurgence of…
This article is a continuation of our investigations in the function space $C(X)$ with respect to the topology $\tau^s_\mathfrak{B}$ of strong uniform convergence on $\mathfrak{B}$ in line of (Chandra et al. 2020 \cite{dcpdsd} and Das et…
We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, decidability of average-energy games with a lower-bound…
Facility location games have been a topic of major interest in economics, operations research and computer science, starting from the seminal work by Hotelling. Spatial facility location models have successfully predicted the outcome of…
We characterize winning strategies in various infinite games involving filters on the natural numbers in terms of combinatorics or structural properties of the given filter. These generalize several ultrafilter games of Galvin.
For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…
The two main results of this work are the following: if a space $X$ is such that player II has a winning strategy in the game $\gone(\Omega_x, \Omega_x)$ for every $x \in X$, then $X$ is productively countably tight. On the other hand, if a…
The concept of biased Maker-Breaker games, introduced by Chv\'atal and Erd{\H o}s, is a central topic in the field of positional games, with deep connections to the theory of random structures. For any given hypergraph ${\cal H}$ the main…
Multiplayer games have long been used as testbeds in artificial intelligence research, aptly referred to as the Drosophila of artificial intelligence. Traditionally, researchers have focused on using well-known games to build strong agents.…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
We present a class of mappings between models with topological mass mechanism and purely topological models in arbitrary dimensions. These mappings are established by directly mapping the fields of one model in terms of the fields of the…
Chess is an emblematic sport that stands out because of its age, popularity and complexity. It has served to study human behavior from the perspective of a wide number of disciplines, from cognitive skills such as memory and learning, to…
Thermodynamic selection is an indirect competition between agents feeding on the same energy resource and obeying the laws of thermodynamics. We examine scenarios of this selection, where the agent is modeled as a heat-engine coupled to two…
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,…
We discuss a model for evolutionary game dynamics in a growing, network-structured population. In our model, new players can either make connections to random preexisting players or preferentially attach to those that have been successful…
Game-theoretic upper expectations are joint (global) probability models that mathematically describe the behaviour of uncertain processes in terms of supermartingales; capital processes corresponding to available betting strategies.…
We investigate how very large populations are able to reach a global consensus, out of local "microscopic" interaction rules, in the framework of a recently introduced class of models of semiotic dynamics, the so-called Naming Game. We…