On the core of the multicommodity flow game

Decision Support Systems

Volumn 39, Issue 1, 2005, Pages 3-10

  Markakis, Evangelos ^a   Saberi, Amin ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Cooperative games; Core; Duality; Internet

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; DECISION SUPPORT SYSTEMS; GAME THEORY; POLYNOMIALS; PROBLEM SOLVING; ROUTERS;

COOPERATIVE GAMES; CORE; DUALITY; MULTICOMMODITY FLOW GAME;

INTERNET;

EID: 9544220672     PISSN: 01679236     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dss.2004.08.003     Document Type: Conference Paper

References (31)

1. O. Bondareva, The core of an n person game, Vestnik Leningrad University 13 (1962) 141-142.
2. W.C. Brainard, H.E. Scarf, How to compute equilibrium prices in 1891, Cowles Foundation Discussion Paper, 1270, 2000.
3. P. Chardaire, Facility Location Optimization and Cooperative Games. PhD Thesis, University of East-Anglia, UK (1998).
4. V. Chvatal, Linear Programming, W. H. Freeman, New York, 1983.
5. V. Conitzer, T. Sandholm. Complexity of determining non-emptiness of the core. Technical Report CS-02-137, CMU, 2002.
6. X. Deng, C. Papadimitriou, On the complexity of cooperative game solution concepts, Mathematics of Operations Research 19 (2) (1994) 257-266.
7. X. Deng, T. Ibaraki, H. Nagamochi, Algorithms and complexity in combinatorial optimization games, Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 720-729.
8. N. Devanur, A. Saberi, C. Papadimitriou, V.V. Vazirani, Market equilibrium via a primal-dual-type algorithm, Annual IEEE Symposium on the Foundations of Computer Science, 2002, pp. 389-395.
9. U. Faigle, S. Fekete, W. Hochstättler, W. Kern, On the complexity of testing membership in the core of min-cost spanning tree games, International Journal of Game Theory 26 (1997) 361-366.
10. J. Feigenbaum, S. Shenker, Distributed algorithmic mechanism design: Recent results and future directions, International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, ACM Press, 2002, pp. 1-13.
11. J. Feigenbaum, C. Papadimitriou, R. Sami, S. Shenker, A BGP-based mechanism for lowest-cost routing, Symposium on Principles of Distributed Computing, 2002, pp. 173-182.
12. N. Garg, N. Young, On-line end-to-end congestion control, Annual IEEE Symposium on the Foundations of Computer Science, 2002, pp. 303-312.
13. M. Goemans, M. Skutella, Cooperative facility location games, Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 76-85.
14. D. Granot, A generalized linear production model: a unified model, Mathematical Programming 34 (1986) 212-222.
15. K. Jain, V.V. Vazirani, Application of approximation algorithms to cooperative games, Annual Symposium on Theory of Computing, 2001, pp. 364-372.
16. E. Kalai, E. Zemel, Generalized network problems yielding totally balanced games, Operations Research 30 (1982) 998-1008.
17. F.P. Kelly, Charging and rate control for elastic traffic, European Transactions on Telecommunications 8 (1997) 33-37.
18. F.P. Kelly, V.V. Vazirani, Rate control as a market equilibrium. Personal Communication (2004).
19. F.P. Kelly, A. Maulloo, D. Tan, Rate control in communication networks: shadow prices, proportional fairness and stability, Journal of the Operational Research Society 49 (1998) 237-252.
20. S. Low, D. Lapsley, Optimization, flow control: 1. Basic algorithm and convergence, IEEE Transactions on Networking 7 (6) (1999) 861-874.
21. S. Low, F. Paganini, J. Doyle, Internet congestion control, IEEE Control Systems Magazine 22 (1) (2002 Feb.) 28-43.
22. A. Nemirovskii, A. Ben-Tal, Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, MPS-SIAM Series on Optimization (2001).
23. N. Nisan, A. Ronen, Algorithmic mechanism design, In Annual ACM Symposium on the Theory of Computing, 1999, pp. 129-140.
24. M. Osborne, A. Rubinstein, A Course in Game Theory, MIT Press, Cambridge, MA, 1994.
25. G. Owen, On the core of linear production games, Mathematical Programming 9 (1975) 358-370.
26. C.H. Papadimitriou, Algorithms, games, and the internet, Annual ACM Symposium on the Theory of Computing, 2001, pp. 749-753.
27. H. Scarf, The core of an n person game, Econometrica 35 (1) (1967) 50-69.
28. L. Shapley, On balanced sets and cores, Naval Research Logistics Quarterly 14 (1967) 453-460.
29. L. Shapley, M. Shubik, The assignment game 1: the core. International Journal of Game Theory 1 (1972) 111-130.
30. S. Shenker, Fundamental design issues for the future internet, IEEE Journal Selected Areas Communication 13 (1995) 1176-1188.
31. V. Vazirani, Approximation Algorithms, Springer-Verlag, 2001.