Online Fair Division: analysing a Food Bank problem
This work addresses fair resource allocation for charities, but it is incremental as it applies known mechanisms to a specific real-world scenario.
The paper tackled the problem of online fair division in a food bank context by analyzing two simple mechanisms based on agent declarations, and it computed the price of anarchy as part of the competitive analysis.
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.