Path disruption games

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 2, Issue , 2010, Pages 1123-1130

  Bachrach, Yoram ^a   Porat, Ely ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Computational complexity; Cooperative Game Theory; Power indices; Vertex Cut

Indexed keywords

AUTONOMOUS AGENTS; COMPUTATIONAL COMPLEXITY; GAME THEORY; MULTI AGENT SYSTEMS;

COLLABORATION BETWEEN AGENTS; COOPERATIVE GAME; COOPERATIVE GAME THEORY; CRITICAL LOCATION; GRAPH DISCONNECTS; INTERMEDIATE NODE; POWER INDICES; VERTEX-CUT;

TREES (MATHEMATICS);

EID: 79960566162     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. N. Agmon, V. Sadov, G. A. Kaminka, and S. Kraus. The impact of adversarial knowledge on adversarial planning in perimeter patrol. In AAMAS (1), pages 55-62, 2008.
2. Y. Bachrach, E. Markakis, A. D. Procaccia, J. S. Rosenschein, and A. Saberi. Approximating power indices. In AAMAS (2), pages 943-950, 2008.
3. Y. Bachrach and J. S. Rosenschein. Coalitional skill games. In AAMAS 2008, pages 1023-1030, Estoril, Portugal, May 2008.
4. Y. Bachrach and J. S. Rosenschein. Power in threshold network flow games. Autonomous Agents and Multi-Agent Systems, 18(1):106-132, 2009.
5. Y. Bachrach, J. S. Rosenschein, and E. Porat. Power and stability in connectivity games. In The Seventh International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), pages 999-1006, Estoril, Portugal, May 2008.
6. J. F. Banzhaf. Weighted voting doesn't work: a mathematical analysis. Rutgers Law Review, 19:317-343, 1965.
7. X. Deng and C. H. Papadimitriou. On the complexity of cooperative solution concepts. Math. Oper. Res., 19(2):257-266, 1994.
8. E. Elkind, L. A. Goldberg, P. W. Goldberg, and M. Wooldridge. A tractable and expressive class of marginal contribution nets and its applications. In AAMAS 2008. IFAAMAS, 2008.
9. S. S. Fatima, M. Wooldridge, and N. R. Jennings. A linear approximation method for the shapley value. Artif. Inteli, 172(14):1673-1699, 2008.
10. J. Feigenbaum, C. H. Papadimitriou, and S. Shenker. Sharing the cost of multicast transmissions. Journal of Computer and System Sciences, 63(1):21-41, 2001.
11. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NF'-Completeness. W. H. Freeman and Co., 1979.
12. D. B. Gillies. Some theorems on n-person games. PhD thesis, Princeton University, 1953.
13. I. Mann and L. S. Shapley. Values of large games, IV: Evaluating the electoral college by Monte-Carlo techniques. Technical report, The Rand Corporation, Santa Monica, CA, 1960.
14. M. Maschler, B. Peleg, and L. S. Shapley. Geometrie properties of the kernel, nucleolus, and related solution concepts. Mathematics of Operations Research, 4(4):303-338, 1979.
15. Y. Matsui and T. Matsui. A survey of algorithms for calculating power indices of weighted majority games. J. Operations Research Society of Japan, 43, 2000.
16. Y. Matsui and T. Matsui. NP-completeness for calculating power indices of weighted majority games. Theoretical Computer Science, 263(1-2), 2001.
17. M. Osborne and A. Rubinstein. A course in game theory. MIT press, 1999.
18. J. Pita, M. Jain, J. Marecki, F. Ordonez, C. Portway, M. Tambe, C. Western, P. Paruchuri, and S. Kraus. Deployed armor protection: the application of a game theoretic model for security at the los angeles international airport. In AAMAS (Industry Track), pages 125-132, 2008.
19. J. Pita, M. Jain, F. Ordonez, C. Portway, M. Tambe, C. Western, P. Paruchuri, and S. Kraus. Armor security for los angeles international airport. In AAAI, pages 1884-1885, 2008.
20. E. Resnick, Y. Bachrach, R. Meir, and J. Rosenschein. The cost of stability in network flow games. In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009, page 650. Springer, 2009.
21. D. Schmeidler. The nucleolus of a characteristic function game. SIAM Journal on Applied Mathematics, pages 1163-1170, 1969.
22. L. S. Shapley and M. Shubik. A method for evaluating the distribution of power in a committee system. American Political Science Review, 48:787-792, 1954.
23. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8:410-421, 1979.