Network games. (English) Zbl 1192.91046
Proceedings of the 36th annual ACM symposium on theory of computing (STOC 2004), Chicago, IL, USA, June 13 - 15, 2004. New York, NY: ACM Press (ISBN 1-58113-852-0). 341-342, electronic only (2004).
MSC:
| 91A43 | Games involving graphs |
| 68M10 | Network design and communication in computer systems |
| 91A80 | Applications of game theory |
References:
| [1] | E. Anshelevich, A. Dasgupta, E. Tardos, T. Wexler. Near-Optimal Network Design with Selfish Agents. Proc. 35th ACM Symposium on Theory of Computing, 2003. 10.1145/780542.780617 · Zbl 1192.68019 |
| [2] | E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. Price of Stability for Network Design with Fair Allocation of Costs. Unpublished manuscript, 2004. 10.1109/FOCS.2004.68 |
| [3] | A. Archer and É. Tardos. Frugal Path mechanisms. in SODA 2002. |
| [4] | A. Czumaj, P. Krysta, and B. Vocking. Selfish Traffic Allocation for Server Farms. In STOC, 287-296, 2002. 10.1145/509907.509952 · Zbl 1192.68033 |
| [5] | J. R. Correa, A. S. Schulz, and N. E. Stier Moses. Selfish Routing in Capacitated Networks. To appear in Mathematics of Operations Research, 2004. 10.1287/moor.1040.0098 · Zbl 1082.90009 |
| [6] | A. Czumaj and B. Vocking. Tight bounds for worst-case equilibria. In SODA, 413-420, 2002. · Zbl 1092.91508 |
| [7] | X. Deng, C. Papadimitriou and S. Safra. On the Complexity of Equilibria. In STOC 2002. 10.1145/509907.509920 |
| [8] | N. Devanur, N. Garg, R. Khandekar, V. Pandit, A. Saberi, and V. Vazirani. Price of anarchy, locality gap, and a network service provider game. Unpublished manuscript, 2004. |
| [9] | N. Devanur, C. H. Papadimitriou, A. Saberi and V. V. Vazirani. Market equilibrium via a primal-dual-type algorithm. In FOCS 2002. |
| [10] | A. Fabrikant, A. Luthra, E. Maneva, S. Papadimitriou, and S. Shenker. On a Network Creation Game. In PODC, 2003. 10.1145/872035.872088 |
| [11] | A. Fabrikant, C. Papadimitriou, K. Talwar. The complexity of pure Nash equilibria. To appear in STOC, 2004. 10.1145/1007352.1007445 |
| [12] | J. Feigenbaum, C. Papadimitriou, S. Shenker. Sharing the Cost of Multicast Transmissions. Journal of Computer and System Sciences 63 (2001), pp. 21-41. 10.1006/jcss.2001.1754 · Zbl 0996.68026 |
| [13] | J. Feigenbaum, C. Papadimitriou, R. Sami, S. Shenker. A BCG-based Mechanism for Lowest-Cost Routing. In PODC 2002. 10.1145/571825.571856 |
| [14] | E. Friedman. Genericity and Congestion Control in Selfish Routing. Unpublished manuscript, 2003. |
| [15] | E. Friedman, A. Greenwald and S. Shenker. Learning in Network Context: Experimental Results from Simulations. Games and Economic Behavior, 35:80-123, 2001. · Zbl 1028.91519 |
| [16] | E. Friedman, M. Shor, S. Shenker, and B. Sopher. Experiment on Learning with Limited Information: Non-convergence, Experimentational Cascades, and the Advantage of Being Slow. To appear in Games and Economic Behavior. |
| [17] | J. Hershberger, and S. Suri. Vickerey Prices and Shortest paths: What is an edge worth? In FOCS, 2001. |
| [18] | Shai Herzog, Scott Shenker, Deborah Estrin. Sharing the “Cost” of Multicast Trees: An Axiomatic Analysis. IEEE/ACM Transactions on Networking, Dec. 1997. 10.1109/90.650144 |
| [19] | K. Jain and V. Vazirani. Applications of Approximation Algorithms to Cooperative Games. In STOC, 2001. 10.1145/380752.380825 |
| [20] | R. Johari and J. Tsitsiklis. Efficiency loss in a network resource allocation game. Mathematics of Operations Research, to appear. 10.1287/moor.1040.0091 |
| [21] | R. Johari and J. Tsitsiklis. Routing and Peering in a Competitive Internet. Unpublished manuscript, 2004. |
| [22] | S. Kapoor and R. Garg. Auction Algorithms for Market Equilibrium. To appear in STOC, 2004. 10.1145/1007352.1007430 |
| [23] | F. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, volume 8 (1997) pages 33-37. |
| [24] | K. Kent and D. Skorin-Kapov. Population monoton cost allocation on mst’s. In Operations Research Proceedings KOI, pages 43-48, 1996. · Zbl 0865.90053 |
| [25] | E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In STACS, 404-413, 1999. · Zbl 1099.91501 |
| [26] | N. Nisan and A. Ronen. Algorithmic Mechanism Design In STOC 1999. 10.1145/301250.301287 |
| [27] | C. Papadimitriou. Algorithms, Games, and the Internet. In STOC, 749-753, 2001. 10.1145/380752.380883 · Zbl 1323.68022 |
| [28] | L. Qui, Y. R. Yang, Y. Zhang, S. Shenker. On Selfish Routing in Interner-Like Environments. In SIGCOMM, 2003. |
| [29] | T. Roughgarden. The price of anarchy is independent of the network topology. To appear in Journal of Computer and System Sciences, 2004. 10.1016/S0022-0000(03)00044-8 · Zbl 1072.68025 |
| [30] | T. Roughgarden. Stackelberg scheduling strategies. In STOC, pages 104-113, 2001. 10.1145/380752.380783 · Zbl 1323.90022 |
| [31] | T. Roughgarden and É. Tardos. How bad is selfish routing? Journal of the ACM 2002. 10.1145/506147.506153 · Zbl 1323.90011 |
| [32] | S. Suri, C. Toth, Y. Zhou. Selfish Load Balancing and Atomic Congestion Games. To appear in SPAA, 2004. 10.1145/1007912.1007941 |
| [33] | A. Vetta. Nash equilibria in competitive societies with applications to facility location, traffic routing and auctions. In FOCS, 2002. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
