This period’s Research Lecture is given by Arman Rouhani, a PhD Candidate at the KE Dept at SBE. The title and abstract of the lecture are as follows:

An improved bound for the price of anarchy for related machine scheduling

In this talk, we introduce an improved upper bound for the efficiency of Nash equilibria in utilitarian scheduling games on related machines. The machines have varying speeds and adhere to the Shortest Processing Time (SPT) policy as the global order for job processing. The goal of each job is to minimize its completion time, while the social objective is to minimize the sum of completion times

The lecture will take place in the room TS53 A0.23 at 19:00h

As usual, the evening will continue with drinks at the Preuv :)