Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Maximizing the Spread of Influence through a Social Network

- D. Kempe, J. Kleinberg, Éva Tardos
- Mathematics, Computer Science
- Theory Comput.
- 22 April 2015

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

How bad is selfish routing?

- T. Roughgarden, Éva Tardos
- Computer Science
- JACM
- 1 March 2002

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 each… Expand

Approximation algorithms for scheduling unrelated parallel machines

- J. K. Lenstra, D. Shmoys, Éva Tardos
- Mathematics, Computer Science
- 28th Annual Symposium on Foundations of Computer…
- 15 February 1990

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 requires… Expand

An approximation algorithm for the generalized assignment problem

- D. Shmoys, Éva Tardos
- Computer Science, Mathematics
- Math. Program.
- 8 December 1993

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 machinei… Expand

The price of stability for network design with fair cost allocation

- Elliot Anshelevich, Anirban Dasgupta, J. Kleinberg, Éva Tardos, Tom Wexler, T. Roughgarden
- Computer Science, Mathematics
- 45th Annual IEEE Symposium on Foundations of…
- 1 July 2008

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 connecting… Expand

Approximation algorithms for facility location problems (extended abstract)

- D. Shmoys, Éva Tardos, K. Aardal
- Computer Science
- STOC '97
- 4 May 1997

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 for… Expand

Algorithm design

- J. Kleinberg, Éva Tardos
- Computer Science
- 16 March 2005

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 in… Expand

- 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. The… Expand

Fast Approximation Algorithms for Fractional Packing and Covering Problems

- Serge A. Plotkin, D. Shmoys, Éva Tardos
- Mathematics, Computer Science
- Math. Oper. Res.
- 1 April 1995

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 for… Expand

How bad is selfish routing?

- T. Roughgarden, Éva Tardos
- Computer Science
- Proceedings 41st Annual Symposium on Foundations…
- 12 November 2000

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 each… Expand