Journal ArticleDOI
Positional strategies for mean payoff games
A. Ehrenfeucht,Jan Mycielski +1 more
Reads0
Chats0
TLDR
In this article, the authors studied games of perfect information in which two players move alternately along the edges of a finite directed graph with weights attached to its edges, and one player wants to maximize and the other wants to minimize some means of the encountered weights.Abstract:
We study some games of perfect information in which two players move alternately along the edges of a finite directed graph with weights attached to its edges. One of them wants to maximize and the other to minimize some means of the encountered weights.read more
Citations
More filters
Journal ArticleDOI
The complexity of mean payoff games on graphs
Uri Zwick,Mike Paterson +1 more
TL;DR: In this paper, the authors studied the complexity of finding the values and optimal strategies of mean payoff games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered by Gurvich, Karzanov and Khachiyan.
Journal ArticleDOI
Deciding the winner in parity games is in UP ∩ co-UP
TL;DR: A simple reduction from parify games to mean payoff games is shown and it follows that deciding the winner in parity games and the modal μ-calculus model checking are in UP ∩ co-UP.
Book ChapterDOI
A Discrete Strategy Improvement Algorithm for Solving Parity Games
Jens Vöge,Marcin Jurdziński +1 more
TL;DR: In this article, a discrete strategy improvement algorithm for parity games is given for constructing winning strategies in parity games, thereby providing also a new solution of the model-checking problem for the modal μ-calculus.
Book ChapterDOI
Infinite Runs in Weighted Timed Automata with Energy Constraints
TL;DR: This work considers automata equipped with positive and negative weights on transitions and locations, corresponding to the production and consumption of some resource, and asks the question whether there exists an infinite path for which the accumulated weight for any finite prefix satisfies certain constraints.
Book ChapterDOI
Better Quality in Synthesis through Quantitative Objectives
TL;DR: In this paper, the synthesis of optimal implementations requires the solution of lexicographic mean-payoff games (for safety requirements), and games with both lexicoographic mean payoff and parity objectives (for liveness requirements).
References
More filters