A graph-theoretic approach to protect static and moving targets from adversaries

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

Volumn 1, Issue , 2010, Pages 299-306

  Dickerson, J P ^a   Simari, G I ^a   Subrahmanian, V S ^a   Kraus, Sarit ^b  

^a Institute of Advanced Computer Science   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Adversarial Reasoning; Agent Systems; Game Theory

Indexed keywords

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

ADVERSARIAL REASONING; AGENT SYSTEMS; ASSET PROTECTION; EDGE CUTS; GRAPH THEORETIC APPROACH; MOVING TARGETS; ROAD NETWORK; ROAD NETWORK DATA;

GRAPH THEORY;

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

References (17)

1. N. Agmon, S. Kraus, and G. Kaminka. Multi-robot perimeter patrol in adversarial settings. In Proc. of ICRA, pages 2339-2345, 2008.
2. X. Agmon, S. Kraus. G. Kaminka, and V. Sadov. Adversarial Uncertainty in Multi-Robot Patrol. In Proc. of IJCAI pages 1811-1817, 2009.
3. T. Bui and C. Jones. Finding good approximate vertex and edge partitions is NP-hard. Information Processing Letters, 42(3):153-159, 1992.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press, September 2001.
5. K. Cormiean. D. Morton, and R. Wood. Stochastic network interdiction. Operations Research, 46(2):184-197, 1998.
6. G. Dantzig. On the max flow min cut theorem of networks, page 227. Stanford University Press, 2003.
7. E. Dinitz. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dokl, 11(2-4):1277-1280, 1970.
8. A. Gibbons. Algorithmic graph theory. Cambridge University Press, Cambridge, Now York, 1985.
9. T. Harris and F. Ross. Fundamentals of a method for evaluating rail net capacities. Technical Report AD0093458, RAND Corporation, October 1955.
10. P. Hart, N. Nilssou, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100-107, 1968.
11. R. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
12. F. Li and G. Kollios. Real Datasets for Spatial Databases: Road Networks &: Points of Interest, 2005.
13. P. Paruchuri, M. Tambe, F. Ordonez, and S. Kraus. Security in multiagent systems by policy randomization. In Proc. of AAMAS, 2006.
14. J. Pita, M. Jain. M. Tambe. F. Ordonez, S. Kraus, and R. Magori-Cohen. Effective solutions for real-world stackelberg games: When agents must, deal with human uncertainties. In Proc. of AAMAS, 2009.
15. J. Tsai, S. Rathi. C. Kiekintveld, F. Ordonez, and M. Tambe. IRIS-A Tool for Strategic Security Allocation in Transportation Networks. In Proc. of AAMAS, pages 37-44, 2009.
16. A. Washburn and K. Wood. Two-person zero-sum games for network interdiction. Operations Research, pages 243-251, 1995.
17. R. Wood. Deterministic network interdiction. Math. and Comp. Modelling, 17(2): 1-18, 1993.