Author of the publication

A Simple P-Matrix Linear Complementarity Problem for Discounted Games.

, and . CiE, volume 5028 of Lecture Notes in Computer Science, page 283-293. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Zero-Sum Game Techniques for Approximate Nash Equilibria., , and . AAMAS, page 1514-1516. ACM, (2017)Quantitative stochastic parity games., , and . SODA, page 121-130. SIAM, (2004)When are emptiness and containment decidable for probabilistic automata?, , , , , and . J. Comput. Syst. Sci., (2021)Alternating Automata on Data Trees and XPath Satisfiability, and . CoRR, (2008)Model Checking Probabilistic Timed Automata with One or Two Clocks., , and . Logical Methods in Computer Science, (2008)A symmetric attractor-decomposition lifting algorithm for parity games., , , and . CoRR, (2020)Algorithms for solving parity games.. Lectures in Game Theory for Computer Scientists, Cambridge University Press, (2011)Interface Compatibility Checking for Software Modules., , , , and . CAV, volume 2404 of Lecture Notes in Computer Science, page 428-441. Springer, (2002)Trading Probability for Fairness., , and . CSL, volume 2471 of Lecture Notes in Computer Science, page 292-305. Springer, (2002)Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games., , , , , and . SODA, page 2333-2349. SIAM, (2019)