Personal profile
Research Interests
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.
Qualifications
Ph.D., Computer Science, University of Massachusetts-Amherst, 1995.
MSc., Computer Science, Univ. of Massachusetts-Amherst, 1994.
BSc., Computer Science, State U. of New York at Albany, 1990.
Biography
Kousha Etessami is a Reader in the School of Informatics, University of Edinburgh, which he joined in 2002. From 1997 to 2002 he was a member of the research staff at Bell Laboratories in Murray Hill, NJ. He received a Ph.D. in computer science at the University of Massachusetts-Amherst in 1995, and he held postdoctoral fellowships at DIMACS (1995-1996) and BRICS (1996-7). Etessami’s research has spanned several areas of theoretical computer science: algorithms and logic, computational complexity, automated verification and model checking, automata theory, and more recently algorithmic game theory and equilibrium computation, and algorithmic analysis of infinite-state stochastic models and stochastic
games.
Fingerprint
- 1 Similar Profiles
-
Analysis of Probabilistic Processes and Automata Theory
Etessami, K., Sept 2021, Handbook of Automata Theory: Volume II. Automata in Mathematics and Selected Applications. Pin, J.-É. (ed.). EMS Publishing House, Vol. II. p. 1343-1382Research output: Chapter in Book/Report/Conference proceeding › Chapter (peer-reviewed) › peer-review
-
The complexity of computing a (quasi-)perfect equilibrium for an n-player extensive form game
Etessami, K., 1 Jan 2021, In: Games and Economic Behavior. 125, p. 107-140 34 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Qualitative Multi-Objective Reachability for Ordered Branching MDPs
Etessami, K. & Martinov, E., 15 Oct 2020, Reachability Problems (RP 2020). Schmitz, S. & Potapov, I. (eds.). Springer, p. 67-82 16 p. (Lecture Notes in Computer Science; vol. 12448).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile -
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
Etessami, K., Stewart, A. & Yannakakis, M., 28 Feb 2020, In: Mathematics of Operations Research. 45, 1, p. 34-62 57 p.Research output: Contribution to journal › Article › peer-review
Open AccessFile -
Tarski’s Theorem, Supermodular Games, and the Complexity of Equilibria
Etessami, K., Papadimitriou, C., Rubinstein, A. & Yannakakis, M., 10 Jan 2020, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Vidick, T. (ed.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, p. 18:1 - 18:19 19 p. 18. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 151).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open AccessFile
Projects
- 2 Finished
-
Research collaboration in data privacy
Etessami, K. (Principal Investigator)
Non-EU industry, commerce and public corporations
1/09/17 → 31/08/20
Project: Research
-
Efficient algorithms for verification of recursive probabilistic system
Etessami, K. (Principal Investigator)
30/03/13 → 29/03/15
Project: Research