Dynamic Fair Resource Division
From MaRDI portal
Publication:5085123
DOI10.1287/moor.2021.1155zbMath1492.90060OpenAlexW3202557912MaRDI QIDQ5085123
No author found.
Publication date: 27 June 2022
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2021.1155
Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Sharp bounds for harmonic numbers
- Splitting necklaces
- Model Predictive Control for Dynamic Resource Allocation
- No Agent Left Behind: Dynamic Fair Division of Multiple Resources
- The Price of Fairness
- Online Cake Cutting
- Fast, Fair, and Efficient Flows in Networks
- Resource Pooling and Cost Allocation Among Independent Service Providers
- The Dynamic Line Allocation Problem
- Fairness and Social Risk I: Unaggregated Analyses
- An Envy-Free Cake Division Protocol
- When Efficient Is Insufficient: Fairness in Decisions Affecting a Group
- Algorithmic Solutions for Envy-Free Cake Cutting
- Fairness, Efficiency, and Flexibility in Organ Allocation for Kidney Transplantation
- A Distributed Decision-Making Structure for Dynamic Resource Allocation Using Nonlinear Functional Approximations
- A discrete and bounded envy-free cake cutting protocol for four agents
- Fair Queuing and Other Probabilistic Allocation Methods
This page was built for publication: Dynamic Fair Resource Division
