The game-theoretic approach to multi-agent systems has been incorporated into the model-checking agenda by using temporal and dynamic logic to characterize notions such as Nash equilibria. Recent efforts concentrate on pure-strategy games, where intelligent agents act deterministically guided by utility functions. We build upon this tradition by incorporating stochastic actions. First, we present an extension of the Probabilistic Computation-Tree Logic (PCTL) to quantify and compare expected costs. Next, we give a discrete-time Markov chain codification for mixed-strategy games. Finally, we characterize mixed-strategy Nash equilibria. © 2010 Springer-Verlag.
CITATION STYLE
Góngora, P. A., & Rosenblueth, D. A. (2010). A characterization of mixed-strategy nash equilibria in PCTL augmented with a cost quantifier. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6214 LNAI, pp. 158–177). https://doi.org/10.1007/978-3-642-16867-3_9
Mendeley helps you to discover research relevant for your work.