Fair Cake Division Under Monotone Likelihood Ratios

@article{Barman2020FairCD,
  title={Fair Cake Division Under Monotone Likelihood Ratios},
  author={Siddharth Barman and Nidhi Rathi},
  journal={Proceedings of the 21st ACM Conference on Economics and Computation},
  year={2020}
}
  • Siddharth Barman, Nidhi Rathi
  • Published 2020
  • Computer Science, Mathematics
  • Proceedings of the 21st ACM Conference on Economics and Computation
This work develops algorithmic results for the classic cake-cutting problem in which a divisible, heterogeneous resource (modeled as a cake) needs to be partitioned among agents with distinct preferences. We focus on a standard formulation of cake cutting wherein each agent must receive a contiguous piece of the cake. While multiple hardness results exist in this setup for finding fair/efficient cake divisions, we show that, if the value densities of the agents satisfy the monotone likelihood… Expand
3 Citations
Improving Fairness and Privacy in Selection Problems
  • PDF
Fairness and Efficiency in Facility Location Problems with Continuous Demands
  • Chenhao Wang, Mengqi Zhang
  • 2021
  • PDF