In this paper, we compare the offline versions of three Ramsey-type oneplayer games that have been studied in an online setting in previous work: the online Ramsey game, the balanced online Ramsey game, and the Achlioptas game. The goal in all games is to color the edges of the random graph Gn,m according to certain rules without creating a monochromatic copy of some fixed forbidden graph H. Wh...

The model comprises three hierarchical levels: individual, population, and environment. Each individual is characterized by five state variables: (1) identity number; three heritable and evolving traits corresponding to (2) the probability h (0 ≤ ) to adopt the aggressive hawk behavior in the Hawk-Dove game; (3) in the scenario with binary physiological h ≤ 1 traits, the probability m ( ) to ad...

We first characterize a two-person, zero-sum game. 1. There are two players, P1 and P2. 2. P1 has a set A = {a1, a2, . . . , am} of m pure strategies (actions). 3. P2 has a set B = {b1, b2, . . . , bn} of n pure strategies (actions). 4. Each player has a utility for each (ai, bj) pair of actions. The utility for P1 is denoted U1(ai, bj) and the utility for P2 is denoted U2(ai, bj). Since this i...

Recently, Wu and Huang [I.-C. Wu, D.-Y. Huang, A new family of k-in-a-row games, in: The 11th Advances in Computer Games Conference, ACG’11, Taipei, Taiwan, September 2005] introduced a new game called Connect6, where two players, Black and White, alternately place two stones of their own color, black and white respectively, on an empty Go-like board, except for that Black (the first player) pl...

Given a family F and a host graph H, a graph G ⊆ H is F-saturated relative to H if no subgraph of G lies in F but adding any edge from E(H)−E(G) to G creates such a subgraph. In the F-saturation game on H, players Max and Min alternately add edges of H to G, avoiding subgraphs in F , until G becomes F-saturated relative to H. They aim to maximize or minimize the length of the game, respectively...

One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is know...

We provide some examples showing how game-theoretic arguments (the approach that goes back to Lachlan and was developed by An. Muchnik) can be used in computability theory and algorithmic information theory. To illustrate this technique, we start with a proof of a classical result, the unique numbering theorem of Friedberg, translated to the game language. Then we provide game-theoretic proofs ...

As hemophilia is a chronic bleeding diseaseand can interfere with daily performanceof children, these children require continuoustraining to prevent bleeding and take timely action(1). Since children nurses play an important role inthe education of involved children and their Selfefficacyand also due to today’s approach whichis using educational computer games, the use ofeducational games in re...

The slow-coloring game is played by Lister and Painter on a graph G. On each round, Lister marks a nonempty subset M of the remaining vertices, scoring |M | points. Painter then gives a color to a subset of M that is independent in G. The game ends when all vertices are colored. Painter’s goal is to minimize the total score; Lister seeks to maximize it. The score that each player can guarantee ...