… of online fair division in which agents have monotone but … , monotone utilities are especially
challenging in an online … We define firstly the model of online fair division with monotone …

… In this review of the most salient fair division results of the past 30 years, I concentrate on
division rules with the best potential for practical implementation. The critical design parameter …

… Our goal is to throw some light on the feasible guarantees in the very general class of
nonatomic fair division problems, in which small changes in the size of a share result in small utility …

… A rule to allocate resources in an intertemporal context is online1 if the allocation taking place
in … We compare here the performance of a family of online fair division rules that are both …

This survey considers approaches to fair division from diverse disciplines, including
mathematics, operations research and economics, all of which place fair division within the same …

… This paper considers a novel online fair division problem … -life applications, eg, an online
platform that has a large number of … , we model the online fair division problem using contextual …

… Throughout the paper, we consider monotone pure Nash equilibria in which each agent
bids their positively or zero for each item they like, and bids zero for each item they dislike. …

… As we will see, EF1 is easy to achieve, even when the valuation functions are general
monotone. However, in many cases it is a fairly weak fairness notion; an EF1 allocation is …

… We consider the model of online fair division from [17] in which items are … results in (offline)
fair division. For example, we prove that no … of envy-freeness and general monotone utilities. …

… We study an online version of the max-min fair allocation problem for indivisible items. In …
In research on the topic of online allocation, this is a fundamental and natural problem. Our …