Congestion games—in which players strategically choose from a set of “resources” and derive utilities that depend on the congestion on each resource— are important in a wid...
Andrew Byde, Maria Polukarov, Nicholas R. Jennings
Dynamic multi-team games are introduced. In these games Pareto optimality is used within the team but Nash equilibrium is sought between different teams. Puu
We study the effect of combining selfishness and altruism in atomic congestion games. We allow players to be partially altruistic and partially selfish and determine the impact of ...
Ioannis Caragiannis, Christos Kaklamanis, Panagiot...
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
Imagine a set of self-interested clients, each of whom must choose a server from a permissible set. A server’s latency is inversely proportional to its speed, but it grows linear...