Related papers: Games on base matrices

Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to…

As an alternative view to the graph formation models in the statistical physics community, we introduce graph formation models using \textit{network formation} through selfish competition as an approach to modeling graphs with particular…

We consider a subcritical Galton--Watson tree conditioned on having $n$ vertices with outdegree in a fixed set $\Omega$. Under mild regularity assumptions we prove various limits related to the maximal offspring of a vertex as $n$ tends to…

We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…

The results of the previous version are impoved. This basically completes the study of consistency strength of various gaps between a strong limit singular cardinal of cofinality omega and its power under GCH type assumptions below.

It is shown that Borel games of length $\omega^2$ are determined if, and only if, for every countable ordinal $\alpha$, there is a fine-structural, countably iterable extender model of Zermelo set theory with $\alpha$-many iterated…

Let $\mathcal{A} = \{A_1, \ldots, A_m\}$ and $\mathcal{B} = \{B_1, \ldots, B_n\}$ be a pair of dual multi-hypergraphs on the common ground set $O = \{o_1, \ldots, o_k\}$. Note that each of them may have embedded or equal edges. An edge is…

A square matrix $M$ represents a graph $\Gamma$ if its nonzero off-diagonal entries encode the adjacencies of $\Gamma$, subject to a fixed ordering of the vertices. Over the field of two elements, we investigate the distribution of ranks in…

Let $\Omega \subset \mathbb{R}^{n}$ be bounded a domain. We prove under certain structural assumptions that the fractional maximal operator relative to $\Omega$ maps $L^{p}(\Omega) \to W^{1,p}(\Omega)$ for all $p > 1$, when the smoothness…

In this work, we relate girth and path-degeneracy in classes with sub-exponential expansion, with explicit bounds for classes with polynomial expansion and proper minor-closed classes that are tight up to a constant factor (and tight up to…

One proves a far-reaching upper bound for the degree of a generically finite rational map between projective varieties over a base field of arbitrary characteristic. The bound is expressed as a product of certain degrees that appear…

The basis number of a graph $G$ is the minimum $k$ such that the cycle space of $G$ is generated by a family of cycles using each edge at most $k$ times. A classical result of Mac Lane states that planar graphs are exactly graphs with basis…

We introduce a new type of positional games, played on a vertex set of a graph. Given a graph $G$, two players claim vertices of $G$, where the outcome of the game is determined by the subgraphs of $G$ induced by the vertices claimed by…

We prove an n-EXPTIME lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches the known upper bound for parity games on HPDA. As a consequence the…

We model the formation of networks as a game where players aspire to maximize their own centrality by increasing the number of other players to which they are path-wise connected, while simultaneously incurring a cost for each added…

Let H be a homology theory for algebraic varieties over a field k. To a complete k-variety X, one naturally attaches an ideal of the coefficient ring H(k). We show that, when X is regular, this ideal depends only on the upper Chow motive of…

Let (A) and (B) be two first order structures of the same vocabulary. We shall consider the Ehrenfeucht-Fra{i}sse-game of length omega_1 of A and B which we denote by G_{omega_1}(A,B). This game is like the ordinary Ehrenfeucht-Fraisse-game…

A graph $G$ is terminal-pairable with respect to a demand multigraph $D$ on the same vertex set as $G$, if there exists edge-disjoint paths joining the end vertices of every demand edge of $D$. In this short note, we improve the upper bound…

We consider the problem of solving random parity games. We prove that parity games exibit a phase transition threshold above $d_P$, so that when the degree of the graph that defines the game has a degree $d > d_P$ then there exists a…

Mean-payoff games are important quantitative models for open reactive systems. They have been widely studied as games of full observation. In this paper we investigate the algorithmic properties of several sub-classes of mean-payoff games…