Stochastic multiplayer games - Ummels M.
theory and algorithms
KORTE INHOUD
Stochastic games provide a versatile model for reactive systems that are affected by random events. This dissertation advances the algorithmic theory of stochastic games to incorporate multiple players, whose objectives are not necessarily conflicting. The basis of this work is a comprehensive complexity theoretic analysis of the standard game-theoretic solution concepts in the context of stochastic games over a finite state space. One main result is that the constrained existence of a Nash equilibrium becomes undecidable in this setting. This impossibility result is accompanied by several positive results, including efficient algorithms for natural special cases.
Michael Ummels received his diploma degree in computer science from RWTH Aachen University. He started his doctoral studies at the same university in 2006, supervise by Prof. Dr. Erich Grädel and Prof. Dr. Dr.h.c. Wolfgang Thomas. As ofFebruary 2010, the author is a postdoctoral researcher at ENS Cachan.
Michael Ummels received his diploma degree in computer science from RWTH Aachen University. He started his doctoral studies at the same university in 2006, supervise by Prof. Dr. Erich Grädel and Prof. Dr. Dr.h.c. Wolfgang Thomas. As ofFebruary 2010, the author is a postdoctoral researcher at ENS Cachan.
Details
2010 Uitgever: Amsterdam University Press Reeks: Pallas proefschriften 174 paginas Taal: Engels Grootte: 234x156x11 ISBN-10: 9085550408 ISBN-13: 9789085550402Koop dit boek tweedehands
bij volgende verkopers
1 foto's
Paperback, 174 pp. Dissertation RWTH Aachen University Index, bibliography, 16x24x1 cm. Fine. [Auteur: Ummels, Michael] [Uitgever: Pallas Publications: Amsterdam, 2010] [Titel: Stochastic Multiplayer Games Theory and Algorithms]
