Imagen de Portada

Corruption-Robust Offline Two-Player Zero-Sum Markov Games

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Nika, Andi, Mandal, Debmalya, Singla, Adish, Radanović, Goran
Formato:	Preprint
Publicado:	2024
Materias:	Computer Science and Game Theory Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Performative Reinforcement Learning with Linear Markov Decision Process
por: Mandal, Debmalya, et al.
Publicado: (2024)

MaMa: A Game-Theoretic Approach for Designing Safe Agentic Systems
por: Nöther, Jonathan, et al.
Publicado: (2026)

Corruption Robust Offline Reinforcement Learning with Human Feedback
por: Mandal, Debmalya, et al.
Publicado: (2024)

Offline Two-Player Zero-Sum Markov Games with KL Regularization
por: Chen, Claire, et al.
Publicado: (2026)

Corruption-robust Offline Multi-agent Reinforcement Learning From Human Feedback
por: Nika, Andi, et al.
Publicado: (2026)

Stochastic Principal-Agent Problems: Efficient Computation and Learning
por: Gan, Jiarui, et al.
Publicado: (2023)

Two-Player Zero-Sum Games with Bandit Feedback
por: Yılmaz, Elif, et al.
Publicado: (2025)

Multi-Player Zero-Sum Markov Games with Networked Separable Interactions
por: Park, Chanwoo, et al.
Publicado: (2023)

Model-Based Reinforcement Learning for Offline Zero-Sum Markov Games
por: Yan, Yuling, et al.
Publicado: (2022)

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
por: Tsuchiya, Taira
Publicado: (2025)

A Framework for Finding Local Saddle Points in Two-Player Zero-Sum Black-Box Games
por: Agarwal, Shubhankar, et al.
Publicado: (2025)

Sparse Offline Reinforcement Learning with Corruption Robustness
por: Tran, Nam Phuong, et al.
Publicado: (2025)

Value Approximation for Two-Player General-Sum Differential Games with State Constraints
por: Zhang, Lei, et al.
Publicado: (2023)

Learning in Zero-Sum Markov Games: Relaxing Strong Reachability and Mixing Time Assumptions
por: Ouhamma, Reda, et al.
Publicado: (2023)

Reward Model Learning vs. Direct Policy Optimization: A Comparative Analysis of Learning from Human Preferences
por: Nika, Andi, et al.
Publicado: (2024)

Policy Teaching via Data Poisoning in Learning from Human Preferences
por: Nika, Andi, et al.
Publicado: (2025)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
por: Nayak, Anupam, et al.
Publicado: (2025)

Bayesian Learning in Episodic Zero-Sum Games
por: Yueh, Chang-Wei, et al.
Publicado: (2026)

Solving Zero-Sum Convex Markov Games
por: Kalogiannis, Fivos, et al.
Publicado: (2025)

Two-Player Zero-Sum Differential Games with One-Sided Information
por: Ghimire, Mukesh, et al.
Publicado: (2025)

Pessimism-Free Offline Learning in General-Sum Games via KL Regularization
por: Chen, Claire, et al.
Publicado: (2026)

Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games
por: Feng, Songtao, et al.
Publicado: (2023)

Policy Iteration for Two-Player General-Sum Stochastic Stackelberg Games
por: Kudo, Mikoto, et al.
Publicado: (2024)

Leveraging Noisy Observations in Zero-Sum Games
por: Athanasakos, Emmanouil M, et al.
Publicado: (2024)

Optimism Without Regularization: Constant Regret in Zero-Sum Games
por: Lazarsfeld, John, et al.
Publicado: (2025)

Learning the Expected Core of Strictly Convex Stochastic Cooperative Games
por: Tran, Nam Phuong, et al.
Publicado: (2024)

ELA: Exploited Level Augmentation for Offline Learning in Zero-Sum Games
por: Lei, Shiqi, et al.
Publicado: (2024)

Corrupted Learning Dynamics in Games
por: Tsuchiya, Taira, et al.
Publicado: (2024)

State-Constrained Zero-Sum Differential Games with One-Sided Information
por: Ghimire, Mukesh, et al.
Publicado: (2024)

Last-Iterate Convergence of Payoff-Based Independent Learning in Zero-Sum Stochastic Games
por: Chen, Zaiwei, et al.
Publicado: (2024)

Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play
por: Lazarsfeld, John, et al.
Publicado: (2025)

Fast Strategy Solving for the Informed Player in Two-Player Zero-Sum Linear-Quadratic Differential Games with One-Sided Information
por: Ghimire, Mukesh, et al.
Publicado: (2026)

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
por: Maiti, Arnab, et al.
Publicado: (2023)

Impact of Decentralized Learning on Player Utilities in Stackelberg Games
por: Donahue, Kate, et al.
Publicado: (2024)

ε-Optimally Solving Two-Player Zero-Sum POSGs
por: Escudie, Erwan Christian, et al.
Publicado: (2025)

Independent Policy Mirror Descent for Markov Potential Games: Scaling to Large Number of Players
por: Alatur, Pragnya, et al.
Publicado: (2024)

Surprisingly Popular Voting for Concentric Rank-Order Models
por: Hosseini, Hadi, et al.
Publicado: (2024)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
por: Zhang, Brian Hu, et al.
Publicado: (2025)

Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game
por: Maiti, Arnab, et al.
Publicado: (2023)

Near-Optimal Policy Optimization for Correlated Equilibrium in General-Sum Markov Games
por: Cai, Yang, et al.
Publicado: (2024)