Related papers: Games on base matrices
We study chip-firing games on multigraphs whose underlying simple graphs are trees, paths, and stars, denoted as banana trees, paths, and stars respectively. We present a polynomial time algorithm to compute the divisorial gonality of…
We formulate a class of mean field games on a finite state space with variational principles resembling those in continuous-state mean field games. We construct a controlled continuity equation featuring a nonlinear activation function on…
We investigate the set-theoretic properties of the lattice of projections in the Calkin algebra of a separable infinite-dimensional Hilbert space in relation to those of the Boolean algebra $P(\omega)/{\rm fin}$, which is isomorphic to the…
A matching game is a cooperative profit game defined on an edge-weighted graph, where the players are the vertices and the profit of a coalition is the maximum weight of matchings in the subgraph induced by the coalition. A population…
Merging asymptotic expansions of arbitrary length are established for the distribution functions and for the probabilities of suitably centered and normalized cumulative winnings in a full sequence of generalized St. Petersburg games,…
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current position, and not on the history of the play. A game is…
We consider perfect-information reachability stochastic games for 2 players on infinite graphs. We identify a subclass of such games, and prove two interesting properties of it: first, Player Max always has optimal strategies in games from…
We consider extensive games with perfect information with well-founded game trees and study the problems of existence and of characterization of the sets of subgame perfect equilibria in these games. We also provide such characterizations…
We characterize which graph invariants are partition functions of a spin model over the complex numbers, in terms of the rank growth of associated `connection matrices'.
The basic result of this note is a statement about the existence of families of partitions of the set of natural numbers with some favourable properties, the n-optimal matrices of partitions. We use this to improve a decomposition result…
We study maximal orthogonal families of Borel probability measures on $2^\omega$ (abbreviated m.o. families) and show that there are generic extensions of the constructible universe $L$ in which each of the following holds: (1) There is a…
We present a novel coalgebraic formulation of infinite extensive games. We define both the game trees and the strategy profiles by possibly infinite systems of corecursive equations. Certain strategy profiles are proved to be subgame…
For a graph consider the pairs of disjoint matchings which union contains as many edges as possible, and define a parameter $\alpha$ which eqauls the cardinality of the largest matching in those pairs. Also, define $\betta$ to be the…
Mean-payoff games (MPGs) are infinite duration two-player zero-sum games played on weighted graphs. Under the hypothesis of perfect information, they admit memoryless optimal strategies for both players and can be solved in…
We consider zero-sum games in which players move between adjacent states, where in each pair of adjacent states one state dominates the other. The states in our game can represent positional advantages in physical conflict such as high…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
Let $S=(C \times D)/G$ be a surface isogenous to a higher product of unmixed type with $p_g=q=0$, $G=(\mathbb{Z}/2)^3$ or $(\mathbb{Z}/2)^4$. We construct exceptional sequences of maximal length and quasiphantom categories on $S$.
Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…
In 1992, Diestel asked which topological spaces could be represented as the end space of some graph. In 2023, Pitz provided a solution to this question by giving a topological characterization of end spaces using a hereditarily complete…
We introduce the concept of a \emph{cycle pattern} for directed graphs as functions from the set of cycles to the set $\{-,0,+\}$. The key example for such a pattern is derived from a weight function, giving rise to the sign of the total…