Research map / Learning theory and algorithms / Fairness
Fair Scheduling for Time-dependent Resources
Bo Li, Minming Li, Ruilong Zhang
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 changed | Where | Measured | Effect |
|---|---|---|---|
| add Round-Robin on remaining unscheduled jobs after Matching-BagFilling (BAG+) | Matching-BagFilling · Random rigid jobs, |J| 100/500/1000, U/P/N agents | agent utility ratio vs Round-Robin | Improved |
| plain Matching-BagFilling vs Round-Robin when jobs are few relative to agents | Matching-BagFilling · |A|=15, |J|=100,500,1000 | agent utility ratio vs Round-Robin | No clear effect |
| plain Matching-BagFilling vs Round-Robin when jobs are many relative to agents | Matching-BagFilling · |A|=5, |J|=100,500,1000 | agent utility ratio vs Round-Robin | Hurt |
Closest papers by meaning
- Settling the Maximin Share Fairness for Scheduling among Groups of Machines (ICML 2025 · similarity 0.87)
- Fair Allocation of Items in Multiple Regions (AAAI 2024 · similarity 0.85)
- Temporal Fair Division (AAAI 2025 · similarity 0.84)
- Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously (AAAI 2025 · similarity 0.84)
- Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements (AAAI 2024 · similarity 0.84)
- The Complexity of Extending Fair Allocations of Indivisible Goods (AAAI 2025 · similarity 0.83)
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.
