An efficient heuristic approach for security against multiple adversaries
- 14 May 2007
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableFunding Information
- Acquisition Services Division (NBCHD030010)
This publication has 9 references indexed in Scilit:
- Computing the optimal strategy to commit toPublished by Association for Computing Machinery (ACM) ,2006
- Security in multiagent systems by policy randomizationPublished by Association for Computing Machinery (ACM) ,2006
- Multiple UAV cooperative search under collision avoidance and limited range communication constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Computing approximate bayes-nash equilibria in tree-games of incomplete informationPublished by Association for Computing Machinery (ACM) ,2004
- Playing large games using simple strategiesPublished by Association for Computing Machinery (ACM) ,2003
- Stackelberg scheduling strategiesPublished by Association for Computing Machinery (ACM) ,2001
- Representations and solutions for game-theoretic problemsArtificial Intelligence, 1997
- A Generalized Nash Solution for Two-Person Bargaining Games with Incomplete InformationManagement Science, 1972
- Equilibrium Points of Bimatrix GamesJournal of the Society for Industrial and Applied Mathematics, 1964