mlsanityData to 14 Oct 2026

Online Fair Division: analysing a Food Bank problem

arXiv 1502.07571 ↗First posted 26 Feb 2015cs.GT cs.AI cs.MAcited by 20

Not on the map. Why?

Abstract (arXiv)

We study an online model of fair division designed to capture features of a real world charity problem. We consider two simple mechanisms for this model in which agents simply declare what items they like. We analyse several axiomatic properties of these mechanisms like strategy-proofness and envy-freeness. Finally, we perform a competitive analysis and compute the price of anarchy.

Key facts. Cited by 20 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Feb 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 1; 2023: 2; 2024: 7; 2025: 8; 2026: 1.

20 papers.

Sort: