Algorithms, games, and the internet
暂无分享,去创建一个
[1] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[2] Prabhakar Raghavan,et al. Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[3] Richard W. Cottle,et al. Linear Complementarity Problem. , 1992 .
[4] Mihalis Yannakakis,et al. On complexity as bounded rationality (extended abstract) , 1994, STOC '94.
[5] Xiaotie Deng,et al. On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..
[6] Christos H. Papadimitriou,et al. On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..
[7] Ariel Rubinstein,et al. A Course in Game Theory , 1995 .
[8] Eric J. Friedman,et al. Learning and Implementation on the Internet , 1997 .
[9] Jon M. Kleinberg,et al. Segmentation problems , 2004, JACM.
[10] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[11] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[12] Noam Nisan,et al. Algorithms for Selfish Agents , 1999, STACS.
[13] Noam Nisan,et al. Algorithms for selfish agents mechanism design for distributed computation , 1999 .
[14] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.
[15] Jon Kleinberg,et al. Authoritative sources in a hyperlinked environment , 1999, SODA '98.
[16] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[17] Joan Feigenbaum,et al. Sharing the cost of muliticast transmissions (preliminary version) , 2000, STOC '00.
[18] Yishay Mansour,et al. Nash Convergence of Gradient Dynamics in General-Sum Games , 2000, UAI.
[19] Richard M. Karp,et al. Optimization problems in congestion control , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[20] Eli Upfal,et al. Stochastic models for the Web graph , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[21] Noam Nisan,et al. Algorithmic Mechanism Design , 2001, Games Econ. Behav..
[22] Frank Kelly,et al. Mathematical Modelling of the Internet , 2001 .
[23] Paul G. Spirakis,et al. The price of selfish routing , 2001, STOC '01.
[24] Joan Feigenbaum,et al. Sharing the Cost of Multicast Transmissions , 2001, J. Comput. Syst. Sci..
[25] C. Papadimitriou,et al. On the value of private information , 2001 .