nips nips2003 nips2003-19 nips2003-19-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Michael Kearns, Luis E. Ortiz
Abstract: unkown-abstract
[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.