Cover Image

Playing Markov Games Without Observing Payoffs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ablin, Daniel, Cohen, Alon
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Rates for Feasible Payoff Set Estimation in Games
by: Barbara, Annalisa, et al.
Published: (2026)

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

Winning Without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round
by: Blum, Avrim, et al.
Published: (2024)

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

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

Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games
by: Dong, Jing, et al.
Published: (2024)

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

Refined Sample Complexity for Markov Games with Independent Linear Function Approximation
by: Dai, Yan, et al.
Published: (2024)

Provable Policy Gradient Methods for Average-Reward Markov Potential Games
by: Cheng, Min, et al.
Published: (2024)

Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games
by: Leonardos, Stefanos, et al.
Published: (2021)

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

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

Stochastic Window Mean-Payoff Games
by: Doyen, Laurent, et al.
Published: (2023)

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

Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
by: Liu, Junyan, et al.
Published: (2026)

A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs
by: Zhang, Junyue, et al.
Published: (2024)

Learning to Play Multi-Follower Bayesian Stackelberg Games
by: Personnat, Gerson, et al.
Published: (2025)

Independent Learning in Constrained Markov Potential Games
by: Jordan, Philip, et al.
Published: (2024)

Cycle Patterns and Mean Payoff Games
by: Loho, Georg, et al.
Published: (2025)

The Intelligent Disobedience Game: Formulating Disobedience in Stackelberg Games and Markov Decision Processes
by: Hornig, Benedikt, et al.
Published: (2026)

Inception: Efficiently Computable Misinformation Attacks on Markov Games
by: McMahan, Jeremy, et al.
Published: (2024)

Protocols for Verifying Smooth Strategies in Bandits and Games
by: Christ, Miranda, et al.
Published: (2025)

Tractable Equilibrium Computation in Markov Games through Risk Aversion
by: Mazumdar, Eric, et al.
Published: (2024)

Regret Minimization and Convergence to Equilibria in General-sum Markov Games
by: Erez, Liad, et al.
Published: (2022)

Learning to Play Against Unknown Opponents
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)

Meta-Learning in Self-Play Regret Minimization
by: Sychrovský, David, et al.
Published: (2025)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
by: Ghosh, Abheek, et al.
Published: (2024)

Safe Exploitative Play with Untrusted Type Beliefs
by: Li, Tongxin, et al.
Published: (2024)

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

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

Roping in Uncertainty: Robustness and Regularization in Markov Games
by: McMahan, Jeremy, et al.
Published: (2024)

Static Nuel Games with Terminal Payoff
by: Mastrakoulis, S., et al.
Published: (2024)

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

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

Universal Complexity Bounds Based on Value Iteration for Stochastic Mean Payoff Games and Entropy Games
by: Allamigeon, Xavier, et al.
Published: (2022)

Learning Safely Without Knowing the World:COMPASS-Hedge
by: Hu, Ting, et al.
Published: (2026)

Independent Learning of Nash Equilibria in Partially Observable Markov Potential Games with Decoupled Dynamics
by: Jordan, Philip, et al.
Published: (2026)

Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms
by: Nguyen-Tang, Thanh, et al.
Published: (2024)

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

GAE Falls Short in Imperfect-Information Self-Play Reinforcement Learning
by: Fan, Zhiyuan, et al.
Published: (2026)