Searching for authors named "Tim Roughgarden" – sorted by Relevance.
-
Routing Games
- Tim Roughgarden Abstract This chapter studies the inefficiency of equilibria in noncooperative routing
- Cited by 1 (1 self) – Add To MetaCart
-
An algorithmic game theory primer
- An Algorithmic Game Theory Primer ∗ Tim Roughgarden † June 21, 2008 Abstract We give a brief
- Cited by 1 (0 self) – Add To MetaCart
-
Designing networks for selfish users is hard
- Designing Networks for Selfish Users is Hard* Tim Roughgarden# January 13, 2002 Abstract We
- Cited by 48 (7 self) – Add To MetaCart
-
Stackelberg scheduling strategies
- Stackelberg Scheduling Strategies Tim Roughgarden* May 2, 2001 AbstractWe study the problem
- Cited by 62 (5 self) – Add To MetaCart
-
The price of anarchy is independent of the network topology
- The Price of Anarchy is Independent of the Network Topology ∗ Tim Roughgarden † December 23, 2002
- Cited by 100 (9 self) – Add To MetaCart
-
How unfair is optimal routing
- How Unfair is Optimal Routing? Tim Roughgarden* 1 Introduction We are given a network and a
- Cited by 23 (1 self) – Add To MetaCart
-
Selfish Routing and the Price of Anarchy
- Selfish Routing and the Price of Anarchy Tim Roughgarden \Lambda January 7, 2006 Abstract
- Cited by 55 (6 self) – Add To MetaCart
-
Intrinsic Robustness of the Price of Anarchy
- Intrinsic Robustness of the Price of Anarchy Tim Roughgarden ∗ Department of Computer Science
- Add To MetaCart
-
Lectures on Combinatorial Auctions ∗
- Lectures on Combinatorial Auctions ∗ Tim Roughgarden † October 18, 2008 These are lecture notes
- Add To MetaCart
-
Single-Source Stochastic Routing
- Single-Source Stochastic Routing Shuchi Chawla 1⋆ and Tim Roughgarden 2⋆⋆ 1 Microsoft Research
- Add To MetaCart

