Nash Incentive-compatible Online Mechanism Learning via Weakly Differentially Private Online Learning

arXiv:2407.04898 · cs.GT, cs.CR, cs.DS, cs.LG · Submitted 2024-07-06 · Read on arXiv

cs.GT, cs.CR, cs.DS, cs.LG

Submitted: 2024-07-06

Updated: 2026-10-27

Terminology

• Differentially Private — 2× in this paper · explained in 3 episodes
• Regret — 2× in this paper · explained in 4 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