Computing game-theoretic solutions and applications to security
Publication
, Journal Article
Conitzer, V
Published in: Proceedings of the National Conference on Artificial Intelligence
November 7, 2012
The multiagent systems community has adopted game theory as a framework for the design of systems of multiple self-interested agents. For this to be effective, efficient algorithms must be designed to compute the solutions that game theory prescribes. In this paper, I summarize some of the state of the art on this topic, focusing particularly on how this line of work has contributed to several highly visible deployed security applications, developed at the University of Southern California. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.
Duke Scholars
Published In
Proceedings of the National Conference on Artificial Intelligence
Publication Date
November 7, 2012
Volume
3
Start / End Page
2106 / 2112
Citation
APA
Chicago
ICMJE
MLA
NLM
Conitzer, V. (2012). Computing game-theoretic solutions and applications to security. Proceedings of the National Conference on Artificial Intelligence, 3, 2106–2112.
Conitzer, V. “Computing game-theoretic solutions and applications to security.” Proceedings of the National Conference on Artificial Intelligence 3 (November 7, 2012): 2106–12.
Conitzer V. Computing game-theoretic solutions and applications to security. Proceedings of the National Conference on Artificial Intelligence. 2012 Nov 7;3:2106–12.
Conitzer, V. “Computing game-theoretic solutions and applications to security.” Proceedings of the National Conference on Artificial Intelligence, vol. 3, Nov. 2012, pp. 2106–12.
Conitzer V. Computing game-theoretic solutions and applications to security. Proceedings of the National Conference on Artificial Intelligence. 2012 Nov 7;3:2106–2112.
Published In
Proceedings of the National Conference on Artificial Intelligence
Publication Date
November 7, 2012
Volume
3
Start / End Page
2106 / 2112