Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
451
The Complexity of Mean Payoff Games on Graphs
- THEORETICAL COMPUTER SCIENCE
, 1996
"... We study 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. We describe a pseudo-polynomial time algorithm for the solution of suc ..."
Abstract
-
Cited by 143 (4 self)
- Add to MetaCart
We study 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. We describe a pseudo-polynomial time algorithm for the solution
Deterministic priority mean-payoff games as limits of discounted games
, 2006
"... Inspired by the paper of de Alfaro, Henzinger and Majumdar [2] about discounted µ-calculus we show new surprising links between parity games and different classes of discounted games. ..."
Abstract
-
Cited by 7 (6 self)
- Add to MetaCart
Inspired by the paper of de Alfaro, Henzinger and Majumdar [2] about discounted µ-calculus we show new surprising links between parity games and different classes of discounted games.
A subexponential lower bound for the Random Facet algorithm for Parity Games
"... Parity Games form an intriguing family of infinite duration games whose solution is equivalent to the solution of important problems in automatic verification and automata theory. They also form a very natural subclass of Deterministic Mean Payoff Games, which in turn is a very natural subclass of t ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
Parity Games form an intriguing family of infinite duration games whose solution is equivalent to the solution of important problems in automatic verification and automata theory. They also form a very natural subclass of Deterministic Mean Payoff Games, which in turn is a very natural subclass
Blackwell-optimal strategies in priority mean-payoff games
- In GandALF 2010, First International Symposium on Games, Automata, Logics and Formal Verification, volume 25 of Electronic Proceedings in Theoretical Computer Science
, 2010
"... We examine perfect information stochastic mean-payoff games – a class of games containing as special sub-classes the usual mean-payoff games and parity games. We show that deterministic memoryless strategies that are optimal for discounted games with state-dependent discount factors close to 1 are o ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
We examine perfect information stochastic mean-payoff games – a class of games containing as special sub-classes the usual mean-payoff games and parity games. We show that deterministic memoryless strategies that are optimal for discounted games with state-dependent discount factors close to 1
BLACKWELL OPTIMAL STRATEGIES IN PRIORITY Mean-payoff Games
, 2012
"... We examine perfect information stochastic mean-payoff games – a class of games con-taining as special sub-classes the usual mean-payoff games and parity games. We show that deterministic memoryless strategies that are optimal for discounted games with state-dependent discount factors close to 1 are ..."
Abstract
- Add to MetaCart
We examine perfect information stochastic mean-payoff games – a class of games con-taining as special sub-classes the usual mean-payoff games and parity games. We show that deterministic memoryless strategies that are optimal for discounted games with state-dependent discount factors close to 1
Potential theory for mean payoff#11; games
- JOURNAL OF MATHEMATICAL SCIENCES
, 2007
"... We present an O(mn2^n log Z) deterministic algorithm for solving the mean payoff#11; game problem, m and n being respectively the number of arcs and vertices in the game
graph and Z being the maximum weight (we assume that the weights are integer numbers). The theoretical basis for the algorithm is ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
We present an O(mn2^n log Z) deterministic algorithm for solving the mean payoff#11; game problem, m and n being respectively the number of arcs and vertices in the game
graph and Z being the maximum weight (we assume that the weights are integer numbers). The theoretical basis for the algorithm
Perfect-Information Stochastic Mean-Payoff Parity Games ⋆,⋆⋆
"... Abstract The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic processes, we use 2 1 2-player games where some transitions of the game graph are controlled by two adversarial players, the System and the Environment, and the other ..."
Abstract
- Add to MetaCart
of deciding whether the System can ensure that the probability to satisfy the mean-payoff parity objective is at least a given threshold is in NP∩coNP, matching the best known bound in the special case of 2-player games (where all transitions are deterministic). We present an algorithm running in timeO(d·n 2d
The complexity of mean payoff games
- THEORETICAL COMPUTER SCIENCE
"... We study the complexity of nding the values and optimal strategies of mean payoff games, a family of perfect information games introduced by Ehrenfeucht and Mycielski. We describe a pseudo-polynomial time algorithm for the solution of such games, the decision problem for which is in NP ∩ co-NP. Fi ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
We study the complexity of nding the values and optimal strategies of mean payoff games, a family of perfect information games introduced by Ehrenfeucht and Mycielski. We describe a pseudo-polynomial time algorithm for the solution of such games, the decision problem for which is in NP ∩ co
Generalized mean-payoff and energy games
- CoRR
"... In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Generalized mean-payoff and energy games replace in ..."
Abstract
-
Cited by 44 (11 self)
- Add to MetaCart
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Generalized mean-payoff and energy games replace
Results 1 - 10
of
451
