An Evolutionary Game-Based Mechanism for Routing P2P Network Flow among Selfish Peers
暂无分享,去创建一个
[1] Azer Bestavros,et al. Selfish Overlay Network Creation and Maintenance , 2011, IEEE/ACM Transactions on Networking.
[2] Tim Roughgarden,et al. Selfish routing and the price of anarchy , 2005 .
[3] Elias Koutsoupias,et al. The price of anarchy of finite congestion games , 2005, STOC '05.
[4] Stefan Schmid,et al. On the topologies formed by selfish peers , 2006, PODC '06.
[5] Jörgen W. Weibull,et al. Evolutionary Game Theory , 1996 .
[6] José R. Correa,et al. Network Games with Atomic Players , 2006, ICALP.
[7] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[8] Tim Roughgarden,et al. Selfish routing with atomic players , 2005, SODA '05.
[9] Tim Roughgarden,et al. On the severity of Braess's Paradox: Designing networks for selfish users is hard , 2006, J. Comput. Syst. Sci..
[10] Abraham Silberschatz,et al. P4p: provider portal for applications , 2008, SIGCOMM '08.
[11] David K. Y. Yau,et al. Incentive and service differentiation in P2P networks: a game theoretic approach , 2006, TNET.