Results 1  10
of
385,577
Meanpayoff parity games
 PROC. OF LICS, IEEE COMPUTER SOCIETY
"... Energy parity games are infinite twoplayer turnbased games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own i ..."
Abstract

Cited by 64 (12 self)
 Add to MetaCart
equivalent to the problem of deciding the winner in meanpayoff parity games, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve meanpayoff parity games.
Meanpayoff games and propositional proofs
, 2010
"... We associate a CNFformula to every instance of the meanpayoff game problem in such a way that if the value of the game is nonnegative the formula is satisfiable, and if the value of the game is negative the formula has a polynomialsize refutation in Σ2Frege (a.k.a. DNFresolution). This reduces ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
the problem of solving meanpayoff games to the weak automatizability of Σ2Frege, and to the interpolation problem for Σ2,2Frege. Since the interpolation problem for Σ1Frege (i.e. resolution) is solvable in polynomial time, our result is close to optimal up to the computational complexity of solving meanpayoff
MeanPayoff Automaton Expressions ⋆
"... Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Meanpayoff automata are finite automata with numerical weights on transitions that assign to each infinite path the longrun average of the transition weights. When the mode of branching o ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
problems are decidable for this class. Meanpayoff automaton expressions subsume deterministic meanpayoff automata, and we show that they have expressive power incomparable to nondeterministic and alternating meanpayoff automata. We also present for the first time an algorithm to compute distance between
PerfectInformation Stochastic MeanPayoff 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 2player 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
2player meanpayoff games. Our results are useful in the synthesis of stochastic reactive systems with both functional requirement (given as a qualitative objective) and performance requirement (given as a quantitative objective). 1
Stochastic Games with Parity Meanpayoff Objective
"... In this paper, we compute value of twoplayer games with perfect information equipped with the Par ∧ Avg>0 objectives. Moreover we show that even though the optimal strategies may require infinite memory, there exists an NP algorithm that computes the almostsure region. hal00766251, version 1 ..."
Abstract
 Add to MetaCart
In this paper, we compute value of twoplayer games with perfect information equipped with the Par ∧ Avg>0 objectives. Moreover we show that even though the optimal strategies may require infinite memory, there exists an NP algorithm that computes the almostsure region. hal00766251, version 1
Generalized meanpayoff and energy games
 CoRR
"... In meanpayoff 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 meanpayoff and energy games replace in ..."
Abstract

Cited by 47 (11 self)
 Add to MetaCart
the interreducibility of generalized meanpayoff and energy games for finitememory strategies. We also improve the computational complexity for solving both classes of games with finitememory strategies: while the previously best known upper bound was EXPSPACE, and no lower bound was known, we give an optimal co
Results 1  10
of
385,577