| Algorithmic game theory T Roughgarden Communications of the ACM 53 (7), 78-86, 2010 | 5286 | 2010 |
| How bad is selfish routing? T Roughgarden, É Tardos Journal of the ACM (JACM) 49 (2), 236-259, 2002 | 2543 | 2002 |
| Selfish routing and the price of anarchy T Roughgarden MIT press, 2005 | 1224 | 2005 |
| The price of stability for network design with fair cost allocation E Anshelevich, A Dasgupta, J Kleinberg, É Tardos, T Wexler, ... SIAM Journal on Computing 38 (4), 1602-1623, 2008 | 1138 | 2008 |
| The price of anarchy is independent of the network topology T Roughgarden Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 708 | 2002 |
| Universally utility-maximizing privacy mechanisms A Ghosh, T Roughgarden, M Sundararajan Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 655 | 2009 |
| Intrinsic robustness of the price of anarchy T Roughgarden Journal of the ACM (JACM) 62 (5), 1-42, 2015 | 625 | 2015 |
| Computing correlated equilibria in multi-player games CH Papadimitriou, T Roughgarden Journal of the ACM (JACM) 55 (3), 1-29, 2008 | 487 | 2008 |
| Stackelberg scheduling strategies T Roughgarden Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001 | 424 | 2001 |
| Bounding the inefficiency of equilibria in nonatomic congestion games T Roughgarden, É Tardos Games and economic behavior 47 (2), 389-403, 2004 | 401 | 2004 |
| Simple versus optimal mechanisms JD Hartline, T Roughgarden Proceedings of the 10th ACM conference on Electronic commerce, 225-234, 2009 | 382 | 2009 |
| Revenue maximization with a single sample P Dhangwatnotai, T Roughgarden, Q Yan Proceedings of the 11th ACM conference on Electronic commerce, 129-138, 2010 | 321 | 2010 |
| Pricing network edges for heterogeneous selfish users R Cole, Y Dodis, T Roughgarden Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 313 | 2003 |
| Interactive privacy via the median mechanism A Roth, T Roughgarden Proceedings of the forty-second ACM symposium on Theory of computing, 765-774, 2010 | 291 | 2010 |
| Climate change policy: quantifying uncertainties for damages and optimal carbon taxes T Roughgarden, SH Schneider Energy Policy 27 (7), 415-429, 1999 | 288 | 1999 |
| The sample complexity of revenue maximization R Cole, T Roughgarden Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 283 | 2014 |
| Twenty lectures on algorithmic game theory T Roughgarden Cambridge University Press, 2016 | 280 | 2016 |
| Bidding languages N Nisan Combinatorial auctions, 400-420, 2006 | 263 | 2006 |
| How much can taxes help selfish routing? R Cole, Y Dodis, T Roughgarden Proceedings of the 4th ACM Conference on Electronic Commerce, 98-107, 2003 | 259 | 2003 |
| Optimal mechanism design and money burning JD Hartline, T Roughgarden Proceedings of the fortieth annual ACM symposium on Theory of computing, 75-84, 2008 | 255 | 2008 |
Eva TardosProfessor of Computer Science, Cornell Universitycornell.edu의 이메일 확인됨
