9 citations · 11 across the 9 of their papers we have counts for
4 papers · 1 filter
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…
Inception: Efficiently Computable Misinformation Attacks on Markov Games
Jeremy McMahan, Young Wu, Yudong Chen +2
We study security threats to Markov games due to information asymmetry and misinformation. We consider an attacker player who can spread misinformation about its reward function to…
Roping in Uncertainty: Robustness and Regularization in Markov Games
Jeremy McMahan, Giovanni Artiglio, Qiaomin Xie
We study robust Markov games (RMG) with -rectangular uncertainty. We show a general equivalence between computing a robust Nash equilibrium (RNE) of a -rectangular RMG and co…
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…