Computing optimal randomized resource allocations for massive security games

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Christopher Kiekintveld University of Southern California, Los Angeles, CA
Manish Jain University of Southern California, Los Angeles, CA
Jason Tsai University of Southern California, Los Angeles, CA
James Pita University of Southern California, Los Angeles, CA
Fernando Ordóñez University of Southern California, Los Angeles, CA
Milind Tambe University of Southern California, Los Angeles, CA
Computing optimal randomized resource allocations for massive security games 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 25
· Downloads (cumulative): 206
· Citation Count: 29

Published in:
Cover Image
 
· Proceeding
AAMAS '09 Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Pages 689-696
International Foundation for Autonomous Agents and Multiagent Systems Richland, SC ©2009
table of contents ISBN: 978-0-9817381-6-1

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder