AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

No-regret Algorithms for Fair Resource Allocation

Abhishek Sinha, Ativ Joshi, Rajarshi Bhattacharjee, Cameron N Musco, Mohammad Hajiesmaili

NeurIPS 2023 · Bandits and online learning › Online convex optimization and games · approach: Online allocation with constraints · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Allow approximation factor c_alpha instead of standard regretOPF policy · NOFRA online fair resource allocation, alpha-fairnessregret: c_alpha = (1-alpha)^{-(1-alpha)} <= 1.445Improved
Greedily estimate terminal gradient with current gradients in surrogate problemOPF · NOFRA online fair resource allocation, alpha-fairnessc_alpha-regretImproved
Fairness parameter alpha = 1/2OPF · NOFRA online fair resource allocation, alpha-fairnessc_alpha-regretImproved
Set alpha = 0OPF · NOFRA online fair resource allocation, alpha-fairnessstandard regretNo clear effect
Restrict to standard regret c=1 under unrestricted adversaryany online policy · NOFRA online fair resource allocation, alpha-fairnessstandard regretHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy