142 citations · 338 across the 19 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2018
Reachability for Branching Concurrent Stochastic Games
Kousha Etessami, Emanuel Martinov, Alistair Stewart +1
We give polynomial time algorithms for deciding almost-sure and limit-sure reachability in Branching Concurrent Stochastic Games (BCSGs). These are a class of infinite-state imperf…
cs.GT2016
Playing Anonymous Games using Simple Strategies
Yu Cheng, Ilias Diakonikolas, Alistair Stewart
We investigate the complexity of computing approximate Nash equilibria in anonymous games. Our main algorithmic result is the following: For any -player anonymous game with a bo…