Security in multiagent systems by policy randomization
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Bargaining over multiple issues in finite horizon alternating-offers protocol
Annals of Mathematics and Artificial Intelligence
Algorithmic Game Theory
An efficient heuristic approach for security against multiple adversaries
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
Artificial Intelligence
Alternating-Offers Bargaining under One-Sided Uncertainty on Deadlines
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Simple search methods for finding a Nash equilibrium
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Leader-follower strategies for robotic patrolling in environments with arbitrary topologies
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Computing optimal randomized resource allocations for massive security games
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Developing a Deterministic Patrolling Strategy for Security Agents
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Capturing augmented sensing capabilities and intrusion delay in patrolling-intrusion games
CIG'09 Proceedings of the 5th international conference on Computational Intelligence and Games
How to protect a city: strategic security placement in graph-based domains
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Methods and algorithms for infinite Bayesian Stackelberg security games
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Security games with interval uncertainty
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Protecting moving targets with multiple mobile resources
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
In artificial intelligence literature there is a rising interest in studying strategic interaction situations. In these situations a number of rational agents act strategically, being in competition, and their analysis is carried out by employing game theoretical tools. One of the most challenging strategic interaction situation is the strategic patrolling: a guard patrols a number of houses in the attempt to catch a rob, which, in its turn, chooses a house to rob in the attempt to be not catched by the guard. Our contribution in this paper is twofold. Firstly, we provide a critique concerning the models presented in literature and we propose a model that is game theoretical satisfactory. Secondly, by exploit the game theoretical analysis to design a solving algorithm more efficient than state-of-the-art's ones.