1,575 research outputs found
Quantitative games with interval objectives
Traditionally quantitative games such as mean-payoff games and discount sum
games have two players -- one trying to maximize the payoff, the other trying
to minimize it. The associated decision problem, "Can Eve (the maximizer)
achieve, for example, a positive payoff?" can be thought of as one player
trying to attain a payoff in the interval . In this paper we
consider the more general problem of determining if a player can attain a
payoff in a finite union of arbitrary intervals for various payoff functions
(liminf, mean-payoff, discount sum, total sum). In particular this includes the
interesting exact-value problem, "Can Eve achieve a payoff of exactly (e.g.)
0?"Comment: Full version of CONCUR submissio
The Complexity of POMDPs with Long-run Average Objectives
We study the problem of approximation of optimal values in
partially-observable Markov decision processes (POMDPs) with long-run average
objectives. POMDPs are a standard model for dynamic systems with probabilistic
and nondeterministic behavior in uncertain environments. In long-run average
objectives rewards are associated with every transition of the POMDP and the
payoff is the long-run average of the rewards along the executions of the
POMDP. We establish strategy complexity and computational complexity results.
Our main result shows that finite-memory strategies suffice for approximation
of optimal values, and the related decision problem is recursively enumerable
complete
A survey of stochastic ω regular games
We summarize classical and recent results about two-player games played on graphs with ω-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-based or concurrent; deterministic or stochastic; zero-sum or not. We cluster known results and open problems according to these classifications
05241 Abstracts Collection -- Synthesis and Planning
From 12.06.05 to 17.06.2005 the Dagstuhl Seminar 05241 ``Synthesis and Planning\u27\u27
was held in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
How Good Is a Strategy in a Game with Nature?
International audienceWe consider games with two antagonistic players — Éloïse (modelling a program) and Abélard (modelling a byzantine environment) — and a third, unpredictable and uncontrollable player, that we call Nature. Motivated by the fact that the usual probabilistic semantics very quickly leads to undecidability when considering either infinite game graphs or imperfect information, we propose two alternative semantics that leads to decidability where the probabilistic one fails: one based on counting and one based on topology
- …