Game theoretical insights in strategic patrolling: Model and algorithm in normal-form

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 403-407

  Gatti, Nicola ^a  

^a POLITECNICO DI MILANO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

GAME THEORETICAL ANALYSIS; MODEL AND ALGORITHMS; NORMAL FORM; RATIONAL AGENTS; SOLVING ALGORITHM; STATE OF THE ART; STRATEGIC INTERACTIONS;

GAME THEORY;

EID: 85051929411     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-403     Document Type: Conference Paper

References (10)

1. F. Di Giunta and N. Gatti, ‘Alternating-offers bargaining under one-sided uncertainty on deadlines’, in Proceedings of ECAI, pp. 225–229, Riva del Garda, Italy, (2006).
2. F. Di Giunta and N. Gatti, ‘Bargaining over multiple issues in finite horizon alternating-offers protocol’, Annals of Mathematics in Artificial Intelligence, 47(3-4), 251–271, (2006).
3. D. Fudenberg and J. Tirole, Game Theory, The MIT Press, Cambridge, MA, USA, 1991.
4. N. Gatti, F. Di Giunta, and S. Marino, ‘Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm’, Artificial Intelligence, 172(8-9), 1119–1157, (2008).
5. P. R. Halmos, Measure Theory, Springer, Berlin, Germany, 1974.
6. C. Lemke, ‘Some pivot schemes for the linear complementarity problem’, Mathematical Programming Study, 7, 15–35, (1978).
7. N. Nisam, T. Roughgarden, E. Tardos, and V. V. Vazirani, Algorithmic Game Theory, Cambridge University Press, New York, USA, 2007.
8. P. Paruchuri, J. P. Pearce, M. Tambe, F. Ordonez, and S. Kraus, ‘An efficient heuristic approach for security against multiple adversaries’, in Proceedings of AAMAS, pp. 311–318, Honolulu, USA, (2007).
9. P. Paruchuri, M. Tambe, F. Ordonez, and S. Kraus, ‘Security in multia-gent systems by policy randomization’, in Proceedings of AAMAS, pp. 273–280, Hakodate, Japan, (2006).
10. R. Porter, E. Nudelman, and Y. Shoham, ‘Simple search methods for finding a nash equilibrium’, in Proceedings of AAAI, p. 664669, San Jose, USA, (2004).