4 papers
Optimally Installing Strict Equilibria
Jeremy McMahan, Young Wu, Yudong Chen +2
In this work, we develop a reward design framework for installing a desired behavior as a strict equilibrium across standard solution concepts: dominant strategy equilibrium, Nash…
Anytime-Constrained Equilibria in Polynomial Time
Jeremy McMahan
We extend anytime constraints to the Markov game setting and the corresponding solution concept of an anytime-constrained equilibrium (ACE). Then, we present a comprehensive theory…
Polynomial-Time Approximability of Constrained Reinforcement Learning
Jeremy McMahan
We study the computational complexity of approximating general constrained Markov decision processes. Our primary contribution is the design of a polynomial time -additive…
Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time
Jeremy McMahan
We present a novel algorithm that efficiently computes near-optimal deterministic policies for constrained reinforcement learning (CRL) problems. Our approach combines three key id…