This book is intended as a text covering the central concepts and techniques of Competitive
Markov Decision Processes. It is an attempt to present a rig orous treatment that combines …

The Complexity of Stochastic Games Page 1 INFORMATION AND COMPUTATION 96, 203-224
(1992) The Complexity of Stochastic Games ANNE CONDON* Computer Sciences …

Sequential decision making is a fundamental task faced by any intelligent agent in an
extended interaction with its environment; it is the act of answering the question" What …

We consider concurrent two-player games with reachability objectives. In such games, at
each round, player 1 and player 2 independently and simultaneously choose moves, and …

The concept of sequential Stackelberg equilibrium is introduced in the general framework of
dynamic, two-person games defined in the Denardo contracting operator formalism. A …

We consider finite state, finite action, stochastic games over an infinite time horizon. We
survey algorithms for the computation of minimax optimal stationary strategies in the …

This chapter describes a number of results obtained in the last sixty years in the theory of
non-zero-sum discrete-time stochastic games. We overview almost all basic streams of …

Simple Stochastic Game Problem* Page 1 INFORMATION AND C().VlPUTATl()N 117, 151--155
(1995) A Subexponential Randomized Algorithm for the Simple Stochastic Game Problem …

We consider some well-known families of two-player zero-sum perfect-information stochastic
games played on finite directed graphs. The families include stochastic parity games …

Branching out from operations research roots of the 1950's, Markov decision processes
(MDPs) have gained recognition in such diverse fields as economics, telecommunication …