Tim Roughgarden
Skip Abstract Section
Abstract
A new era of theoretical computer science addresses fundamental problems about auctions, networks, and human behavior.
- Archer, A. and Tardos, É. Truthful mechanisms for one-parameter agents. FOCS '01, 482--491. Google Scholar
Digital Library
- Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V.S., and Skopalik, A. Fast convergence to nearly optimal solutions in potential games. EC '08, 264--273. Google ScholarDigital Library
- Babaioff, M., Lavi, R., and Pavlov, E. Single-value combinatorial auctions and algorithmic implementation in undominated strategies. JACM 56, 1 (2009). Google ScholarDigital Library
- Beckmann, M.J., McGuire, C.B., and Winsten, C.B. Studies in the Economics of Transportation. Yale University Press, 1956.Google Scholar
- Bertsekas, D.P. and Tsitsiklis, J.N. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, 1989. Google ScholarDigital Library
- Blum, A., Hajiaghayi, M., Ligett, K., and Roth, A. Regret minimization and the price of total anarchy. STOC '08, 373--382. Google ScholarDigital Library
- Braess, D. Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung, 12 (1968), 258--268.Google Scholar
- Chen, X., Deng, X., and Teng, S.-H. Settling the complexity of computing two-player Nash equilibria. JACM 56, 3 (2009). Google ScholarDigital Library
- Chien, S. and Sinclair, S. Convergence to approximate Nash equilibria in congestion games. SODA '07, 169--178. Google ScholarDigital Library
- Cohen, J.E. and Horowitz, P. Paradoxical behavior of mechanical and electrical networks. Nature 352, 8 (1991), 699--701.Google ScholarCross Ref
- Cramton, P., Shoham, Y., and Steinberg, R., Eds. Combinatorial Auctions. MIT Press, 2006. Google ScholarDigital Library
- Daskalakis, C., Goldberg, P.W., and Papadimitriou, C.H. The complexity of computing a Nash equilibria. SIAM Journal on Computing 39, 1 (2009), 195--259. Google ScholarDigital Library
- Daskalakis, C., Goldberg, P.W., and Papadimitriou, C.H. The complexity of computing a Nash equilibrium. Commun. ACM 52, 2 (Feb. 2009) 89--97. Google ScholarDigital Library
- Dhangwatnotai, P., Dobzinski, S., Dughmi, S., and Roughgarden, T. Truthful approximation schemes for single-parameter agents. FOCS '08, 15--24. Google ScholarDigital Library
- Etessami, K. and Yannakakis, M. On the complexity of Nash equilibria and other fixed points. SIAM Journal on Computing 39, 6 (2010) 2531--2597. Google ScholarDigital Library
- Fabrikant, A. and Papadimitriou, C.H. The complexity of game dynamics: BGP oscillations, sink equlibria, and beyond. SODA '08, 844--853. Google ScholarDigital Library
- Fabrikant, A., Papadimitriou, C.H., and Talwar, K. The complexity of pure Nash equilibria. STOC '04, 604--612. Google ScholarDigital Library
- Feigenbaum, J., Parkes, D.C., and Pennock, D.M. Computational challenges in e-commerce. Commun. ACM 52, 1 (Jan. 2009), 70--74. Google ScholarDigital Library
- Goemans, M.X., Mirrokni, V.S., and Vetta, A. Sink equilibria and convergence. FOCS '05, 142--151. Google ScholarDigital Library
- Jackson, M.O. A crash course in implementation theory. Social Choice and Welfare 18, 4 (2001), 655--708.Google ScholarCross Ref
- Johnson, D.S., Papadimitriou, C.H., and Yannakakis, M. How easy is local search? J. Computer and System Sciences 37, 1 (1988), 79--100. Google ScholarDigital Library
- Koutsoupias, E. and Papadimitriou, C.H. Worst-case equilibria. STACS '99, 404--413. Google ScholarDigital Library
- Lavi, R., Mu'alem, A., and Nisan, N. Towards a characterization of truthful combinatorial auctions. FOCS '03, 574--583. Google ScholarDigital Library
- Lemke, C.E. and Howson, J.T., Jr. Equilibrium points of bimatrix games. SIAM J. 12, 2 (1964), 413--423.Google Scholar
- Megiddo, N. and Papadimitriou, C.H. On total functions, existence theorems and computational complexity. Theoretical Computer Science 81, 2 (1991), 317--324. Google ScholarDigital Library
- Monderer, D. and Shapley, L.S. Potential games. Games and Economic Behavior 14, 1 (1996), 124--143.Google ScholarCross Ref
- Myerson, R. Optimal auction design. Mathematics of Operations Research 6, 1 (1981), 58--73.Google ScholarDigital Library
- Nash, J.F., Jr. Equilibrium points in N-person games. In Proceedings of the National Academy of Science 36, 1 (1950), 48--49.Google ScholarCross Ref
- Nisan, N. and Ronen, A. Algorithmic mechanism design. Games and Economic Behavior 35, 1--2 (2001), 166--196.Google ScholarCross Ref
- Nisan, N., Roughgarden, T., Tardos, É., and Vazirani, V.V., Eds. Algorithmic Game Theory. Cambridge University Press, 2007. Google ScholarDigital Library
- Nisan, N., Schapira, M., Valiant, G., and Zohar, A. Best-reply mechanisms. Working paper, 2009.Google Scholar
- Papadimitriou, C.H. On the complexity of the parity argument and other inefficient proofs of existence. J. Computer and System Sciences 48 3 (1994), 498--532. Google ScholarDigital Library
- Papadimitriou, C.H., Schapira, M., and Singer, Y. On the hardness of being truthful. FOCS '08, 250--259. Google ScholarDigital Library
- Rosenthal, R.W. A class of games possessing pure-strategy Nash equilibria. International J. Game Theory 2, 1 (1973), 65--67.Google ScholarCross Ref
- Roughgarden, T. Algorithmic game theory: Some greatest hits and future directions. TCS '08, 21--42.Google Scholar
- Roughgarden, T. Intrinsic robustness of the price of anarchy. STOC '09, 513--522. Google ScholarDigital Library
- Roughgarden, T. The price of anarchy is independent of the network topology. J. Computer and System Sciences 67, 2 (2003), 341--364. Google ScholarDigital Library
- Roughgarden, T. Computing equilibria: A computational complexity perspective. Economic Theory 42, 1 (Jan. 2010), 193--236.Google ScholarCross Ref
- Roughgarden, T. and Tardos, É. How bad is selfish routing? JACM 49, 2 (2002), 236--259. Google ScholarDigital Library
- Shoham, Y. Computer science and game theory. Commun. ACM 51, 8 (Aug. 2008), 75--79. Google ScholarDigital Library
- Shoham, Y. and Leyton-Brown, K. Multiagent Systems: Algorithmic, Game Theoretic and Logical Foundations. Cambridge University Press, 2008. Google ScholarDigital Library
- Steiglitz, K. Snipers, Shills, and Sharks: eBay and Human Behavior. Princeton University Press, 2007. Google ScholarDigital Library
- Vickrey, W. Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16, 1 (1961), 8--37.Google ScholarCross Ref
Index Terms
- Algorithmic game theory
Comments