arxiv
PublishedJuly 16, 2026 at 4:00 AM
—neutral
Price of Fairness in Bandits: A Tight Minimax Characterization
Publisher summary· verbatim
arXiv:2607.13402v1 Announce Type: cross Abstract: In bandit problems, standard regret-minimizing algorithms treat exploration as an amortized cost, which can expose early participants to unfair ex-ante losses in settings such as clinical trials. Recent work addresses this by evaluating the sequence
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivAdaptive Mamba Neural Operators1harxivThe Many Senses of Visual Similarity: A Text-Prompted Image Perceptual Metric1harxivHierarchical Reinforcement Learning for Air Combat at DARPA's AlphaDogfight Trials1harxivmHC-GNN: Manifold-Constrained Hyper-Connections for Graph Neural Networks1hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗