#### Filter Results:

- Full text PDF available (263)

#### Publication Year

1999

2017

- This year (9)
- Last 5 years (175)
- Last 10 years (234)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Tim Roughgarden
- Commun. ACM
- 2010

A new era of theoretical computer science addresses fundamental problems about auctions, networks, and human behavior.

- Tim Roughgarden, Éva Tardos
- FOCS
- 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 edge specifying the time needed to traverse the edge given its congestion; the objective is to route traffic such that the sum of all travel times---the total… (More)

- Tim Roughgarden
- J. ACM
- 2009

The price of anarchy, defined as the ratio of the worst-case objective function value of a Nash equilibrium of a game and that of an optimal outcome, quantifies the inefficiency of selfish behavior. Remarkably good bounds on this measure are known for a wide range of application domains. However, such bounds are meaningful only if a game's participants… (More)

- Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden
- 45th Annual IEEE Symposium on Foundations of…
- 2004

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 certain endpoints, the set of stable solutions - the Nash equilibria - may look quite different from the centrally enforced optimum. We study the quality of the… (More)

- Tim Roughgarden
- 2005

Selfish routing is a classical mathematical model of how self-interested users might route traffic through a congested network. The outcome of selfish routing is generally inefficient, in that it fails to optimize natural objective functions. The price of anarchy is a quantitative measure of this inefficiency. We survey recent work that analyzes the price… (More)

- Tim Roughgarden
- J. Comput. Syst. Sci.
- 2002

We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a directed network in which each edge possesses a latency function describing the common latency incurred by all traffic on the edge as a function of the edge congestion. Given a rate of traffic between each pair of nodes in the… (More)

We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuations of indistinguishable bidders are independent draws from a common distribution. Crucially, we assume all valuation distributions are a priori <i>unknown</i> to the seller. Despite… (More)

- Kshipra Bhawalkar, Tim Roughgarden
- SODA
- 2011

We analyze the price of anarchy (POA) in a simple and practical non-truthful combinatorial auction when players have subadditive valuations for goods. We study the mechanism that sells every good in parallel with separate second-price auctions. We first prove that under a standard "no overbidding" assumption, for every subadditive valuation profile, every… (More)

- Tim Roughgarden
- STOC
- 2001

We study the problem of optimizing the performance of a system shared by selfish, noncooperative users. We consider the concrete setting of scheduling jobs on a set of shared machines with load-dependent latency functions specifying the length of time necessary to complete a job; we measure system performance by the <italic>total latency</italic> of the… (More)

- Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
- SIAM J. Comput.
- 2009

A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information maximizes utility while minimizing privacy, while publishing random noise accomplishes the opposite. Privacy can be rigorously quantified using the framework of <i>differential… (More)