Fair scheduling mechanism for an ordering of preferences over slot of time

Abstract

We develop an fair and strategy-proof scheduling mechanism when an agent has an ordering of preference of slot of time. The scheduling problem is known as an application of cake-cutting problem which is to fairly allocate a divisible goods among agents. We formalize a scheduling problem as a cake-cutting problem and then propose an fair and strategy-proof scheduling mechanism. We also evaluate the efficiency obtained the proposed mechanism using computational simulations.