Stochastic multiplayer games : theory and algorithms /
Annotation Stochastic games provide a versatile model for reactive systems that are a'ected 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 comp...
| Основен автор: | Ummels, Michael. |
|---|---|
| Формат: | Електронна книга |
| Език: | English |
| Публикувано: |
[Amsterdam] :
Pallas Publications,
℗♭2010.
|
| Предмети: | |
| Онлайн достъп: |
http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=360157 |
| Резюме: |
Annotation Stochastic games provide a versatile model for reactive systems that are a'ected 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 complexitytheoretic 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 e(cient algorithms for natural special cases. This title can be previewed in Google Books - http://books.google.com/books?vid=ISBN9789085550402. |
|---|---|
| Физически характеристики: |
1 online resource (174 pages) |
| Библиография: |
Includes bibliographical references (pages 157-168) and index. |
| ISBN: |
9789048513871 9048513871 |