| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051) | Atserias, Albert et al. | 2022 |
| 2 | Tarski’s Theorem, Supermodular Games, and the Complexity of Equilibria | Etessami, Kousha et al. | 2020 |
| 3 | Reachability for Branching Concurrent Stochastic Games | Etessami, Kousha et al. | 2019 |
| 4 | The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk) | Etessami, Kousha | 2013 |
| 5 | One-Counter Stochastic Games | Brázdil, Tomás et al. | 2010 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |