On-device research index

arXiv research

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.

168,694 papers · 148 categories

Trend · papers per month

count % of corpus

2 results for “cake-cutting”

Lower bounds on the number of envy-free divisionsmath.CO

The paper sets lower bounds on envy-free divisions in cake-cutting problems.

problem Finding the minimum number of envy-free divisions in cake-cutting problems.

method Analyzes two scenarios: classical and hybrid, with different constraints and allocations.

result Sharp bounds and examples for envy-free divisions in both scenarios.

envy-free divisions cake-cutting lower bounds sharp examples hybrid scenario

2025-04-26abs ↗pdf ↗

Envy-Free Classificationcs.LG

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…

2018-09-23abs ↗pdf ↗