Combinatorial structure and randomized subexponential algorithms for infinite games

The complexity of solving infinite games, including parity, mean payoff, and simple stochastic, is an important open problem in verification, automata, and complexity theory. In this paper, we develop an abstract setting for studying and solving such games, based on function optimization over certai...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 349; no. 3; pp. 347 - 360
Main Authors:	Björklund, Henrik, Vorobyov, Sergei
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.12.2005 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Calculus of variations and optimal control Combinatorial linear programming Completely unimodal functions Computer science; control theory; systems Exact sciences and technology Game theory Mathematical analysis Mathematical programming Mathematics Mean payoff games Operational research and scientific management Operational research. Management science Parity games Pseudo-Boolean optimization Randomized algorithms Sciences and techniques of general use Simple stochastic games Theoretical computing Parity games Simple stochastic games Pseudo-Boolean optimization Completely unimodal functions Combinatorial linear programming Randomized algorithms Mean payoff games Computer theory Parity game Mean playoff game Optimization method Combinatorial algorithm Linear programming Verification Pseudo boolean optimization Function evaluation Stochastic game Automata theory Strategy Mean payoff games: Simple stochastic games
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!