Solitaire Clobber played on Hamming graphs.
Some hardness results for question/answer games.
Stability of Nash equilibria in locational games
The alternation hierarchy for the theory of -lattices.
The cover pebbling theorem.
Two variants of the size Ramsey number
Given a graph H and an integer r ≥ 2, let G → (H,r) denote the Ramsey property of a graph G, that is, every r-coloring of the edges of G results in a monochromatic copy of H. Further, let and define the Ramsey density as the infimum of m(G) over all graphs G such that G → (H,r). In the first part of this paper we show that when H is a complete graph Kₖ on k vertices, then , where R = R(k;r) is the classical Ramsey number. As a corollary we derive a new proof of the result credited to Chvatál...
Vertex deletion games with parity rules.
Winning positions in simplicial Nim.
Winning strong games through fast strategies for weak games.
-bicomplete categories and parity games
For an arbitrary category, we consider the least class of functors containing the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of functors that are definable by -terms. We call the category -bicomplete if every -term defines a functor. We provide concrete examples of such categories and explicitly characterize this class of functors for the category of sets and functions. This goal is achieved...
μ-Bicomplete Categories and Parity Games
For an arbitrary category, we consider the least class of functors containing the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of functors that are definable by μ-terms. We call the category μ-bicomplete if every μ-term defines a functor. We provide concrete examples of such categories and explicitly characterize this class of functors for the category of sets and functions. This goal is achieved...