37,156 research outputs found
Stochastic Games on a Product State Space
We examine product-games, which are n-player stochastic games satisfying: (1) the state space is a product S(1)Ãâ¦ÃS(n); (2) the action space of any player i only depends of the i-th coordinate of the state; (3) the transition probability of moving from s(i) ∈ S(i) to t(i) ∈S(i), on the i-th coordinate S(i) of the state space, only depends on the action chosen by player i. So, as far as the actions and the transitions are concerned, every player i can play on the i-th coordinate of the product-game without interference of the other players. No condition is imposed on the payoff structure of the game. We focus on product-games with an aperiodic transition structure, for which we present an approach based on so-called communicating states. For the general n-player case, we establish the existence of 0-equilibria, which makes product-games one of the first classes within n-player stochastic games with such a result. In addition, for the special case of two-player zero-sum games of this type, we show that both players have stationary 0-optimal strategies. Both proofs are constructive by nature.Economics (Jel: A)
Stochastic games on a product state space
We examine so-called product-games with an aperiodic transition structure, with respect to the average reward, for which we present an approach based on communicating states. For the general n-player case, we establish the existence of 0-equilibria. In addition, for the special case of two-player zero-sum games of this type, we show that both players have stationary 0-optimal strategies
Probabilistic modal {\mu}-calculus with independent product
The probabilistic modal {\mu}-calculus is a fixed-point logic designed for
expressing properties of probabilistic labeled transition systems (PLTS's). Two
equivalent semantics have been studied for this logic, both assigning to each
state a value in the interval [0,1] representing the probability that the
property expressed by the formula holds at the state. One semantics is
denotational and the other is a game semantics, specified in terms of
two-player stochastic parity games. A shortcoming of the probabilistic modal
{\mu}-calculus is the lack of expressiveness required to encode other important
temporal logics for PLTS's such as Probabilistic Computation Tree Logic (PCTL).
To address this limitation we extend the logic with a new pair of operators:
independent product and coproduct. The resulting logic, called probabilistic
modal {\mu}-calculus with independent product, can encode many properties of
interest and subsumes the qualitative fragment of PCTL. The main contribution
of this paper is the definition of an appropriate game semantics for this
extended probabilistic {\mu}-calculus. This relies on the definition of a new
class of games which generalize standard two-player stochastic (parity) games
by allowing a play to be split into concurrent subplays, each continuing their
evolution independently. Our main technical result is the equivalence of the
two semantics. The proof is carried out in ZFC set theory extended with
Martin's Axiom at an uncountable cardinal
Linear-quadratic stochastic differential games for distributed parameter systems
A linear-quadratic differential game with infinite dimensional state space is considered. The system state is affected by disturbance and both players have access to different measurements. Optimal linear strategies for the pursuer and the evader, when they exist, are explicitly determined
- …