Tuesday 10 February 2015
January 30, 2015.
Ruben Hoeksma succesfully defended his PhD thesis on mechanisms for scheduling games with selfish players. Ruben was supervised by Marc Uetz. In his thesis, he addresses optimization of scheduling problems, when the optimizer is confronted with strategic behaviour of players that control the jobs. He proves bounds for the decrease of performance when the optimizer does not have full control. Furthermore, he shows that, in the event of incomplete information, optimal schedules can be found efficiently by means of linear programming techniques.
