Article Dans Une Revue International Journal of Game Theory Année : 2019

Chomp on generalized Kneser graphs and others

Résumé

In chomp on graphs, two players alternatingly pick an edge or a vertex from a graph. The player that cannot move any more loses. The questions one wants to answer for a given graph are: Which player has a winning strategy? Can a explicit strategy be devised? We answer these questions (and determine the Nim-value) for the class of generalized Kneser graphs and for several families of Johnson graphs. We also generalize some of these results to the clique complexes of these graphs. Furthermore, we determine which player has a winning strategy for some classes of threshold graphs.

Dates et versions

hal-02068632 , version 1 (15-03-2019)

Identifiants

Citer

Ignacio García-Marco, Kolja Knauer, Luis Pedro Montejano. Chomp on generalized Kneser graphs and others. International Journal of Game Theory, 2019, ⟨10.1007/s00182-019-00697-x⟩. ⟨hal-02068632⟩
91 Consultations
0 Téléchargements

Altmetric

Partager

  • More