We study the problem of allocating a set of objects, e.g. houses, tasks, offices to a group of people having preferences over these objects. For various reasons, it often happens that more objects, sometimes fewer objects are available than initially planned and allocated. How should such...

In this paper, I study dynamic and sequential fair division problems for players with dichotomous preferences. I have devised a systematic approach of designing efficient, envy-free, and strategy-proof mechanisms for generic problems. The mechanisms developed in this paper can accommodate common...

The well-known deterministic resource-constrained project scheduling problem (RCPSP) involves the determination of a predictive schedule (baseline schedule or pre-schedule) of the project activities that satisfies the finish-start precedence relations and the renewable resource constraints under...