Results 1  10
of
113,790
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 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
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
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
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
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
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
Looking at MeanPayoff and TotalPayoff through Windows
, 2013
"... We consider twoplayer games played on weighted directed graphs with meanpayoff and totalpayoff objectives, two classical quantitative objectives. While for singledimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multidimensional meanp ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We consider twoplayer games played on weighted directed graphs with meanpayoff and totalpayoff objectives, two classical quantitative objectives. While for singledimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multidimensional meanpayoff
Energy and meanpayoff parity Markov decision processes
, 2011
"... Abstract. We consider Markov Decision Processes (MDPs) with meanpayoff parity and energy parity objectives. In system design, the parity objective is used to encode ωregular specifications, while the meanpayoff and energy objectives can be used to model quantitative resource constraints. The ener ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract. We consider Markov Decision Processes (MDPs) with meanpayoff parity and energy parity objectives. In system design, the parity objective is used to encode ωregular specifications, while the meanpayoff and energy objectives can be used to model quantitative resource constraints
BLACKWELL OPTIMAL STRATEGIES IN PRIORITY Meanpayoff Games
, 2012
"... We examine perfect information stochastic meanpayoff games – a class of games containing as special subclasses the usual meanpayoff games and parity games. We show that deterministic memoryless strategies that are optimal for discounted games with statedependent discount factors close to 1 are ..."
Abstract
 Add to MetaCart
We examine perfect information stochastic meanpayoff games – a class of games containing as special subclasses the usual meanpayoff games and parity games. We show that deterministic memoryless strategies that are optimal for discounted games with statedependent discount factors close to 1
A Note on the Approximation of MeanPayoff Games
"... Abstract. We consider the problem of designing approximation schemes for the values of meanpayoff games. It was recently shown that (1) meanpayoff with rational weights scaled on [−1, 1] admit additive fullypolynomial approximation schemes, and (2) meanpayoff games with positive weights admit re ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We consider the problem of designing approximation schemes for the values of meanpayoff games. It was recently shown that (1) meanpayoff with rational weights scaled on [−1, 1] admit additive fullypolynomial approximation schemes, and (2) meanpayoff games with positive weights admit
Results 1  10
of
113,790