Extracting Winning Strategies in Update Games
Lists
Only you see this
Abstract
This paper investigates algorithms for extracting winning strategies in two-player games played on finite graphs. We focus on a special class of games called update games. We present a procedure for extracting winning strategies in update games by constructing strategies explicitly. This is based on an algorithm that solves update games in quadratic time. We also show that solving update games with a bounded number of nonkdeterministic nodes takes linear time.
BibTeX
@inproceedings{khaliq2011extracting,
author = {Imran Khaliq and Bakhadyr Khoussainov and Jiamou Liu},
title = {{Extracting Winning Strategies in Update Games}},
booktitle = {CiE},
year = {2011},
doi = {10.1007/978-3-642-21875-0\_15},
}Loading related content...