arXiv Machine Learning August 6, 2026 By Taira Tsuchiya

Sublogarithmic Swap Regret in Multiplayer General-Sum Games via Hybrid Regularization

Read the original on arXiv Machine Learning →

arXiv:2608. 04149v1 Announce Type: cross Abstract: Swap regret governs the rate at which uncoupled learning dynamics converge to correlated equilibria in multiplayer general-sum games.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

Sep 16

Constant Swap Regret in General-Sum Games via Optimistic Transition Matrices

arXiv:2609. 16751v1 Announce Type: cross Abstract: We give deterministic and uncoupled learning dynamics for finite multiplayer general-sum games under full-information feedback that achieve constant individual swap regret, independent of the horizon $T$.

By Tung Mai

reinforcement-learning safety

arXiv Machine Learning

Sep 22

Constant Swap Regret in General-Sum Games via Two-Scale Higher-Order Optimism

arXiv:2609.16751v2 Announce Type: replace-cross Abstract: We give deterministic and uncoupled learning dynamics for finite multiplayer general-sum games under full-information feedback that achieve c...

By Tung Mai

reinforcement-learning safety

Hugging Face Trending Papers

Sep 15

Constant Swap Regret in General-Sum Games via Optimistic Transition Matrices

We give deterministic and uncoupled learning dynamics for finite multiplayer general-sum games under full-information feedback that achieve constant individual swap regret, independent of the horizon...

reinforcement-learning safety

arXiv Machine Learning

Aug 26

Optimal Alternating Regret for Online Learning and Games

arXiv:2608.24731v1 Announce Type: new Abstract: We settle the minimax-optimal alternating regret, a regret notion motivated by alternating learning dynamics in games, for both online linear optimizat...

By Yixin Tao, Weiqiang Zheng

arXiv Machine Learning

Sep 22

A Horizon-Independent Regret Bound for Optimistic Hedge in General-Sum Games

arXiv:2609.22839v1 Announce Type: cross Abstract: Can simple learning rules keep their regret bounded in self-play? Recent work achieves constant regret bounds through modified regularization and hig...

By Junsoo Ha

reinforcement-learning

arXiv Machine Learning

Aug 14

Decentralized Multi-Player Q-Learning in Episodic Markov Decision Processes with Information Asymmetry

arXiv:2608. 12753v1 Announce Type: new Abstract: We study decentralized multi-player reinforcement learning in episodic tabular Markov decision processes (MDPs) under three forms of information asymmetry: (A) unobserved actions with common rewards, (B) observed actions with independent rewards, and (C) unobserved actions with independent rewards.

By Larissa Xu, King Bi, William Chang

agents reinforcement-learning benchmarks

One email a morning, machine-written

Related stories

Constant Swap Regret in General-Sum Games via Optimistic Transition Matrices

Constant Swap Regret in General-Sum Games via Two-Scale Higher-Order Optimism

Constant Swap Regret in General-Sum Games via Optimistic Transition Matrices

Optimal Alternating Regret for Online Learning and Games

A Horizon-Independent Regret Bound for Optimistic Hedge in General-Sum Games

Decentralized Multi-Player Q-Learning in Episodic Markov Decision Processes with Information Asymmetry