Abstract Online Fai Martin University of New South Wales Martin.Aleksandr1 Introduction Hunger is a major problem even in developed countries like Australia. We are working with a social startup, Foodbank Local, and local charities at distributing donated food more efficiently. This food must first be allocated to these charitiand then delivered to the end customers. This fair division problem is interesting as it combines traditional features witha number of dimensions that are scarcely considered or combined in the literature. For example, the food arrives online athe day progresses. We must start allocating it almost immediately, possibly anticipating more donations later the same day. We assume the products are packaged and therefore indivisible. How do we then allocate them? Also, the problem the food banks face today is likely to repeat tomorrow. Can we then improve the allocation tomorrow by using the experience learned today? As a very first step, we focus on designing simple mechanisms allocating the food more efficiently (see Aleksandrov et al. [2015a]). In future, we also plan on investigating more closely the frontier between the allocation and the transportation frameworks within this mixed setting. For instance, shall we dispatch the items as soon as they arrive? Or, shall we first gather some more of them and then dispatch these together in order to guarantee the efficiency ofthe driver’s shift? 2 BackgroundA greatly investigated topic in resource allocation is fair division. Pioneered by Steinhaus [1948], the theoretical models of fair division are typically simplistic and inadequate inaddressing complex features encountered in many practical settings. As a response, Walsh [2015], for example, develops more sophisticated and realistic models and mechanisms. In addition, most abstractions assume that the entire resource is available a priori, an assumption often being disregarded in practice. Despite the limited work in online fair division, there are a few works considering features of the problem in isolation. Walsh [2011] cuts cake by adapting existing fair division procedures to an online setting. By comparison, the agents in this model arrive over time, not the resource. Also, Kash et al. [2014] have proposed a related model in which there are multiple, homogeneous divisible goods and not indivisible goods as in here. In this work, we report some initial results from Aleksandrov et al. [2015a].