We study the ability of decentralized, local dynamics in non-cooperative games to rapidly
reach an approximate (pure) Nash equilibrium. Our main result states that for symmetric …

There has been substantial work develo** simple, efficient no-regret algorithms for a wide
class of repeated decision-making problems including online routing. These are adaptive …

Suppose that a set of m tasks are to be shared as equally as possible among a set of n
resources. A game-theoretic mechanism to find a suitable allocation is to associate each …

We study the number of steps required to reach a pure Nash equilibrium in a load balancing
scenario where each job behaves selfishly and attempts to migrate to a machine which will …

A recent body of experimental literature has studied empirical game-theoretical analysis, in
which we have partial knowledge of a game, consisting of observations of a subset of the …

Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in
the dominating set. We propose a new order-based randomised local search (RLS o) …

We consider n anonymous selfish users that route their communication through m parallel
links. The users are allowed to reroute, concurrently, from overloaded links to underloaded …

Overcomplete latent representations have been very popular for unsupervised feature
learning in recent years. In this paper, we specify which overcomplete models can be …

In a scheduling game, each player owns a job and chooses a machine to execute it. While
the social cost is the maximal load over all machines (makespan), the cost (disutility) of each …

We consider the following load balancing process for m tokens distributed arbitrarily among
n nodes connected by a complete graph. In each time step a pair of nodes is selected …