The first bounded envy-free chore division protocol
There has been fascinating new progress on the problem of fair cake cutting. A notable new result is the first bounded envy-free protocol for "chore division "! The problem concerns "cake" that no one is willing to have. Chore division has also been called the "salty cake" problem. The new protocol was developed by a group of researchers (Sina Dehghani, Alireza Farhadi, MohammadTaghi HajiAghayi, and Hadi Yami) from U of Maryland. The paper was presented at SODA 2018 recently.