Author:
Brihaye Thomas,Bruyère Véronique,De Pril Julie
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Lecture Notes in Computer Science;R. Alur,2008
2. Lecture Notes in Computer Science;R. Bloem,2009
3. Boros, E., Gurvich, V.: Why chess and back gammon can be solved in pure positional uniformly optimal strategies. Rutcor Research Report 21-2009, Rutgers University (2009)
4. Brihaye, T., Bruyère, V., De Pril, J.: Equilibria in Quantitative Reachability Games. Technical Report 122 (2010), http://www.ulb.ac.be/di/ssd/cfv/TechReps/TechRep_CFV_2010_122.pdf
5. Chatterjee, K., Henzinger, T., Jurdziński, M.: Games with secure equilibria. Theoretical Computer Science 365(1-2), 67–82 (2006)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. An Existence Theorem of Nash Equilibrium in Coq and Isabelle;Electronic Proceedings in Theoretical Computer Science;2017-09-06
2. Robust Equilibria in Mean-Payoff Games;Lecture Notes in Computer Science;2016
3. Incentive Stackelberg Mean-Payoff Games;Software Engineering and Formal Methods;2016
4. Quantitative Verification in Rational Environments;2014 21st International Symposium on Temporal Representation and Reasoning;2014-09
5. Secure equilibria in weighted games;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