Related papers: Topological games of bounded selections
Circular nim $CN(m, k)$ is a variant of nim, in which there are $m$ piles of tokens arranged in a circle and each player, in their turn, chooses at most $k$ consecutive piles in the circle and removes an arbitrary number of tokens from each…
A new geometrical setting for classical field theories is introduced. This description is strongly inspired in the one due to Skinner and Rusk for singular lagrangians systems. For a singular field theory a constraint algorithm is developed…
Topological statistical theory provides the foundation for a modern mathematical reformulation of classical statistical theory: Structural Statistics emphasizes the structural assumptions that accompany distribution families and the set of…
In classical spin systems with two largely different inherent time scales, the configuration of the fast spins almost instantaneously follows the slow-spin dynamics. We develop the emergent effective theory for the slow-spin degrees of…
Selective versions of screenability and of strong screenability coincide in a large class of spaces. We show that the corresponding games are not equivalent in even such standard metric spaces as the closed unit interval. We identify…
This paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic character of two theories developed in quite different fields: on one side, threshold logic, on the other side, simple games. One of the main…
CONTENTS: A surprising covering of the real line Unions of chains in dyadic compact spaces and topological groups On the Pytkeev property in spaces of continuous functions Selection principles related to alpha_i-properties On the Kocinac…
For a set-valued function $F$ on a compact subset $W$ of a manifold, spanning is a topological property that implies that $F(x) \ne 0$ for interior points $x$ of $W$. A myopic equilibrium applies when for each action there is a payoff whose…
New continuous and stochastic extensions of the minority game, devised as a fundamental model for a market of competitive agents, are introduced and studied in the context of statistical physics. The new formulation reproduces the key…
We present a new variant of the potential game and show that certain compact subsets of $\R^n$, including a large class of self-affine sets, are winning in our game. We prove that sets with sufficiently strong winning conditions are…
Let ${\mathcal A}\subset {\mathcal P}(X)$, $\emptyset, X\in {\mathcal A}$, ${\mathcal A}$ being closed under finite intersections. If $\psi={o},\omega,\gamma$, then $\Psi({\mathcal A})$ is the family of those $\psi$-covers ${\mathcal U}$…
Among the strategic choices made by today's economic actors are choices about algorithms and computational resources. Different access to computational resources may result in a kind of economic asymmetry analogous to information asymmetry.…
In this paper we propose and analyze a class of $N$-player stochastic games that include finite fuel stochastic games as a special case. We first derive sufficient conditions for the Nash equilibrium (NE) in the form of a verification…
We study selective and game-theoretic versions of properties like the ccc, weak Lindel\"ofness and separability, giving various characterizations of them and exploring connections between these properties and some classical cardinal…
Applying the classical Serre-Swan theorem, as this is extended to topological (non-normed) algebras, one attains a classification of elementary particles via their spin-structure. In this context, our argument is virtually based on a…
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 give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
We study stochastic evolution of optional games on simple graphs. There are two strategies, A and B, whose interaction is described by a general payoff matrix. In addition there are one or several possibilities to opt out from the game by…
Tournament solutions provide methods for selecting the "best" alternatives from a tournament and have found applications in a wide range of areas. Previous work has shown that several well-known tournament solutions almost never rule out…
We study a random game in which two players in turn play a fixed number of moves. For each move, there are two possible choices. To each possible outcome of the game we assign a winner in an i.i.d. fashion with a fixed parameter p. In the…