:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Dai, Yan, Cui, Qiwen, Du, Simon S.
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Computer Science and Game Theory
Acceso en línea:	https://arxiv.org/abs/2402.07082
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Satisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Games
por: Yongacoglu, Bora, et al.
Publicado: (2021)

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