Fair Adversaries and Randomization in Two-Player Games-Reference-Cited by-同舟云学术

Fair Adversaries and Randomization in Two-Player Games

Published:2010 Issue: Volume: Page:64-78
ISSN:0302-9743
Container-title:Foundations of Software Science and Computational Structures
language:
Short-container-title:

Author:

Asarin Eugene,Chane-Yack-Fa Raphaël,Varacca Daniele

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-12032-9_6.pdf

Reference16 articles.

1. Baier, C., Bertrand, N., Bouyer, P., Brihaye, T., Größer, M.: Almost-sure model checking of infinite paths in one-clock timed automata. In: LICS 2008, pp. 217–226. IEEE Computer Society, Los Alamitos (2008)

2. Baier, C., Kwiatkowska, M.: Model checking for a probabilistic branching time logic with fairness. Distributed Computing 11(3), 125–155 (1998)

3. Bertrand, N., Genest, B., Gimbert, H.: Qualitative determinacy and decidability of stochastic games with signals. In: LICS 2009, pp. 319–328. IEEE Computer Society, Los Alamitos (2009)

4. Lecture Notes in Computer Science;D. Berwanger,2003

5. Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science 3(3) (2007)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Playing Against Fair Adversaries in Stochastic Games with Total Rewards;Computer Aided Verification;2022

2. How Good Is a Strategy in a Game with Nature?;ACM Transactions on Computational Logic;2020-07-31

3. Counting branches in trees using games;Information and Computation;2017-02

4. How Good Is a Strategy in a Game with Nature?;2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science;2015-07

5. Defining Fairness in Reactive and Concurrent Systems;Journal of the ACM;2012-06