The cost of stability in network flow games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5734 LNCS, Issue , 2009, Pages 636-650

  Resnick, Ezra ^a   Bachrach, Yoram ^b   Meir, Reshef ^a   Rosenschein, Jeffrey S ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AGENT CONTROL; COOPERATIVE GAME; EFFICIENT ALGORITHM; EMPTY CORE; FLOW NETWORK; IN-NETWORK; MAXIMAL FLOW; STABLE DISTRIBUTIONS; THRESHOLD NETWORKS;

ALGORITHMS; COMPUTATION THEORY; TRANSITION METAL COMPOUNDS;

GAME THEORY;

EID: 70349306524     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03816-7_54     Document Type: Conference Paper

References (13)

1. Bachrach, Y., Meir, R., Zuckerman, M., Rothe, J., Rosenschein, J.S.: The cost of stability in weighted voting games (extended abstract). In: The International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), Budapest, Hungary (May 2009)
2. Bachrach, Y., Rosenschein, J.S.: Power in threshold network flow games. Journal of Autonomous Agents and Multi-Agent Systems 18(1), 106-132 (2009)
3. Elkind, E., Goldberg, L.A., Goldberg, P.W., Wooldridge, M.: Computational complexity of weighted threshold games. In: The National Conference on Artificial Intelligence (AAAI), pp. 718-723. AAAI Press, Menlo Park (2007)
4. Elkind, E., Goldberg, L.A., Goldberg, P.W., Wooldridge, M.: A tractable and expressive class of marginal contribution nets and its applications. In: The International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 1007-1014 (2008)
5. Elkind, E., Pasechnik, D.V.: Computing the nucleolus of weighted voting games. In: The ACM-SIAM Symposium on Discrete Algorithms, SODA (2009)
6. Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics 8, 399-404 (1956)
7. Gillies, D.B.: Some theorems on n-person games. PhD thesis. Princeton University, Princeton (1953)
8. Kalai, E., Zemel, E.: On totally balanced games and games of flow. Discussion Papers 413, Northwestern University (January 1980)
9. Kalai, E., Zemel, E.: Generalized network problems yielding totally balanced games. Operations Research 30, 998-1008 (1982)
10. Monderer, D., Tennenholtz, M.: K-implementation. In: EC 2003: Proceedings of the 4th ACM conference on electronic commerce, pp. 19-28. ACM, New York (2003)
11. Schmeidler, D.: The nucleolus of a characteristic function game. SIAM Journal on Applied Mathematics 17(6), 1163-1170 (1969)
12. Shapley, L.S.: A value for n-person games. Contributions to the Theory of Games, 31-40 (1953)
13. Yokoo, M., Conitzer, V., Sandholm, T., Ohta, N., Iwasaki, A.: Coalitional games in open anonymous environments. In: The National Conference on Artificial Intelligence (AAAI), pp. 509-515 (2005)