AI Paper Atlas

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

Group-Fair Online Allocation in Continuous Time

Semih Cayci, Swati Gupta, Atilla Eryilmaz

NeurIPS 2020 · Bandits and online learning › Online convex optimization and games · approach: Online decision-making with feedback structure · 12 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
Use a fixed stationary randomized policy optimized for utilityAll causal allocation policies · Continuous-time fair allocation as B→∞utilityImproved
Choose a controlled deadline that maximizes reward per processing timePer-group task allocation · Continuous-time fair allocationreward per processing timeImproved
Set α to approach 1 for proportional fairness with uniform group weightsOLUM · Two-group simulationfraction of time allocated to Group 2Improved
Use reward maximization rather than a fairness-oriented utilityAllocation across groups · Two-group simulationfraction of time allocated to Group 2Hurt

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