Algorithms for interdependent security games

Advances in Neural Information Processing Systems

Volumn , Issue , 2004, Pages

  Kearns, Michael ^a   Ortiz, Luis E ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84899006528     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Michael Garey and David Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.
2. Geoffrey Heal and Howard Kunreuther. You only die once: Managing discrete interdependent risks. 2003. Working paper, Columbia Business School and Wharton Risk Management and Decision Processes Center.
3. M. Kearns, M. Littman, and S. Singh. Graphical models for game theory. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, pages 253-260, 2001.
4. M. Kearns and Y. Mansour. Efficient Nash computation in summarization games with bounded influence. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, 2002.
5. Howard Kunreuther and Geoffrey Heal. Interdependent security. Journal of Risk and Uncertainty (Special Issue on Terrorist Risks), 2003. In press.
6. Thomas Schelling. Micromotives and Macrobehavior. Norton, 1978.