Research map / Learning theory and algorithms / Submodular and game algorithms
Approximate Proportionality in Online Fair Division
Davin Choo, Winston Fu, Tzeh Yuan Neoh, Tze-Yang Poon, Nicholas Teh
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 |
|---|---|---|---|
| use MIV-prediction Algorithm 1 instead of Greedy-1 | online allocation · Greedy-1 counterexample prefixes | realized PROP1 ratio: 0.008 -> 0.920 | Improved |
| use MIV-prediction Algorithm 1 instead of Greedy-2 | online allocation · Greedy-2 counterexample prefixes | realized PROP1 ratio: 0.008 -> 1.000 | Improved |
| use MIV-prediction Algorithm 1 instead of Greedy-3 | online allocation · Greedy-3 counterexample prefixes | realized PROP1 ratio: 0.385 -> 1.000 | Improved |
| use Algorithm 1 instead of Greedy-1 | random dense instances · dense instances | welfare and PROP1 ratio: welfare 0.954 -> 0.960; PROP1 ratio 0.423 -> 1 | Improved |
| use Algorithm 1 instead of Greedy-1 | random uniform instances · uniform instances | normalized welfare: 0.946 -> 0.892 | Mixed |
| use Algorithm 1 instead of Greedy-1 | specialist instances · specialist instances | normalized welfare: 0.967 -> 0.781 | Hurt |
| use Algorithm 1 instead of Greedy-2 | random uniform instances · uniform instances | normalized welfare: 0.639 -> 0.892 | Improved |
| use Algorithm 1 instead of Greedy-3 | specialist instances · specialist instances | normalized welfare: 0.400 -> 0.781 | Improved |
Closest papers by meaning
- Online Fair Division Meets Reordering Buffers (NeurIPS 2026 · similarity 0.92)
- Improved Regret Bounds for Online Fair Division with Bandit Learning (AAAI 2025 · similarity 0.91)
- Greedy-Based Online Fair Allocation with Adversarial Input: Enabling Best-of-Many-Worlds Guarantees (AAAI 2024 · similarity 0.90)
- Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously (AAAI 2025 · similarity 0.90)
- Honor Among Bandits: No-Regret Learning for Online Fair Division (NeurIPS 2024 · similarity 0.90)
- Fairness and Efficiency in Online Class Matching (NeurIPS 2024 · similarity 0.89)
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.
