| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan, Tim Roughgarden |
Sketching valuation functions.  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Stefano Leonardi, Tim Roughgarden |
Prior-free auctions with ordered bidders. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Krauthgamer, Tim Roughgarden |
Metric Clustering via Consistent Labeling. |
Theory of Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shaddin Dughmi, Tim Roughgarden, Qiqi Yan |
From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions for Submodular Bidders |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shaddin Dughmi, Tim Roughgarden, Jan Vondrák, Qiqi Yan |
An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover |
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden |
Truthful Approximation Schemes for Single-Parameter Agents. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kshipra Bhawalkar, Tim Roughgarden |
Welfare Guarantees for Combinatorial Auctions with Item Bidding. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Tim Roughgarden, Florian Schoppmann |
Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ranjitha Kumar, Jerry O. Talton, Salman Ahmad, Tim Roughgarden, Scott R. Klemmer |
Flexible Tree Matching. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Konstantinos Kollias, Tim Roughgarden |
Restoring Pure Equilibria to Weighted Congestion Games. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Uri Nadav, Ramesh Johari, Tim Roughgarden |
Uncoupled potentials for proportional allocation markets. |
CDC-ECE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoav Shoham, Yan Chen, Tim Roughgarden (eds.) |
Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), San Jose, CA, USA, June 5-9, 2011 |
ACM Conference on Electronic Commerce |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shaddin Dughmi, Tim Roughgarden, Qiqi Yan |
From convex optimization to randomized mechanisms: toward optimal combinatorial auctions. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah |
Fully Distributed Algorithms for Convex Optimization Problems. |
SIAM Journal on Optimization |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory Valiant, Tim Roughgarden |
Braess's Paradox in large random graphs. |
Random Struct. Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden |
Algorithmic game theory. |
Commun. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ho-Lin Chen, Tim Roughgarden, Gregory Valiant |
Designing Network Protocols for Good Equilibria. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kshipra Bhawalkar, Martin Gairing, Tim Roughgarden |
Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Uri Nadav, Tim Roughgarden |
The Limits of Smoothness: A Primal-Dual Framework for Price of Anarchy Bounds. |
WINE |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jason R. Marden, Tim Roughgarden |
Generalized efficiency bounds in distributed resource allocation. |
CDC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Peerapong Dhangwatnotai, Tim Roughgarden, Qiqi Yan |
Revenue maximization with a single sample. |
ACM Conference on Electronic Commerce |
2010 |
DBLP DOI BibTeX RDF |
auctions, mechanism design, revenue maximization |
| 1 | Shaddin Dughmi, Tim Roughgarden |
Black-Box Randomized Reductions in Algorithmic Mechanism Design. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Roth, Tim Roughgarden |
Interactive privacy via the median mechanism. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan |
Beyond Moulin mechanisms. |
Games and Economic Behavior |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden, Mukund Sundararajan |
Quantifying inefficiency in cost-sharing mechanisms. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
inefficiency, Mechanism design, Steiner tree, cost sharing, submodular functions |
| 1 | Aaron Roth, Tim Roughgarden |
The Median Mechanism: Interactive and Efficient Privacy with Multiple Queries |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ho-Lin Chen, Tim Roughgarden |
Network Design with Weighted Players. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Network design, Algorithmic game theory, Price of stability |
| 1 | Shuchi Chawla, Feng Niu, Tim Roughgarden |
Bertrand competition in networks. |
SIGecom Exchanges |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jason D. Hartline, Tim Roughgarden |
Simple versus optimal mechanisms. |
SIGecom Exchanges |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Damon Mosk-Aoyama, Tim Roughgarden |
Worst-Case Efficiency Analysis of Queueing Disciplines. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan |
Revenue Submodularity. |
AMMA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Arik Motskin, Tim Roughgarden, Primoz Skraba, Leonidas J. Guibas |
Lightweight Coloring and Desynchronization for Networks. |
INFOCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shaddin Dughmi, Tim Roughgarden, Mukund Sundararajan |
Revenue submodularity. |
ACM Conference on Electronic Commerce |
2009 |
DBLP DOI BibTeX RDF |
market expansion, efficiency, monotonicity, trade-offs, revenue, submodularity, vcg, optimal auctions |
| 1 | Jason D. Hartline, Tim Roughgarden |
Simple versus optimal mechanisms. |
ACM Conference on Electronic Commerce |
2009 |
DBLP DOI BibTeX RDF |
auctions, revenue-maximization, vcg mechanism, vickrey auction, optimal auctions |
| 1 | Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan |
Universally utility-maximizing privacy mechanisms. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
privacy, linear programming, utility, differential privacy |
| 1 | Tim Roughgarden |
Intrinsic robustness of the price of anarchy. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
regret-minimizat, price of anarchy, nash equilibria, congestion games |
| 1 | Christos H. Papadimitriou, Tim Roughgarden |
Computing correlated equilibria in multi-player games. |
J. ACM |
2008 |
DBLP DOI BibTeX RDF |
Correlated equilibria, complexity of equilibria, Nash equilibria |
| 1 | Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan |
Universally Utility-Maximizing Privacy Mechanisms |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jason D. Hartline, Tim Roughgarden |
Optimal Mechansim Design and Money Burning |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden |
The Price of Stability for Network Design with Fair Cost Allocation. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ho-Lin Chen, Tim Roughgarden, Gregory Valiant |
Designing networks with good equilibria. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Krauthgamer, Tim Roughgarden |
Metric clustering via consistent labeling. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden |
Algorithmic Game Theory: Some Greatest Hits and Future Directions. |
IFIP TCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Shahar Dobzinski, Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan |
Is Shapley Cost Sharing Optimal? |
SAGT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuchi Chawla, Tim Roughgarden |
Bertrand Competition in Networks. |
SAGT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden |
Truthful Approximation Schemes for Single-Parameter Agents. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jason D. Hartline, Tim Roughgarden |
Optimal mechanism design and money burning. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
money burning, optimal mechanism design, mechanism design |
| 1 | Moshe Haviv, Tim Roughgarden |
The price of anarchy in an exponential multi-server. |
Oper. Res. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden |
Approximation via cost sharing: Simpler and better approximation algorithms for network design. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
Approximation algorithms, network design, random sampling, cost sharing |
| 1 | Levente Buttyán, Jean-Pierre Hubaux, Li Li, Xiang-Yang Li, Tim Roughgarden, Alberto Leon-Garcia |
Guest Editorial Non-Cooperative Behavior in Networking. |
IEEE Journal on Selected Areas in Communications |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah |
Fully Distributed Algorithms for Convex Optimization Problems. |
DISC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden, Mukund Sundararajan |
Optimal Efficiency Guarantees for Network Design Mechanisms. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Aranyak Mehta, Tim Roughgarden, Mukund Sundararajan |
Beyond moulin mechanisms. |
ACM Conference on Electronic Commerce |
2007 |
DBLP DOI BibTeX RDF |
mechanism, cost-sharing |
| 1 | Mitul Saha, Tim Roughgarden, Jean-Claude Latombe, Gildardo Sánchez-Ante |
Planning Tours of Robotic Arms among Partitioned Goals. |
I. J. Robotic Res. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tim Roughgarden, Mukund Sundararajan |
Approximately Efficient Cost-Sharing Mechanisms |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Richard Cole, Yevgeniy Dodis, Tim Roughgarden |
How much can taxes help selfish routing? |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden |
On the severity of Braess's Paradox: Designing networks for selfish users is hard. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Yevgeniy Dodis, Tim Roughgarden |
Bottleneck links, variable demand, and the tragedy of the commons. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuchi Chawla, Tim Roughgarden, Mukund Sundararajan |
Optimal Cost-Sharing Mechanisms for Steiner Forest Problems. |
WINE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden |
Routers with Very Small Buffers. |
INFOCOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ho-Lin Chen, Tim Roughgarden |
Network design with weighted players. |
SPAA |
2006 |
DBLP DOI BibTeX RDF |
network design, network games, nash equilibria, price of stability |
| 1 | Gregory Valiant, Tim Roughgarden |
Braess's paradox in large random graphs. |
ACM Conference on Electronic Commerce |
2006 |
DBLP DOI BibTeX RDF |
Braess's paradox, random graphs, selfish routing |
| 1 | Shuchi Chawla, Tim Roughgarden |
Single-Source Stochastic Routing. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden, Mukund Sundararajan |
New trade-offs in cost-sharing mechanisms. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
Braess's Paradox, random graphs, selfish routing |
| 1 | Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Nick McKeown, Tim Roughgarden |
Part III: routers with very small buffers. |
Computer Communication Review |
2005 |
DBLP DOI BibTeX RDF |
all-optical routers, congestion control, TCP, buffer size |
| 1 | Tim Roughgarden |
An interview with Vladimir Trifonov 2005 Danny Lewin best student paper award winner. |
SIGACT News |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden |
Selfish routing and the price of anarchy. |
|
2005 |
RDF |
|
| 1 | Christos H. Papadimitriou, Tim Roughgarden |
Computing equilibria in multi-player games. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden |
Selfish routing with atomic players. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry C. Lin, Tim Roughgarden, Éva Tardos, Asher Walkover |
Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden, Éva Tardos |
Bounding the inefficiency of equilibria in nonatomic congestion games. |
Games and Economic Behavior |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabián A. Chudak, Tim Roughgarden, David P. Williamson |
Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. |
Math. Program. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden |
Stackelberg Scheduling Strategies. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden |
The maximum latency of selfish routing. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Henry C. Lin, Tim Roughgarden, Éva Tardos |
A stronger bound on Braess's Paradox. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden |
The Price of Stability for Network Design with Fair Cost Allocation. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden |
The price of anarchy is independent of the network topology. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Yevgeniy Dodis, Tim Roughgarden |
How much can taxes help selfish routing? |
ACM Conference on Electronic Commerce |
2003 |
DBLP DOI BibTeX RDF |
game theory, Nash equilibria, selfish routing, network pricing |
| 1 | Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden |
Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta, Amit Kumar, Tim Roughgarden |
Simpler and better approximation algorithms for network design. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
approximation algorithms, randomized algorithms, network design |
| 1 | Richard Cole, Yevgeniy Dodis, Tim Roughgarden |
Pricing network edges for heterogeneous selfish users. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
game theory, Nash equilibria, selfish routing, network pricing |
| 1 | Alan J. Hoffman, Kate Jenkins, Tim Roughgarden |
On a game in directed graphs. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden, Éva Tardos |
How bad is selfish routing? |
J. ACM |
2002 |
DBLP DOI BibTeX RDF |
Braess's Paradox, network flow, Nash equilibria, selfish routing |
| 1 | Tim Roughgarden |
How unfair is optimal routing? |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Kumar, Anupam Gupta, Tim Roughgarden |
A Constant-Factor Approximation Algorithm for the Multicommodity. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden |
The price of anarchy is independent of the network topology. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabián A. Chudak, Tim Roughgarden, David P. Williamson |
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation. |
IPCO |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden |
Designing Networks for Selfish Users is Hard. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden |
Stackelberg scheduling strategies. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden, Éva Tardos |
How Bad is Selfish Routing? |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
congested network, latency function, large-scale communication networks, network traffic regulation, optimal route assignment, minimum-latency path, edge congestion, Internet, Internet, performance optimization, telecommunication network routing, telecommunication traffic, telecommunication congestion control, selfish routing, traffic routing |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")