Quantitative games under failures

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 45, Issue , 2015, Pages 293-306

  Brihaye, Thomas ^a   Geeraerts, Gilles ^b   Haddad, Axel ^a   Monmege, Benjamin ^c   Pérez, Guillermo A ^b   Renault, Gabriel ^a  

^a UNIVERSITY OF MONS   (Belgium)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c AIX MARSEILLE UNIV   (France)

Author keywords

Game theory; Quantitative games; Synthesis; Verification

Indexed keywords

BUDGET CONTROL; COMPLEX NETWORKS; COSTS; CRIME; GAME THEORY; SOFTWARE ENGINEERING; SYNTHESIS (CHEMICAL); VERIFICATION;

DYNAMIC WEIGHT; EXPTIME; GENERALISATION; MODELING OF DYNAMICS; QUANTITATIVE GAMES; SABOTAGE GAMES;

COST FUNCTIONS;

EID: 84958751261     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2015.293     Document Type: Conference Paper

References (18)

1. Krzysztof R. Apt and Erich Grädel. Lectures in game theory for computer scientists. Cambridge University Press, 2011.
2. Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, and Gabriel Renault. Quantitative games under failures. Research Report 1504.06744, arXiv, April 2015.
3. Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. Quantitative languages. ACM Trans. Comput. Log., 11(4), 2010.
4. Krishnendu Chatterjee, Thomas A. Henzinger, and Marcin Jurdzinski. Mean-payoff parity games. In LICS, pages 178-187. IEEE, 2005.
5. A. Ehrenfeucht and J. Mycielski. Positional strategies for mean payoff games. International Journal of Game Theory, 8:109-113, 1979.
6. Arthur S. Goldstein and Edward M. Reingold. The complexity of pursuit on a graph. Theor. Comput. Sci., 143(1):93-112, 1995.
7. Sten Grüner, Frank G. Radmacher, and Wolfgang Thomas. Connectivity games over dynamic networks. Theor. Comput. Sci., 493:46-65, 2013.
8. Marcin Jurdzinski. Deciding the winner in parity games is in UP ∩ coUP. Information Processing Letters, 68(3):119-124, 1998.
9. Richard M. Karp. Reducibility among combinatorial problems. In Proceedings of a Symposium on the Complexity of Computer Computations, pages 85-103, 1972.
10. Dominik Klein, Frank G. Radmacher, and Wolfgang Thomas. Moving in a network under random failures: A complexity analysis. Science of Comp. Prog., 77(7-8):940-954, 2012.
11. Lena Maria Kurzen. Complexity in interaction. PhD thesis, Institute for Logic, Language and Computation, 2011.
12. Christof Löding and Philipp Rohde. Solving the sabotage game is PSPACE-hard. In MFCS, volume 2747 of LNCS, pages 531-540. Springer, 2003.
13. Donald A Martin. Borel determinacy. Annals of Mathematics, 102(2):363-371, 1975.
14. Merlijn Sevenster. Branches of imperfect information: logic, games, and computation. PhD thesis, Institute for Logic, Language and Computation, 2006.
15. Larry J. Stockmeyer and Ashok K. Chandra. Provably difficult combinatorial games. SIAM J. Comput., 8(2):151-174, 1979.
16. Johan van Benthem. An essay on sabotage and obstruction. In Mechanizing Mathematical Reasoning, volume 2605 of LNAI, pages 268-276. Springer, 2005.
17. Masafumi Yamashita and Ichiro Suzuki. Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theor. Comput. Sci., 411(26-28):2433-2453, 2010.
18. Uri Zwick and Michael S. Paterson. The complexity of mean payoff games. Theor. Comput. Sci., 158:343-359, 1996.