Multistage online maxmin allocation of indivisible entities

We consider an online allocation problem that involves a set of players and a set of indivisible entities over discrete time steps . At each time step , for every entity , there is a restriction list that prescribes the subset of players to whom can be assigned and a non-negative value of to every player . The sets and are fixed beforehand. The sets and values are given in an online fashion. An allocation is a distribution of among , and we are interested in the minimum total value of the entities received by a player according to the allocation. In the static case, it is NP-hard to find an optimal allocation the maximizes this minimum value. On the other hand, -approximation algorithms have been developed for certain values of . We propose a -lookahead algorithm for the multistage online maxmin allocation problem for any fixed in which the restriction lists and values of entities may change between time steps, and there is a fixed stability reward for an entity to be assigned to the same player from one time step to the next. The objective is to maximize the sum of the minimum values and stability rewards over the time steps . Our algorithm achieves a competitive ratio of , where is the positive root of the equation . When , it is greater than , which improves upon the previous ratio of obtained for the case of 1-lookahead.