Research map / Learning theory and algorithms / Optimal transport
Optimal Efficiency-Envy Trade-Off via Optimal Transport
Steven Yin, Christian Kroer
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 |
|---|---|---|---|
| tighten the envy constraint epsilon from 0.2 to 0.0 (ablation) | Envy-constrained OT allocation · artificial data (2 recipients) | allocation boundary / envy | Improved |
| pay about 50% of the full price of fairness (welfare gap) | Envy-constrained OT allocation · artificial data | envy reduction: ~50% -> ~65% | Improved |
| impose a no-envy constraint | Envy-constrained OT allocation · blood donation simulator data (5 recipients) | welfare gap | No clear effect |
| increase sample size m | empirical dual maximizer · artificial and simulator data | approximation gap | Improved |
Closest papers by meaning
- Repeated Fair Allocation of Indivisible Items (AAAI 2024 · similarity 0.87)
- The Complexity of Extending Fair Allocations of Indivisible Goods (AAAI 2025 · similarity 0.87)
- Fair Allocation of Items in Multiple Regions (AAAI 2024 · similarity 0.87)
- Optimizing the Envy Cycle Elimination Algorithm (NeurIPS 2026 · similarity 0.87)
- Constrained Fair and Efficient Allocations (AAAI 2025 · similarity 0.86)
- Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously (AAAI 2025 · similarity 0.86)
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.
