Sciweavers

88 search results - page 9 / 18
» Reachability in Stochastic Timed Games
Sort
View
CORR
2008
Springer
208views Education» more  CORR 2008»
13 years 8 months ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis
IJFCS
2008
158views more  IJFCS 2008»
13 years 8 months ago
An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
Anil Seth
SIAMCO
2002
92views more  SIAMCO 2002»
13 years 8 months ago
Numerical Approximations for Stochastic Differential Games
The Markov chain approximation method is a widely used, relatively easy to use, and efficient family of methods for the bulk of stochastic control problems in continuous time, for...
Harold J. Kushner
SAGT
2009
Springer
112views Game Theory» more  SAGT 2009»
14 years 3 months ago
On the Complexity of Iterated Weak Dominance in Constant-Sum Games
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...
FORMATS
2010
Springer
13 years 6 months ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...