Achieving Pareto Optimality in Games via Single-bit Feedback

arXiv:2509.25921 · cs.GT · Submitted 2025-09-30 · Read on arXiv

cs.GT

Submitted: 2025-09-30

Updated: 2026-10-20

Terminology

• Regret — 2× in this paper · explained in 4 episodes
• Communication Overhead — 1× in this paper · explained in 2 episodes
• Decentralized Learning — 1× in this paper · explained in 2 episodes
• Multi-Agent System — 1× in this paper · explained in 7 episodes
• Regret Bound — 1× in this paper · explained in 2 episodes
• Regret Bounds — 1× in this paper · explained in 2 episodes

Related papers

• Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
• Optimizing Social Utility in Sequential Experiments
• In-Context Credit Assignment via the Core
• Temporal Liquidity Crossing for Blockchains: An EIP-1559 Extension for Admission Below the Base Fee
• Optimal Regret for Online Market Making with Limit Order Book
• Breaking 1/epsilon Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes