Corruption-Robust Offline Two-Player Zero-Sum Markov Games Analysis
The authors investigate data corruption robustness in offline two-player zero-sum Markov games, proposing algorithms under different coverage and corruption scenarios to achieve near-optimal suboptimality gap bounds with respect to ϵ.
