Stochastic Games and Related Concepts
Stochastic Games and Related Concepts

Author: T. Parthasarathy

Publisher: Springer Nature

Published: 2020-12-08

Total Pages: 127

ISBN-13: 9811565775

DOWNLOAD EBOOK

This book discusses stochastic game theory and related concepts. Topics focused upon in the book include matrix games, finite, infinite, and undiscounted stochastic games, n-player cooperative games, minimax theorem, and more. In addition to important definitions and theorems, the book provides readers with a range of problem-solving techniques and exercises. This book is of value to graduate students and readers of probability and statistics alike.

Markov Decision Processes and Stochastic Positional Games
Markov Decision Processes and Stochastic Positional Games

Author: Dmitrii Lozovanu

Publisher: Springer Nature

Published: 2024-02-13

Total Pages: 412

ISBN-13: 3031401808

DOWNLOAD EBOOK

This book presents recent findings and results concerning the solutions of especially finite state-space Markov decision problems and determining Nash equilibria for related stochastic games with average and total expected discounted reward payoffs. In addition, it focuses on a new class of stochastic games: stochastic positional games that extend and generalize the classic deterministic positional games. It presents new algorithmic results on the suitable implementation of quasi-monotonic programming techniques. Moreover, the book presents applications of positional games within a class of multi-objective discrete control problems and hierarchical control problems on networks. Given its scope, the book will benefit all researchers and graduate students who are interested in Markov theory, control theory, optimization and games.

Stochastic Multiplayer Games
Stochastic Multiplayer Games

Author: Michael Ummels

Publisher: Amsterdam University Press

Published: 2010-12

Total Pages: 174

ISBN-13: 9085550408

DOWNLOAD EBOOK

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.

Advances in Dynamic Games
Advances in Dynamic Games

Author: Andrzej S. Nowak

Publisher: Springer Science & Business Media

Published: 2007-12-24

Total Pages: 674

ISBN-13: 0817644296

DOWNLOAD EBOOK

This book focuses on various aspects of dynamic game theory, presenting state-of-the-art research and serving as a guide to the vitality and growth of the field. A valuable reference for researchers and practitioners in dynamic game theory, it covers a broad range of topics and applications, including repeated and stochastic games, differential dynamic games, optimal stopping games, and numerical methods and algorithms for solving dynamic games. The diverse topics included will also benefit researchers and graduate students in applied mathematics, economics, engineering, systems and control, and environmental science.

Stochastic Games and Applications
Stochastic Games and Applications

Author: Abraham Neyman

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 466

ISBN-13: 9401001898

DOWNLOAD EBOOK

This volume is based on lectures given at the NATO Advanced Study Institute on "Stochastic Games and Applications," which took place at Stony Brook, NY, USA, July 1999. It gives the editors great pleasure to present it on the occasion of L.S. Shapley's eightieth birthday, and on the fiftieth "birthday" of his seminal paper "Stochastic Games," with which this volume opens. We wish to thank NATO for the grant that made the Institute and this volume possible, and the Center for Game Theory in Economics of the State University of New York at Stony Brook for hosting this event. We also wish to thank the Hebrew University of Jerusalem, Israel, for providing continuing financial support, without which this project would never have been completed. In particular, we are grateful to our editorial assistant Mike Borns, whose work has been indispensable. We also would like to acknowledge the support of the Ecole Poly tech nique, Paris, and the Israel Science Foundation. March 2003 Abraham Neyman and Sylvain Sorin ix STOCHASTIC GAMES L.S. SHAPLEY University of California at Los Angeles Los Angeles, USA 1. Introduction In a stochastic game the play proceeds by steps from position to position, according to transition probabilities controlled jointly by the two players.

Principles of Model Checking
Principles of Model Checking

Author: Christel Baier

Publisher: MIT Press

Published: 2008-04-25

Total Pages: 994

ISBN-13: 0262304031

DOWNLOAD EBOOK

A comprehensive introduction to the foundations of model checking, a fully automated technique for finding flaws in hardware and software; with extensive examples and both practical and theoretical exercises. Our growing dependence on increasingly complex computer and software systems necessitates the development of formalisms, techniques, and tools for assessing functional properties of these systems. One such technique that has emerged in the last twenty years is model checking, which systematically (and automatically) checks whether a model of a given system satisfies a desired property such as deadlock freedom, invariants, and request-response properties. This automated technique for verification and debugging has developed into a mature and widely used approach with many applications. Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field. The book begins with the basic principles for modeling concurrent and communicating systems, introduces different classes of properties (including safety and liveness), presents the notion of fairness, and provides automata-based algorithms for these properties. It introduces the temporal logics LTL and CTL, compares them, and covers algorithms for verifying these logics, discussing real-time systems as well as systems subject to random phenomena. Separate chapters treat such efficiency-improving techniques as abstraction and symbolic manipulation. The book includes an extensive set of examples (most of which run through several chapters) and a complete set of basic results accompanied by detailed proofs. Each chapter concludes with a summary, bibliographic notes, and an extensive list of exercises of both practical and theoretical nature.