Kousha Etessami
Personal Chair
Informatics
The University of Edinburgh
United Kingdom
Biography
Kousha Etessami Position Personal Chair in Algorithms, Games, Logic and Complexity
Research Interest
In general, theoretical computer science. More specifically: automated verification, logic, algorithms and computational complexity theory, algorithmic game theory, equilibrium computation, analysis of probabilistic systems, Markov decision processes, stochastic games, automata theory, model checking, analysis of infinite-state systems, finite model theory and descriptive complexity.
Publications
-
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
-
Algorithms for some infinite-state MDPs and stochastic games (invited talk)
-
A polynomial time algorithm for computing extinction probabilities of multi-type branching processes