Lectures in game theory for computer scientists / edited by Krzysztof R. Apt and Erich Grädel
Material type:
TextPublication details: Cambridge : Cambridge University Press, c2011Description: xii, 295 p. : ill. ; 26 cmISBN: - 9780521198660
- 0521198666
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
Open Shelf
|
UMPLIB GAMBANG | QA269 .L43 2011 (Browse shelf(Opens below)) | 1 | Available | 0000065328 |
Includes bibliographical references and index
Machine generated contents note: g 1. t A Primer on Strategic Games / r Krzysztof R. Apt -- g 1.1. t Introduction -- g 1.2. t Basic concepts -- g 1.3. t Iterated elimination of strategies I -- g 1.4. t Mixed extension -- g 1.5. t Iterated elimination of strategies II -- g 1.6. t Variations on the definition of strategic games -- g 1.7. t Mechanism design -- g 1.8. t Pre-Bayesian games -- g 1.9. t Conclusions -- g 2. t Infinite Games and Automata Theory / r Christof Loding -- g 2.1. t Introduction -- g 2.2. t Basic notations and definitions -- g 2.3. t Transformation of winning conditions -- g 2.4. t Tree automata -- g 2.5. t Beyond finite automata -- g 2.6. t Conclusion -- g 3. t Algorithms for Solving Parity Games / r Marcin Jurdzinski -- g 3.1. t Games on graphs -- g 3.2. t Solving repeated reachability and eventual safety games
g 6.3. t Games with imperfect information: surely-winning -- g 6.4. t Games with imperfect information: almost-surely-winning -- g 7. t Graph Searching Games / r Stephan Kreuizer -- g 7.1. t Introduction -- g 7.2. t Classifying graph searching games -- g 7.3. t Variants of graph searching games -- g 7.4. t Monotonicity of graph searching -- g 7.5. t Obstructions -- g 7.6. t An application to graph-decompositions -- g 7.7. t Complexity of graph searching -- g 7.8. t Conclusion -- g 8. t Beyond Nash Equilibrium: Solution Concepts for the 21st Century / r Joseph Y. Halpern -- g 8.1. t Introduction -- g 8.2. t Robust and resilient equilibrium -- g 8.3. t Taking computation into account -- g 8.4. t Taking (lack of) awareness into account -- g 8.5. t Iterated regret minimisation -- g 8.6. t Conclusions