Veröffentlichung

Titel:

Playing weighted Tron on trees

AutorInnen:

Daniel Hoske
Jonathan Rollin
Torsten Ueckerdt
Stefan Walzer

Kategorie:

Artikel in Zeitschriften

erschienen in:

Discrete Mathematics, Vol. 338, No. 12, pp. 2341–2347, 2015

Abstract:

We consider the weighted version of the Tron game on graphs where two players, Alice and Bob, each build their own path by claiming one vertex at a time, starting with Alice. The vertices carry non-negative weights that sum up to 1 and either player tries to claim a path with larger total weight than the opponent. We show that if the graph is a tree then Alice can always ensure she receives 1/5 less than Bob or better, and this is best possible.

Download:

arXiv

BibTeX-Eintrag:

@article{, author = {Daniel Hoske and Jonathan Rollin and Torsten Ueckerdt and Stefan Walzer}, title = {Playing weighted Tron on trees}, journal = {Discrete Mathematics}, volume = {338}, number = {12}, pages = {2341--2347}, year = {2015}, }