​ Congestion games are a fundamental class of games widely considered and studied in
non-cooperative game theory, introduced to model several realistic scenarios in which …

We reveal a connection between coordination mechanisms for unrelated machine
scheduling and cost-sharing protocols. Using this connection, we interpret three …

We consider job scheduling settings, with multiple machines, where jobs arrive online and
choose a machine selfishly so as to minimize their cost. Our objective is the classic …

Network routing games, and more generally congestion games play a central role in
algorithmic game theory, comparable to the role of the traveling salesman problem in …

We consider the problem of designing network cost-sharing protocols with good equilibria
under uncertainty. The underlying game is a multicast game in a rooted undirected graph …

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 …

We consider a setting where selfish agents want to schedule jobs on related machines. The
agent submitting a job picks a server that minimizes a linear combination of the server price …

Coordination mechanisms aim to mitigate the impact of selfishness when scheduling jobs to
different machines. Such a mechanism defines a scheduling policy within each machine and …

We introduce a game where players selfishly choose a resource and endure a cost
depending on the number of players choosing nearby resources. We model the influences …

We study the worst case performance guarantee of locally optimal solutions for the problem
of scheduling jobs on uniformly related parallel machines with the objective of minimizing …