Image de couverture de livre

Two-Player Zero-Sum Games with Bandit Feedback

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yılmaz, Elif, Dimitrakakis, Christos
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning Computer Science and Game Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Offline Two-Player Zero-Sum Markov Games with KL Regularization
par: Chen, Claire, et autres
Publié: (2026)

Corruption-Robust Offline Two-Player Zero-Sum Markov Games
par: Nika, Andi, et autres
Publié: (2024)

Strategic Linear Contextual Bandits
par: Buening, Thomas Kleine, et autres
Publié: (2024)

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

Multi-Player Zero-Sum Markov Games with Networked Separable Interactions
par: Park, Chanwoo, et autres
Publié: (2023)

A Framework for Finding Local Saddle Points in Two-Player Zero-Sum Black-Box Games
par: Agarwal, Shubhankar, et autres
Publié: (2025)

Fair Contracts in Principal-Agent Games with Heterogeneous Types
par: Tłuczek, Jakub, et autres
Publié: (2025)

Value Approximation for Two-Player General-Sum Differential Games with State Constraints
par: Zhang, Lei, et autres
Publié: (2023)

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
par: Maiti, Arnab, et autres
Publié: (2023)

Bayesian Learning in Episodic Zero-Sum Games
par: Yueh, Chang-Wei, et autres
Publié: (2026)

Two-Player Zero-Sum Differential Games with One-Sided Information
par: Ghimire, Mukesh, et autres
Publié: (2025)

Policy Iteration for Two-Player General-Sum Stochastic Stackelberg Games
par: Kudo, Mikoto, et autres
Publié: (2024)

Leveraging Noisy Observations in Zero-Sum Games
par: Athanasakos, Emmanouil M, et autres
Publié: (2024)

Optimism Without Regularization: Constant Regret in Zero-Sum Games
par: Lazarsfeld, John, et autres
Publié: (2025)

State-Constrained Zero-Sum Differential Games with One-Sided Information
par: Ghimire, Mukesh, et autres
Publié: (2024)

Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback
par: Ito, Shinji, et autres
Publié: (2025)

Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play
par: Lazarsfeld, John, et autres
Publié: (2025)

Learning in Zero-Sum Markov Games: Relaxing Strong Reachability and Mixing Time Assumptions
par: Ouhamma, Reda, et autres
Publié: (2023)

Last-Iterate Convergence of Payoff-Based Independent Learning in Zero-Sum Stochastic Games
par: Chen, Zaiwei, et autres
Publié: (2024)

Bandits with Preference Feedback: A Stackelberg Game Perspective
par: Pásztor, Barna, et autres
Publié: (2024)

Fast Strategy Solving for the Informed Player in Two-Player Zero-Sum Linear-Quadratic Differential Games with One-Sided Information
par: Ghimire, Mukesh, et autres
Publié: (2026)

Inference of Altruism and Intrinsic Rewards in Multi-Agent Systems
par: Villin, Victor, et autres
Publié: (2025)

Impact of Decentralized Learning on Player Utilities in Stackelberg Games
par: Donahue, Kate, et autres
Publié: (2024)

ε-Optimally Solving Two-Player Zero-Sum POSGs
par: Escudie, Erwan Christian, et autres
Publié: (2025)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
par: Zhang, Brian Hu, et autres
Publié: (2025)

Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game
par: Maiti, Arnab, et autres
Publié: (2023)

Protocols for Verifying Smooth Strategies in Bandits and Games
par: Christ, Miranda, et autres
Publié: (2025)

Incentivized Learning in Principal-Agent Bandit Games
par: Scheid, Antoine, et autres
Publié: (2024)

Online Budget Allocation with Censored Semi-Bandit Feedback
par: Bachoc, François, et autres
Publié: (2025)

A Direct Second-Order Method for Solving Two-Player Zero-Sum Games
par: Yang, David, et autres
Publié: (2025)

$ε$-Optimally Solving Zero-Sum POSGs
par: Escudie, Erwan, et autres
Publié: (2024)

Multi-Agent Combinatorial-Multi-Armed-Bandit framework for the Submodular Welfare Problem under Bandit Feedback
par: Pokhriyal, Subham, et autres
Publié: (2026)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
par: Ba, Wenjia, et autres
Publié: (2021)

Model-Based Reinforcement Learning for Offline Zero-Sum Markov Games
par: Yan, Yuling, et autres
Publié: (2022)

Achieving Logarithmic Regret in KL-Regularized Zero-Sum Markov Games
par: Nayak, Anupam, et autres
Publié: (2025)

Finite-Sample Guarantees for Learning Dynamics in Zero-Sum Polymatrix Games
par: Faizal, Fathima Zarin, et autres
Publié: (2024)

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
par: Balcan, Maria-Florina, et autres
Publié: (2025)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
par: Daskalakis, Constantinos, et autres
Publié: (2018)

Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games
par: Feng, Songtao, et autres
Publié: (2023)

Solving Zero-Sum Convex Markov Games
par: Kalogiannis, Fivos, et autres
Publié: (2025)