The price of anarchy, defined as the ratio of the worst-case objective function value of a
Nash equilibrium of a game and that of an optimal outcome, quantifies the inefficiency of …

We study the outcome of natural learning algorithms in atomic congestion games. Atomic
congestion games have a wide variety of equilibria often with vastly differing social costs …

We present an overview of NP-hard problems and methods related to deployment, resource
sharing, load balancing and fairness among multiple users in 5G mobile networks. We …

Graph partitioning plays a vital role in distributed large-scale web graph analytics, such as
pagerank and label propagation. The quality and scalability of partitioning strategy have a …

This paper provides a literature overview on (direct revelation) algorithmic mechanism
design in the context of machine scheduling problems. Here, one takes a game-theoretic …

Typical models of strategic interactions in computer science use simultaneous move games.
However, in applications simultaneity is often hard or impossible to achieve. In this paper …

We present three new coordination mechanisms for scheduling n selfish jobs on m
unrelated machines. A coordination mechanism aims to mitigate the impact of selfishness of …

Since the pioneering paper of Rosenthal a lot of work has been done in order to determine
classes of games that admit a potential. First, we study the existence of potential functions for …

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 …

An atomic congestion game with two types of agents, cars and trucks, is used to model the
traffic flow on a road over certain time intervals. In this game, the drivers make a trade-off …