• Publications
  • Influence
Maximizing the Spread of Influence through a Social Network
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations,Expand
  • 4,121
  • 936
How bad is selfish routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for eachExpand
  • 1,211
  • 131
Approximation algorithms for scheduling unrelated parallel machines
We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requiresExpand
  • 631
  • 106
An approximation algorithm for the generalized assignment problem
The generalized assignment problem can be viewed as the following problem of scheduling parallel machines with costs. Each job is to be processed by exactly one machine; processing jobj on machineiExpand
  • 645
  • 100
The price of stability for network design with fair cost allocation
Network design is a fundamental problem for which it is important to understand the effects of strategic behavior. Given a collection of self-interested agents who want to form a network connectingExpand
  • 748
  • 86
Approximation algorithms for facility location problems (extended abstract)
The invention provides a vacuum interrupter with improved separation of functional elements. The interrupter includes separable contacts for carrying continuous current and rod electrode arrays forExpand
  • 599
  • 75
Algorithm design
Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise inExpand
  • 1,265
  • 69
Truthful mechanisms for one-parameter agents
  • A. Archer, Éva Tardos
  • Computer Science
  • Proceedings IEEE International Conference on…
  • 14 October 2001
The authors show how to design truthful (dominant strategy) mechanisms for several combinatorial problems where each agent's secret data is naturally expressed by a single positive real number. TheExpand
  • 362
  • 68
Fast Approximation Algorithms for Fractional Packing and Covering Problems
This paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms forExpand
  • 377
  • 60
How bad is selfish routing?
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for eachExpand
  • 748
  • 54