Graph Sharing Games: Complexity and Connectivity
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10050464" target="_blank" >RIV/00216208:11320/10:10050464 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Graph Sharing Games: Complexity and Connectivity
Original language description
We study a combinatorial game played by two players, Alice and Bob, on a given weighted graph G. The game generalizes the Pizza game considered by Brown, Winkler and others. We show that, for every epsilon } 0 and for every k }= 1 there is a k-connectedgraph G for which Bob has a strategy to obtain 1-epsilon of the total weight of the vertices. We also study the computational complexity of deciding whether Alice has a winning strategy in this and one related game.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS
ISBN
978-3-642-13561-3
ISSN
0302-9743
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
Springer-Verlag
Place of publication
Berlin
Event location
Praha
Event date
Jun 7, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000279560400030