✦ LIBER ✦

Combinatorial games on a graph

✍ Scribed by Claude Berge

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 365 KB
Volume: 151
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00081-s

No coin nor oath required. For personal study only.

✦ Synopsis

Survey of various problems about combinatorial games.

O. Introduction

A combinatorial game is the situation where two players, usually called A and B, play alternately by selecting an element in a finite set X according to fixed rules; the first player to achieve a certain configuration has won, and his opponent has lost.

In fact, there are three types of games, and they all have a general formulation with a graph: this paper is a survey of the general results and problems related to these formulations.

📜 SIMILAR VOLUMES

On a combinatorial game

✍ P Erdös; J.L Selfridge 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Asymmetric graph coloring games

✍ H. A. Kierstead 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract We introduce the (__a,b__)‐coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors __a__ vertices and Bob colors __b__ vertices. We also introduce a relat

A search game on a cyclic graph

✍ Kensaku Kikuta 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

A note concerning asymmetric games on gr

A note concerning asymmetric games on graphs

✍ Alvin E. Roth 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

## Abstract We consider a class of asymmetric two‐person games played on graphs, and characterize all the positions in the game.

Pursuit—Evasion games on graphs

✍ F. R. K. Chung; Joel E. Cohen; R. L. Graham 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 324 KB

Infiltration games on arbitrary graphs

✍ Steve Alpern 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 148 KB