Energy and mean-payoff games with imperfect information

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6247 LNCS, Issue , 2010, Pages 260-274

  Degorre, Aldric ^a   Doyen, Laurent ^b   Gentilini, Raffaella ^c   Raskin, Jean François ^a   Toruńczyk, Szymon ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b CNRS   (France)

^c UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

GAME GRAPHS; GAME WITH IMPERFECT INFORMATION; IMPERFECT INFORMATION; PARTIAL KNOWLEDGE; QUANTITATIVE OBJECTIVES; RESOURCE CONSUMPTION; STATE SPACE; TWO-PLAYER GAMES; UNDECIDABILITY; WEIGHTED GRAPH; WINNING STRATEGY;

COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE;

TECHNICAL PRESENTATIONS;

EID: 77956595237     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15205-4_22     Document Type: Conference Paper

References (24)

1. Alur, R., Degorre, A., Maler, O., Weiss, G.: On omega-languages defined by mean-payoff conditions. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.5504, pp. 333-347. Springer, Heidelberg (2009)
2. Berwanger, D., Doyen, L.: On the power of imperfect information. In: Proc. of FSTTCS. Dagstuhl Seminar Proceedings 08004. IBFI (2008)
3. Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.5643, pp. 140-156. Springer, Heidelberg (2009)
4. Chaloupka, J., Brim, L.: Faster algorithm for mean-payoff games. In: Proc. of MEMICS: Math. and Engineering Methods in Comp. Science, pp. 45-53. Nov Press (2009)
5. Chatterjee, K., de Alfaro, L., Faella,M., Henzinger, T.A.,Majumdar, R., Stoelinga,M.: Compositional quantitative reasoning. In: Proc. of QEST: Quantitative Evaluaiton of Systems, pp. 179-188. IEEE Computer Society, Los Alamitos (2006)
6. Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.5213, pp. 385-400. Springer, Heidelberg (2008)
7. Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Algorithms for omega-regular games of incomplete information. Logical Methods in Computer Science 3(3:4) (2007)
8. de Alfaro, L.: How to specify and verify the long-run average behavior of probabilistic systems. In: Proc. of LICS: Logic in Computer Science, pp. 454-465. IEEE Comp. Soc., Los Alamitos (1998)
9. Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Am. J. of Mathematics 35(4), 413-422 (1913)
10. Doyen, L., Gentilini, R., Raskin, J.-F.: Faster pseudopolynomial algorithms for meanpayoff games. Technical Report 2009.120, Universit́e Libre de Bruxelles (ULB), Belgium (2009)
11. Droste, M., Gastin, P.: Weighted automata and weighted logics. Th. C. Sci. 380(1-2), 69-86 (2007)
12. Ehrenfeucht, A.,Mycielski, J.: International journal of game theory. Positional Strategies for Mean-Payoff Games 8, 109-113 (1979)
13. Emerson, E.A., Jutla, C.: Tree automata, mu-calculus and determinacy. In: Proc. of FOCS, pp. 368-377. IEEE, Los Alamitos (1991)
14. Emerson, E.A., Jutla, C.S., Sistla, A.P.: On model-checking for fragments of α-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.697, pp. 385-396. Springer, Heidelberg (1993)
15. Esparza, J.: Decidability and complexity of Petri net problems - An introduction. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.1491, pp. 374-428. Springer, Heidelberg (1998)
16. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Th. Comp. Sc. 256(1-2), 63-92 (2001)
17. Gr̈adel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol.2500. Springer, Heidelberg (2002)
18. Gurevich, Y., Harrington, L.: Trees, automata, and games. In: Proc. of STOC, pp. 60-65. ACM Press, New York (1982)
19. Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.623, pp. 101-112. Springer, Heidelberg (1992)
20. Kupferman, O., Lustig, Y.: Lattice automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol.4349, pp. 199-213. Springer, Heidelberg (2007)
21. Minsky, N.M.: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
22. Rackoff, C.: The covering and boundedness problems for vector addition systems. Th. Comp. Sc. 6, 223-231 (1978)
23. Reif, J.H.: The complexity of two-player games of incomplete information. Journal of Computer and System Sciences 29(2), 274-301 (1984)
24. Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Th. Comp. Sc. 158, 343-359 (1996)