conftrace_

coarse correlated equilibrium

31 papers

Explore in graph

Also known as

CCE

Co-occurring keywords

game theory (854) multi-agent reinforcement learning (538) nash equilibrium (398) no-regret learning (67) markov game (86) online learning (1777) multi-agent system (1819) regret bound (1926) multi-agent learning (98) price of anarchy (37)

Papers

Distributionally Robust Online Markov Game with Linear Function Approximation AAAI 2026
Multi-Agent Learning in Contextual Games under Unknown Constraints AISTATS 2024
Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property AAAI 2024
$\widetilde{O}(T^{-1})$ Convergence to (coarse) correlated equilibria in full-information general-sum Markov games L4DC 2024
On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games NIPS 2024
RL in Markov Games with Independent Function Approximation: Improved Sample Complexity Bound under the Local Access Model AISTATS 2024
Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games ICML 2023
The Complexity of Markov Equilibrium in Stochastic Games COLT 2023
Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation COLT 2023
On the Interplay between Social Welfare and Tractability of Equilibria NIPS 2023
Multi-Agent Reinforcement Learning with Reward Delays L4DC 2023
The Equivalence of Dynamic and Strategic Stability under Regularized Learning in Games NIPS 2023
Multi-Agent Meta-Reinforcement Learning: Sharper Convergence Rates with Task Similarity NIPS 2023
Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model NIPS 2022
Policy Optimization for Markov Games: Unified Framework and Faster Convergence NIPS 2022
Almost Optimal Algorithms for Two-player Zero-Sum Linear Mixture Markov Games ALT 2022
No Weighted-Regret Learning in Adversarial Bandits with Delays JMLR 2022
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games NIPS 2022
Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update NIPS 2022
Near-Optimal No-Regret Learning in General Games NIPS 2021
Simultaneous 2nd Price Item Auctions with No-Underbidding AAAI 2021
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions AAAI 2021
No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix NIPS 2020
Hedging in games: Faster convergence of external and swap regrets NIPS 2020
Contextual Games: Multi-Agent Learning with Side Information NIPS 2020