activity
20052026
most citedModularity-Maximizing Network Communities via Mathematical Programming

341 citations · 803 across the 44 of their papers we have counts for

collaborators
Showing 2011Show all

5 papers · 1 filter

cs.GT2011★ 27 cited

The Robust Price of Anarchy of Altruistic Games

Po-An Chen, Bart de Keijzer, David Kempe +1

We study the inefficiency of equilibria for various classes of games when players are (partially) altruistic. We model altruistic behavior by assuming that player i's perceived cos…

cs.NI2011

You Share, I Share: Network Effects and Economic Incentives in P2P File-Sharing Systems

Mahyar Salek, Shahin Shayandeh, David Kempe

We study the interaction between network effects and external incentives on file sharing behavior in Peer-to-Peer (P2P) networks. Many current or envisioned P2P networks reward ind…

cs.GT2011

False-name-proof Mechanisms for Hiring a Team

Atsushi Iwasaki, David Kempe, Mahyar Salek +1

We study the problem of hiring a team of selfish agents to perform a task. Each agent is assumed to own one or more elements of a set system, and the auctioneer is trying to purcha…

stat.ML2011★ 271 cited

Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection

Abhimanyu Das, David Kempe

We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can b…

cs.DS2011

Estimating the Average of a Lipschitz-Continuous Function from One Sample

Abhimanyu Das, David Kempe

We study the problem of estimating the average of a Lipschitz continuous function defined over a metric space, by querying at only a single point. More specifically, we exp…