Network games
暂无分享,去创建一个
[1] Scott Shenker,et al. An experiment on learning with limited information: nonconvergence, experimentation cascades, and the advantage of being slow , 2004, Games Econ. Behav..
[2] Joan Feigenbaum,et al. A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.
[3] Tim Roughgarden,et al. The price of anarchy is independent of the network topology , 2002, STOC '02.
[4] Vijay V. Vazirani,et al. Applications of approximation algorithms to cooperative games , 2001, STOC '01.
[5] Subhash Suri,et al. Vickrey prices and shortest paths: what is an edge worth? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[6] Berthold Vöcking,et al. Selfish traffic allocation for server farms , 2002, STOC '02.
[7] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[8] Frank Kelly,et al. Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..
[9] Nikhil R. Devanur,et al. Market equilibrium via a primal-dual-type algorithm , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[10] Rahul Garg,et al. Auction algorithms for market equilibrium , 2004, STOC '04.
[11] R. Johari,et al. Routing and peering in a competitive Internet , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).
[12] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[13] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.
[14] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[15] Éva Tardos,et al. Frugal path mechanisms , 2002, SODA '02.
[16] Scott Shenker,et al. Learning in Network Contexts: Experimental Results from Simulations , 2001, Games Econ. Behav..
[17] Deborah Estrin,et al. Sharing the “cost” of multicast trees: an axiomatic analysis , 1995, SIGCOMM '95.
[18] John N. Tsitsiklis,et al. Efficiency loss in a network resource allocation game: the case of elastic supply , 2004, IEEE Transactions on Automatic Control.
[19] Éva Tardos,et al. Near-optimal network design with selfish agents , 2003, STOC '03.
[20] Adrian Vetta,et al. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[21] Tim Roughgarden,et al. The Price of Stability for Network Design with Fair Cost Allocation , 2004, FOCS.
[22] Xiaotie Deng,et al. On the complexity of equilibria , 2002, STOC '02.
[23] Joan Feigenbaum,et al. A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.
[24] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[25] José R. Correa,et al. Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks , 2022 .
[26] Nikhil R. Devanur,et al. Price of Anarchy, Locality Gap, and a Network Service Provider Game , 2005, WINE.
[27] Tim Roughgarden,et al. Stackelberg scheduling strategies , 2001, STOC '01.
[28] E.J. Friedman,et al. Genericity and congestion control in selfish routing , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).
[29] Joan Feigenbaum,et al. Sharing the Cost of Multicast Transmissions , 2001, J. Comput. Syst. Sci..
[30] Christos H. Papadimitriou,et al. Algorithms, Games, and the Internet , 2001, ICALP.
[31] Yin Zhang,et al. On selfish routing in Internet-like environments , 2003, IEEE/ACM Transactions on Networking.
[32] Csaba D. Tóth,et al. Selfish Load Balancing and Atomic Congestion Games , 2004, SPAA '04.