Cover Image

Deep SOR Minimax Q-learning for Two-player Zero-sum Game

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gautam, Saksham, Mandal, Lakshmi, Bhatnagar, Shalabh
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

n-Step Temporal Difference Learning with Optimal n
by: Mandal, Lakshmi, et al.
Published: (2023)

Approximate Linear Programming for Decentralized Policy Iteration in Cooperative Multi-agent Markov Decision Processes
by: Mandal, Lakshmi, et al.
Published: (2023)

Two-Timescale Critic-Actor for Average Reward MDPs with Function Approximation
by: Panda, Prashansa, et al.
Published: (2024)

Enabling Off-Policy Imitation Learning with Deep Actor Critic Stabilization
by: Sen, Sayambhu, et al.
Published: (2025)

A Multi-Step Minimax Q-learning Algorithm for Two-Player Zero-Sum Markov Games
by: R, Shreyas S, et al.
Published: (2024)

Actor-Critic or Critic-Actor? A Tale of Two Time Scales
by: Bhatnagar, Shalabh, et al.
Published: (2022)

Convergent Reinforcement Learning Algorithms for Stochastic Shortest Path Problem
by: Guin, Soumyajit, et al.
Published: (2025)

A policy gradient approach for Finite Horizon Constrained Markov Decision Processes
by: Guin, Soumyajit, et al.
Published: (2022)

Finite-Time Analysis of Three-Timescale Constrained Actor-Critic and Constrained Natural Actor-Critic Algorithms
by: Panda, Prashansa, et al.
Published: (2023)

Finite-time analysis of Multi-timescale Stochastic Optimization Algorithms
by: Kartikey, Kaustubh, et al.
Published: (2026)

Finite Time Analysis of Constrained Natural Critic-Actor Algorithm with Improved Sample Complexity
by: Panda, Prashansa, et al.
Published: (2025)

Convergence of Multiagent Learning Systems for Traffic control
by: Sen, Sayambhu, et al.
Published: (2025)

An Actor-Critic Algorithm with Function Approximation for Risk Sensitive Cost Markov Decision Processes
by: Guin, Soumyajit, et al.
Published: (2025)

Generalized Random Direction Newton Algorithms for Stochastic Optimization
by: Pachal, Soumen, et al.
Published: (2026)

Corruption-Robust Offline Two-Player Zero-Sum Markov Games
by: Nika, Andi, et al.
Published: (2024)

Minimax Optimal Q Learning with Nearest Neighbors
by: Zhao, Puning, et al.
Published: (2023)

Rapid Learning in Constrained Minimax Games with Negative Momentum
by: Fang, Zijian, et al.
Published: (2024)

High-Probability Bounds for SGD under the Polyak-Lojasiewicz Condition with Markovian Noise
by: Kar, Avik, et al.
Published: (2026)

Iterative Minimax Games with Coupled Linear Constraints
by: Zhang, Huiling, et al.
Published: (2022)

Minimax-Optimal Policy Regret in Partially Observable Markov Games
by: Arora, Raman
Published: (2026)

Policy Gradient Methods for Non-Markovian Reinforcement Learning
by: Kar, Avik, et al.
Published: (2026)

Deep Double Q-learning
by: Nagarajan, Prabhat, et al.
Published: (2025)

MASCA: LLM based-Multi Agents System for Credit Assessment
by: Jajoo, Gautam, et al.
Published: (2025)

Fairness in two-player zero-sum games with bandit feedback
by: Akash, S, et al.
Published: (2026)

Actor-Dual-Critic Dynamics for Zero-sum and Identical-Interest Stochastic Games
by: Donmez, Ahmed Said, et al.
Published: (2026)

A Bayesian Learning Algorithm for Unknown Zero-sum Stochastic Games with an Arbitrary Opponent
by: Jafarnia-Jahromi, Mehdi, et al.
Published: (2021)

Expected flow networks in stochastic environments and two-player zero-sum games
by: Jiralerspong, Marco, et al.
Published: (2023)

Two-timescale Extragradient for Finding Local Minimax Points
by: Chae, Jiseok, et al.
Published: (2023)

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

Minimax Optimal Two-Stage Algorithm For Moment Estimation Under Covariate Shift
by: Zhang, Zhen, et al.
Published: (2025)

Minimax-Optimal Two-Sample Test with Sliced Wasserstein
by: Tran, Binh Thuan, et al.
Published: (2025)

Balancing of competitive two-player Game Levels with Reinforcement Learning
by: Rupp, Florian, et al.
Published: (2023)

Understanding Optimal Portfolios of Strategies for Solving Two-player Zero-sum Games
by: Drabent, Karolina, et al.
Published: (2025)

Meta-TTT: A Meta-learning Minimax Framework For Test-Time Training
by: Tao, Chen, et al.
Published: (2024)

Two-Fidelity Best-Action Identification for Stochastic Minimax Tree
by: Chen, Peter, et al.
Published: (2026)

Minimax optimal transfer learning for high-dimensional additive regression
by: Moon, Seung Hyun
Published: (2025)

Requests of a Feather Must Flock Together: Batch Size vs. Prefix Homogeneity in LLM Inference
by: Rathi, Saksham, et al.
Published: (2026)

Deep Minimax Classifiers for Imbalanced Datasets with a Small Number of Minority Samples
by: Choi, Hansung, et al.
Published: (2025)

Regularized Q-learning
by: Lim, Han-Dong, et al.
Published: (2022)

Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
by: Lin, Tianyi, et al.
Published: (2024)