Corpus ID: 41711244

Online Fair Division Redux

  title={Online Fair Division Redux},
  author={M. Aleksandrov},
Hunger is a major problem worldwide. Food banks around the globe combine forces with various welfare agencies towards alleviating the hunger by assisting people in need. For example, Foodbank Australia cooperates with local charities in order to effectively allocate food as it is donated. In 2014, nearly 10% of these relief organizations could not meet the demand and thus left around 24,000 children with no breakfast in their schools; see [Byrne and Anderson, 2014]. Can we improve the food… Expand
1 Citations
Sustainable Fair Division
This paper presents two models for online fair division: one existing model forFair division in food banks and one new model for fair division of deceased organs to patients that allocate the resources as they arrive to agents. Expand


Online Fair Division
This paper focuses on designing simple mechanisms allocating the food more efficiently and on investigating more closely the frontier between the allocation and the transportation frameworks within this mixed setting. Expand
Online Cake Cutting
  • T. Walsh
  • Computer Science, Engineering
  • ADT
  • 2011
This work proposes an online form of the cake cutting problem that models situations where agents arrive and depart during the process of dividing a resource and proposes some fairness properties that online cake cutting procedures can possess like online forms of proportionality and envy-freeness. Expand
Online Fair Division: Analysing a Food Bank Problem
An online model of fair division designed to capture features of a real world charity problem is studied and axiomatic properties of these mechanisms such as strategy-proofness and envy freeness are analyzed. Expand
Heuristics and Policies for Online Pickup and Delivery Problems
A courier company approached NICTA to help develop a decision support tool for managing their daily pickup and delivery problem. They take orders from customers throughout the day and have toExpand
Online Stochastic Matching: New Algorithms with Better Bounds
This work considers variants of the online stochastic bipartite matching problem motivated by Internet advertising display applications, as introduced in Feldman et al. (2009), and provides a best possible randomized algorithm with competitive ratio 1 − 1/e ≈ 0.632. Expand
The Complexity of Computing the Random Priority Allocation Matrix
It is not possible to design an efficient algorithm to get a good multiplicative approximation to the RP allocation matrix under suitable complexity-theoretic assumptions, and for an assignment problem with inadmissible objects, it is hard to decide whether a given subset of objects is matched in some Pareto efficient matching. Expand
PrefLib: A Library for Preferences
This work introduces PREFLIB: A Library for Preferences; an online resource that aims to encourage the growth of all facets of preference reasoning by establishing a centralized repository of high quality data based around simple, delimited data formats. Expand
School Breakfast Program
2. Who administers the SBP? The Food and Nutrition Service (FNS) of the United States Department of Agriculture (USDA) administers the Program at the Federal level. At the State level, the Program isExpand
Challenges in Resource and Cost Allocation
It is argued that it is now timely to consider richer models for the fair division of resources and for the allocation of costs which reflect more of the true complexity of many fair division and cost allocation problems met in the real world. Expand
Fair division - from cake-cutting to dispute resolution
This chapter discusses jealousy-freeness and equitability for n=2, the divisible case, and applications for the point-allocation procedures. Expand