The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game

von Etessami, Kousha
Veröffentlicht in Games and economic behavior (2021)

Qualitative Multi-objective Reachability for Ordered Branching MDPs

von Etessami, Kousha
Veröffentlicht in RP (14. : 2020 : Online) Reachability problems (2020)

Reachability and the power of local ordering

von Etessami, Kousha
Veröffentlicht 1994

Reachability and the power of local ordering

von Etessami, Kousha
Veröffentlicht 1994

Computer aided verification : proceedings

Veröffentlicht 2005

Special section: the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011) : [... held June 6 - 8, 2011, in San Jose, California, as a part of the Fifth Federated C...

Veröffentlicht 2012

Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations

von Etessami, Kousha
Veröffentlicht in Mathematics of operations research (2020)

Computer aided verification : 17th international conference, CAV 2005, Edinburgh, Scotland, UK, July 6-10, 2005 ; proceedings

Veröffentlicht 2005