We examine the quality of social choice mechanisms using a utilitarian view, in which all of the agents have costs for each of the possible alternatives. While these underlying costs determine whatâ€¦ (More)

We provide approximation algorithms for several variants of the Firefighter problem on general graphs. The Firefighter problem models the case where an infection or another diffusive process (such asâ€¦ (More)

We determine the quality of randomized social choice mechanisms in a setting in which the agents have metric preferences: every agent has a cost for each alternative, and these costs form a metric.â€¦ (More)

We provide approximation algorithms for several variants of the Firefighter problem on general graphs. The Firefighter problem models the case where a diffusive process such as an infection (or anâ€¦ (More)

We define a problem called Simplex Matching, and show that it is solvable in polynomial time. While Simplex Matching is interesting in its own right as a nontrivial extension of non-bipartiteâ€¦ (More)

We consider network contribution games, where each agent in a network has a budget of effort that he can contribute to different collaborative projects or relationships. Depending on the contributionâ€¦ (More)