This paper considers one machine job scheduling situations or sequencing problems, where clients can have more than a single job to be processed in order to get a final output. Moreover, a job can be of interest for different players. This means that one of the main assumptions in classic...

Game theoretic analysis of sequencing situations has been restricted to manufacturing systems which consist of machines that can process only one job at a time. However, in many manufacturing systems, operations are carried out by batch machines which can simultaneously process multiple jobs....

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...