An invitation to play

Authors:
Wiesław Zielonka
Affiliations:
LIAFA, case 7014, Université Paris 7 and CNRS, Paris Cedex 05, France
Venue:
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Year:
2005

Citing 4
Cited 1

Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Competitive Markov decision processes

Competitive Markov decision processes
Automata logics, and infinite games: a guide to current research

Automata logics, and infinite games: a guide to current research
Games where you can play optimally without any memory

CONCUR 2005 - Concurrency Theory

Optimal Strategy Synthesis in Request-Response Games

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parity games and their subclasses and variants pop up in various contexts: μ-calculus, tree automata, program verification [3,1,8]. Such games provide only binary information indicating the winning player. However, in classical games theory [12] the emphasis is rather on how much we win or lose. Can we incorporate the information about the profits and losses into parity games?