Optimal regret for dynamic matching with static priorities

arXiv:2503.09762 · cs.DS, math.OC, math.PR · Submitted 2025-03-12 · Read on arXiv

cs.DS, math.OC, math.PR

Submitted: 2025-03-12

Updated: 2026-10-25

Terminology

• Regret — 6× in this paper · explained in 4 episodes
• Degeneracy — 1× in this paper · explained in 4 episodes
• Regret Bound — 1× in this paper · explained in 2 episodes

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Computational and Statistical Hardness of Calibration Distance
• Edge-Private Matching Kernels Through Local Decoding
• Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing