We study the speed of convergence of decentralized dynamics to approximately optimal
solutions in potential games. We consider α-Nash dynamics in which a player makes a …

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 …

Congestion games constitute an important class of games in which computing an exact or
even approximate pure Nash equilibrium is in general PLS-complete. We present a …

We study the speed of convergence to approximately optimal states in two classes of
potential games. We provide bounds in terms of the number of rounds, where a round …

An important task in the analysis of multiagent systems is to understand how groups of
selfish players can form coalitions, ie, work together in teams. In this paper, we study the …

Spatial crowdsourcing (SC) has gained much attention in recent years. On SC platforms,
requesters can publish spatial tasks on a specific topic such as taking photos at certain …

Many natural games have a dramatic difference between the quality of their best and worst
Nash equilibria, even in pure strategies. Yet, nearly all results to date on dynamics in games …

We investigate the approximation ratio of the solutions achieved after a one-round walk in
linear congestion games. We consider the social functions S um, defined as the sum of the …

Designing fast, distributed algorithms for multi-agent problems is vital for many novel
application domains. Greedy algorithms have been shown in many multi-agent contexts to …

Lookahead search is perhaps the most natural and widely used game playing strategy.
Given the practical importance of the method, the aim of this paper is to provide a theoretical …