arXiv Analytics

Sign in

arXiv:1609.09173 [math.PR]AbstractReferencesReviewsResources

Zero-sum stochastic differential games without the Isaacs condition: random rules of priority and intermediate Hamiltonians

Daniel Hernández-Hernández, Mihai Sîrbu

Published 2016-09-29Version 1

For a zero-sum stochastic game which does not satisfy the Isaacs condition, we provide a value function representation for an Isaacs-type equation whose Hamiltonian lies in between the lower and upper Hamiltonians, as a convex combination of the two. For the general case (i.e. the convex combination is time and state dependent) our representation amounts to a random change of the rules of the game, to allow each player at any moment to see the other player's action or not, according to a coin toss with probabilities of heads and tails given by the convex combination appearing in the PDE. If the combination is state independent, then the rules can be set all in advance, in a deterministic way. This means that tossing the coin along the game, or tossing it repeatedly right at the beginning leads to the same value. The representations are asymptotic, over time discretizations. Space discretization is possible as well, leading to similar results.

Related articles: Most relevant | Search more
arXiv:1407.7326 [math.PR] (Published 2014-07-28)
Value in mixed strategies for zero-sum stochastic differential games without Isaacs condition
arXiv:math/0405356 [math.PR] (Published 2004-05-18, updated 2005-08-25)
Complexities of convex combinations and bounding the generalization error in classification
arXiv:2310.16434 [math.PR] (Published 2023-10-25)
Spectral gap of convex combination of a random permutation and a bistochastic matrix