We show that computing approximate stationary Markov coarse correlated equilibria (CCE)
in general-sum stochastic games is PPAD-hard, even when there are two players, the game …

In this paper, we bring techniques from operations research to bear on the problem of
choosing optimal actions in partially observable stochastic domains. We begin by …

A central aim and ever-lasting dream of computer science is to put the development of
hardware and software systems on a mathematical basis which is both firm and practical …

The purpose of this paper is twofold:(a) to provide a tutorial introduction to some key
concepts from the theory of computational complexity, highlighting their relevance to …

The goal of this book is to explain, at the graduate student level, connections between
tropical geometry and optimization. Building bridges between these two subject areas is …

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 observe that the problem of deciding the winner in mean payoff games is in the
complexity class UP∩ co-UP. We also show a simple reduction from parify games to mean …

In this paper we develop a new algorithm for deciding the winner in parity games, and hence
also for the modal μ-calculus model checking. The design and analysis of the algorithm is …

Quantitative generalizations of classical languages, which assign to each word a real
number instead of a Boolean value, have applications in modeling resource-constrained …

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 …