2 papers
cs.GT2020
The curse of rationality in sequential scheduling games
Cong Chen, Yinfeng Xu
Despite the emphases on computability issues in research of algorithmic game theory, the limited computational capacity of players have received far less attention. This work exami…
cs.DS2018
Online scheduling of jobs with favorite machines
Cong Chen, Paolo Penna, Yinfeng Xu
This work introduces a natural variant of the online machine scheduling problem on unrelated machines, which we refer to as the favorite machine model. In this model, each job has…