8 citations · 11 across the 4 of their papers we have counts for
4 papers
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…
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…
Selfish Jobs with Favorite Machines: Price of Anarchy vs Strong Price of Anarchy
Cong Chen, Paolo Penna, Yinfeng Xu
We consider the well-studied game-theoretic version of machine scheduling in which jobs correspond to self-interested users and machines correspond to resources. Here each user cho…
Sequential Solutions in Machine Scheduling Games
Cong Chen, Paul Giessler, Akaki Mamageishvili +2
We consider the classical machine scheduling, where jobs need to be scheduled on machines, and where job scheduled on machine contributes to…