pith. sign in

arxiv: 1502.07571 · v2 · pith:GQUOF7WBnew · submitted 2015-02-26 · 💻 cs.GT · cs.AI· cs.MA

Online Fair Division: analysing a Food Bank problem

Martin Aleksandrov , Haris Aziz , Serge Gaspers , Toby Walsh This is my paper
classification 💻 cs.GT cs.AIcs.MA
keywords divisionfairlikemechanismsmodelonlineproblemagents
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Beyond the Half-Approximation: Fair and Efficient Online Class Matching

    cs.GT 2026-05 unverdicted novelty 7.0

    Threshold-based algorithms achieve simultaneous constant class envy-freeness and better-than-1/2 utilitarian social welfare in online class matching, with a nearly matching upper bound on the price of fairness.