Copertina

Refined Sample Complexity for Markov Games with Independent Linear Function Approximation

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Dai, Yan, Cui, Qiwen, Du, Simon S.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Computer Science and Game Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Learning Optimal Tax Design in Nonatomic Congestion Games
di: Cui, Qiwen, et al.
Pubblicazione: (2024)

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

Offline congestion games: How feedback type affects data coverage requirement
di: Jiang, Haozhe, et al.
Pubblicazione: (2022)

Playing Markov Games Without Observing Payoffs
di: Ablin, Daniel, et al.
Pubblicazione: (2025)

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

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

Learning Zero-Sum Linear Quadratic Games with Improved Sample Complexity and Last-Iterate Convergence
di: Wu, Jiduan, et al.
Pubblicazione: (2023)

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

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

The Optimal Sample Complexity of Linear Contracts
di: Høgsgaard, Mikael Møller
Pubblicazione: (2026)

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

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

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

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

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

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

Shapley Value Approximation Based on k-Additive Games
di: Pelegrina, Guilherme Dean, et al.
Pubblicazione: (2025)

A Black-box Approach for Non-stationary Multi-agent Reinforcement Learning
di: Jiang, Haozhe, et al.
Pubblicazione: (2023)

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

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

Pricing Query Complexity of Multiplicative Revenue Approximation
di: Tang, Wei, et al.
Pubblicazione: (2026)

Approximating Nash Equilibria in General-Sum Games via Meta-Learning
di: Sychrovský, David, et al.
Pubblicazione: (2025)

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

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

Strategically Robust Multi-Agent Reinforcement Learning with Linear Function Approximation
di: Gonzales, Jake, et al.
Pubblicazione: (2026)

Smoothed Elicitation Complexity for Approximate $Γ$-calibration of Discrete Classification Tasks
di: Finocchiaro, Jessica, et al.
Pubblicazione: (2026)

Stable Matching with Ties: Approximation Ratios and Learning
di: Lin, Shiyun, et al.
Pubblicazione: (2024)

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

Decentralized and Privacy-Preserving Learning of Approximate Stackelberg Solutions in Energy Trading Games with Demand Response Aggregators
di: Kampezidou, Styliani I., et al.
Pubblicazione: (2023)

Sample Efficient Omniprediction and Downstream Swap Regret for Non-Linear Losses
di: Lu, Jiuyao, et al.
Pubblicazione: (2025)

Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts
di: Schiffer, Benjamin, et al.
Pubblicazione: (2025)

Preference-Based Multi-Agent Reinforcement Learning: Data Coverage and Algorithmic Techniques
di: Zhang, Natalia, et al.
Pubblicazione: (2024)

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

PPA-Game: Characterizing and Learning Competitive Dynamics Among Online Content Creators
di: Xu, Renzhe, et al.
Pubblicazione: (2024)

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

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

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

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

Sample Complexity of Linear Regression Models for Opinion Formation in Networks
di: Liu, Haolin, et al.
Pubblicazione: (2023)

Partially Observable Stochastic Games with Neural Perception Mechanisms
di: Yan, Rui, et al.
Pubblicazione: (2023)