Abstract Game Theory and Mechanism Design are by now standard tools for studying and
designing massive decentralized systems. Unfortunately, designing mechanisms that induce …

Congestion games are a fundamental and widely studied model for selfish allocation
problems like routing and load balancing. An intrinsic property of these games is that players …

This article studies the effects of altruism, a phenomenon widely observed in practice, in the
model of atomic congestion games. Altruistic behavior is modeled by a linear trade-off …

In the last decade, there has been much progress in understanding scheduling problems in
which selfish jobs aim to minimize their individual completion time. Most of this work has …

We investigate the influence of different algorithmic choices on the approximation ratio in
selfish scheduling. Our goal is to design local policies that minimize the inefficiency of …

We study coordination mechanisms aiming to minimize the weighted sum of completion
times of jobs in the context of selfish scheduling problems. Our goal is to design local …

We consider the unrelated machine scheduling game in which players control subsets of
jobs. Each player's objective is to minimize the weighted sum of completion time of her jobs …

We investigate coordination mechanisms that schedule n jobs on m unrelated machines.
The objective is to minimize the latest completion of all jobs, ie, the makespan. It is known …

We consider a scheduling game, in which both the machines and the jobs are players.
Machines are controlled by different selfish agents and attempt to maximize their workloads …

This article investigates the performance of the Weighted Shortest Processing Time (WSPT)
rule as a local sequencing policy in a scheduling game for uniformly related parallel …