License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2008.1765
URN: urn:nbn:de:0030-drops-17650
URL: http://drops.dagstuhl.de/opus/volltexte/2008/1765/
Go to the corresponding Portal


Jurdzinski, Marcin ; Trivedi, Ashutosh

Average-Time Games

pdf-format:
Document 1.pdf (450 KB)


Abstract

An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by taking turns to perform a timed transition. Player Min wants to minimize the average time per transition and player Max wants to maximize it. A solution of average-time games is presented using a reduction to average-price game on a finite graph. A direct consequence is an elementary proof of determinacy for average-time games. This complements our results for reachability-time games and partially solves a problem posed by Bouyer et al., to design an algorithm for solving average-price games on priced timed automata. The paper also establishes the exact computational complexity of solving average-time games: the problem is EXPTIME-complete for timed automata with at least two clocks.

BibTeX - Entry

@InProceedings{jurdzinski_et_al:LIPIcs:2008:1765,
  author =	{Marcin Jurdzinski and Ashutosh Trivedi},
  title =	{{Average-Time Games}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
  pages =	{340--351},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-08-8},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{2},
  editor =	{Ramesh Hariharan and Madhavan Mukund and V Vinay},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1765},
  URN =		{urn:nbn:de:0030-drops-17650},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2008.1765},
  annote =	{Keywords: Games on Timed Automata, Mean-payoff Games, Average-Time Games, Game Theory}
}

Keywords: Games on Timed Automata, Mean-payoff Games, Average-Time Games, Game Theory
Seminar: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
Issue Date: 2008
Date of publication: 05.12.2008


DROPS-Home | Fulltext Search | Imprint Published by LZI