1 paper · 1 filter
Jamie Tucker-Foltz
We prove an Ω(n2) lower bound on the query complexity of local proportionality in the Robertson-Webb cake-cutting model. Local proportionality requires that each agent prefer th…