On the packing of selfish items
暂无分享,去创建一个
[1] Tim Roughgarden,et al. The price of anarchy is independent of the network topology , 2002, STOC '02.
[2] Martin Gairing,et al. Nashification and the Coordination Ratio for a Selfish Routing Game , 2003, ICALP.
[3] Tim Roughgarden,et al. How unfair is optimal routing? , 2002, SODA '02.
[4] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[5] Paul G. Spirakis,et al. Approximate Equilibria and Ball Fusion , 2003, Theory of Computing Systems.
[6] Marios Mavronicolas,et al. Nash Equilibria in Discrete Routing Games with Convex Latency Functions , 2004, ICALP.
[7] Christos H. Papadimitriou. Networks and Games , 2004, HiPC.
[8] Paul G. Spirakis,et al. Which Is the Worst-Case Nash Equilibrium? , 2003, MFCS.
[9] David B. Shmoys,et al. A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1988, SIAM J. Comput..
[10] Tim Roughgarden,et al. Designing networks for selfish users is hard , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[11] Yishay Mansour,et al. Convergence Time to Nash Equilibria , 2003, ICALP.
[12] J. Nash. Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.
[13] Marios Mavronicolas,et al. A new model for selfish routing , 2004, Theor. Comput. Sci..
[14] Tim Roughgarden,et al. Stackelberg scheduling strategies , 2001, STOC '01.
[15] Ariel Orda,et al. Atomic Resource Sharing in Noncooperative Networks , 1997, Proceedings of INFOCOM '97.
[16] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[17] Marios Mavronicolas,et al. The price of anarchy for polynomial social cost , 2004, Theor. Comput. Sci..
[18] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[19] Paul G. Spirakis,et al. The structure and complexity of Nash equilibria for a selfish routing game , 2002, Theor. Comput. Sci..
[20] Paul G. Spirakis,et al. Extreme Nash Equilibria , 2003, ICTCS.
[21] Paul G. Spirakis,et al. The price of selfish routing , 2001, STOC '01.