Scientific publications

The machine load balancing game with linear externalities is considered. A set of jobs is to be assigned to a set of machines with different latencies depending on their own loads and also loads of other machines. The jobs choose machines to minimize their own latencies. The social cost of a schedule is the maximum delay among all machines, i.e., the makespan. For the case of two machines, the existence of a Nash equilibrium is proven in this model and an expression for the price of anarchy is obtained.