Results 1  10
of
46
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
, 2011
"... Parity games form an intriguing family of infinitary payoff 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 mean and discounted payoff games, which in turn are very natural subclasses ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
families can be solved in deterministic polynomial time. Policy iteration is one of the most important algorithmic schemes for solving infinitary payoff games. It is parameterized by an improvement rule that determines how to proceed in the iteration from one policy to the next. It is a major open problem
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
of deciding whether the System can ensure that the probability to satisfy the meanpayoff parity objective is at least a given threshold is in NP∩coNP, matching the best known bound in the special case of 2player games (where all transitions are deterministic). We present an algorithm running in timeO(d·n 2d
Energy 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 60 (11 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.
An exponential lower bound for the latest deterministic strategy iteration algorithms
"... This paper presents a new exponential lower bound for the two most popular deterministic variants of the strategy improvement algorithm for solving parity, mean payoff, discounted payoff and simple stochastic games. The first variant improves every node in each step maximizing the current valuatio ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
This paper presents a new exponential lower bound for the two most popular deterministic variants of the strategy improvement algorithm for solving parity, mean payoff, discounted payoff and simple stochastic games. The first variant improves every node in each step maximizing the current
Games through Nested Fixpoints
, 2009
"... In this paper we consider twoplayer zerosum payoff games on finite graphs, both in the deterministic as well as in the stochastic setting. In the deterministic setting, we consider totalpayoff games which have been introduced as a refinement of meanpayoff games [18, 10]. In the stochastic setti ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
is polynomialtime reducible to solving stochastic parity games. We construct practical algorithms for solving the occurring nested fixpoint equations based on strategy iteration. As a corollary we obtain that solving deterministic totalpayoff games and solving stochastic liminfpayoff games is in UP ∩ co−UP.
Synthesis from ltl specifications with meanpayoff objectives
 In TACAS
, 2013
"... Abstract. The classical LTL synthesis problem is purely qualitative: the given LTL specification is realized or not by a reactive system. LTL is not expressive enough to formalize the correctness of reactive systems with respect to some quantitative aspects. This paper extends the qualitative LTL s ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
is not more difficult than LTL realizability: it is 2ExpTimeComplete. This is done by reduction to twoplayer meanpayoff parity games. While infinite memory strategies are required to realize LTLMP specifications in general, we show that optimality can be obtained with finite memory strategies, for any >
FIXEDDIMENSIONAL ENERGY GAMES ARE IN PSEUDOPOLYNOMIAL TIME
, 2015
"... We generalise the hyperplane separation technique (Chatterjee and Velner, 2013) from multidimensional meanpayoff to energy games, and achieve an algorithm for solving the latter whose running time is exponential only in the dimension, but not in the number of vertices of the game graph. This answ ..."
Abstract
 Add to MetaCart
We generalise the hyperplane separation technique (Chatterjee and Velner, 2013) from multidimensional meanpayoff to energy games, and achieve an algorithm for solving the latter whose running time is exponential only in the dimension, but not in the number of vertices of the game graph
Behavioral theories and the neurophysiology of reward,
 Annu. Rev. Psychol.
, 2006
"... ■ Abstract The functions of rewards are based primarily on their effects on behavior and are less directly governed by the physics and chemistry of input events as in sensory systems. Therefore, the investigation of neural mechanisms underlying reward functions requires behavioral theories that can ..."
Abstract

Cited by 187 (0 self)
 Add to MetaCart
an additional means to investigate the kinds of information contained in the representations evoked by CSs. Time apparently plays a major role in behavioral learning, as demonstrated by the unblocking effects of temporal variations of reinforcement The uncertainty of reward is a major factor for generating
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
of turnbased Stochastic Mean Payoff Games. It is a major open problem whether these game families can be solved in polynomial time. The currently fastest algorithms for the solution of all these games are adaptations of the randomized generalizationof linear programming. We refer to the algorithm of
22.10.2009 Implementation of a PeertoPeer Multiplayer Game with Realtime Requirements
"... Massively multiplayer online games (MMOGs) have become increasingly popular in the recent years, particularly in the form of online roleplaying games (MMORPGs). These games support up to several ten thousand players interacting in a virtual game world. The current commercially successful games are ..."
Abstract
 Add to MetaCart
Massively multiplayer online games (MMOGs) have become increasingly popular in the recent years, particularly in the form of online roleplaying games (MMORPGs). These games support up to several ten thousand players interacting in a virtual game world. The current commercially successful games
Results 1  10
of
46