Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Chatterjee, K.: Two-player nonzero-sum ω-regular games. Technical Report: UCB/CSD-04-1364 (2004)
2. Chatterjee, K., de Alfaro, L., Henzinger, T.A.: The complexity of quantitative concurrent parity games. Technical Report: UCB/CSD-04-1354 (2004)
3. Chatterjee, K., de Alfaro, L., Henzinger, T.A.: The complexity of stochastic Rabin and Streett games. Technical Report: UCB/CSD-04-1355 (2004)
4. Chatterjee, K., de Alfaro, L., Henzinger, T.A.: Trading memory for randomness. In: QEST 2004. IEEE Computer Society Press, Los Alamitos (2004)
5. Lecture Notes in Computer Science;K. Chatterjee,2004
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Equilibrium in two-player stochastic games with shift-invariant payoffs;Journal de Mathématiques Pures et Appliquées;2023-11
2. Specification-Guided Learning of Nash Equilibria with High Social Welfare;Computer Aided Verification;2022
3. Pure Nash Equilibria in Concurrent Deterministic Games;Logical Methods in Computer Science;2015-06-19
4. Equilibria of concurrent games on event structures;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14
5. PRALINE: A Tool for Computing Nash Equilibria in Concurrent Games;Computer Aided Verification;2013