A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
The paper sets lower bounds on envy-free divisions in cake-cutting problems.
In classic fair division problems such as cake cutting and rent division, envy-freeness requires that each individual (weakly) prefer his allocation to anyone else's. On a conceptual level, we argue that envy-freeness also provides a compelling notion of fairness for classification tasks. Our technical focus is the gen…
Fairly allocate items with noisy queries, reducing envy.
Algorithm allocates perishable resources online to minimize envy and inefficiency.
Proves existence of equivariant maps avoiding diagonal in n-space.