• Publications
  • Influence
Cooperative Games with Overlapping Coalitions
TLDR
In the usual models of cooperative game theory, the outcome of a coalition formation process is either the grand coalition or a coalition structure that consists of disjoint coalitions. Expand
  • 114
  • 16
  • PDF
Coalition formation with spatial and temporal constraints
TLDR
The coordination of emergency responders and robots to undertake a number of tasks in disaster scenarios is a grand challenge for multi-agent systems. Expand
  • 101
  • 10
  • PDF
Convergence to Equilibria in Plurality Voting
TLDR
We show for the first time how convergence depends on the exact attributes of the game, such as the tie-breaking scheme and on assumptions regarding agents' weights and strategies. Expand
  • 105
  • 7
  • PDF
Coalition Structure Generation over Graphs
TLDR
We give the analysis of the computational complexity of coalition structure generation over graphs. Expand
  • 51
  • 7
  • PDF
Congestion games with failures
TLDR
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. Expand
  • 29
  • 2
  • PDF
Considerate Equilibrium
TLDR
We study the existence and computational complexity of coalitional stability concepts based on social networks, and show that there exists a state that is stable against selfish and considerate behavior simultaneously. Expand
  • 19
  • 2
  • PDF
On the Convergence of Iterative Voting: How Restrictive Should Restricted Dynamics Be?
We study convergence properties of iterative voting procedures. Such procedures are defined by a voting rule and a (restricted) iterative process, where at each step one agent can modify his voteExpand
  • 34
  • 1
  • PDF
The price of democracy in coalition formation
TLDR
We introduce the notion of the Price of Democracy (PoD), which measures the amount of resources needlessly committed to the task(s) at hand. Expand
  • 14
  • 1
  • PDF
Congestion games with load-dependent failures: identical resources
TLDR
We define a new class of games, congestion games with load-dependent failures (CGLFs), which generalizes the well-known class of congestion games, by incorporating the issue of resource failures into congestion settings, where the failure probability of each resource depends on the number of agents selecting this resource. Expand
  • 25
  • 1
  • PDF
Generalised Fictitious Play for a Continuum of Anonymous Players
TLDR
In this paper, we tackle the problem of computing Nash equilibria in anonymous games with continuous player types, extending the framework to encompass settings with imperfect information, in which the algorithm shows quick convergence. Expand
  • 19
  • 1
  • PDF