Audit games

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 41-47

  Blocki, Jeremiah ^a   Christin, Nicolas ^a   Datta, Anupam ^a   Procaccia, Ariel D ^a   Sinha, Arunesh ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC CONSIDERATIONS; INTERNAL AUDIT; NATURAL GENERALIZATION; OPTIMIZATION PROBLEMS; PERSONAL INFORMATION; QUADRATIC CONSTRAINT; SECURITY GAMES; STACKELBERG EQUILIBRIUM;

ARTIFICIAL INTELLIGENCE; DATA PRIVACY; RESOURCE ALLOCATION;

COMPUTER GAMES;

EID: 84896062422     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Gary S. Becker. Crime and punishment: An economic approach. Journal of Political Economy, 76:169, 1968.
2. Sayan Bhattacharya, Vincent Conitzer, and Kamesh Munagala. Approximation algorithm for security games with costly resources. In Proceedings of the 7th international conference on Internet and Network Economics, WINE'11, pages 13-24, Berlin, Heidelberg, 2011. Springer-Verlag.
3. Jeremiah Blocki, Nicolas Christin, Anupam Datta, and Arunesh Sinha. Audit mechanisms for provable risk management and accountable data governance. In Conference on Decision and Game Theory for Security, 2012.
4. Peter Bodik, Moises Goldszmidt, Armando Fox, Dawn B. Woodard, and Hans Andersen. Fingerprinting the datacenter: automated classification of performance crises. In Proceedings of the 5th European conference on Computer systems, EuroSys '10, 2010.
5. Vincent Conitzer and Tuomas Sandholm. Computing the optimal strategy to commit to. In ACM Conference on Electronic Commerce, 2006.
6. Deepak Garg, Limin Jia, and Anupam Datta. Policy auditing over incomplete logs: theory, implementation and applications. In ACM Conference on Computer and Communications Security, 2011.
7. W. G. Horner. A new method of solving numerical equations of all orders, by continuous approximation. Philosophical Transactions of the Royal Society of London, 109:308-335, 1819.
8. Narendra Karmarkar. A new polynomialtime algorithm for linear programming. In Symposium on the Theory of Computing, 1984.
9. Christopher Kiekintveld, Manish Jain, Jason Tsai, James Pita, Fernando Ordóñez, and Milind Tambe. Computing optimal randomized resource allocations for massive security games. In Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1, AAMAS '09, pages 689-696. International Foundation for Autonomous Agents and Multiagent Systems, 2009.
10. Dmytro Korzhyk, Vincent Conitzer, and Ronald Parr. Complexity of computing optimal stackelberg strategies in security resource allocation games. In AAAI Conference on Artificial Intelligence, 2010.
11. Dmytro Korzhyk, Vincent Conitzer, and Ronald Parr. Security games with multiple attacker resources. In International Joint Conference on Artifical Intelligence, pages 273-279, 2011.
12. Arjen Lenstra, Hendrik Lenstra, Jr., and Lászlo Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:515-534, 1982.
13. Arnold Neumaier. Complete search in continuous global optimization and constraint satisfaction. Acta Numerica, 13:271-369, 2004.
14. James Pita, Manish Jain, Fernando Ordóñez, Christopher Portway, Milind Tambe, Craig Western, Praveen Paruchuri, and Sarit Kraus. Armor security for los angeles international airport. In AAAI Conference on Artificial Intelligence, pages 1884-1885, 2008.
15. James Pita, Milind Tambe, Christopher Kiekintveld, Shane Cullen, and Erin Steigerwald. Guards - innovative application of game theory for national airport security. In International Joint Conference on Artifical Intelligence, pages 2710-2715, 2011.
16. Arnold Schönhage. The fundamental theorem of algebra in terms of computational complexity. Technical report, University of Tübingen, 1982.
17. Milind Tambe. Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned. Cambridge University Press, 2011.
18. Jeffrey A. Vaughan, Limin Jia, Karl Mazurak, and Steve Zdancewic. Evidence-based audit. In Computer Security Foundations, pages 177-191, 2008.
19. H. von Stackelberg. Marktform und Gleichgewicht. - Wien & Berlin: Springer 1934. VI, 138 S. 8. J. Springer, 1934.
20. Xia Zhao and Eric Johnson. Information governance: Flexibility and control through escalation and incentives. In Workshop on the Economics of Information Security, 2008.
21. Alice X. Zheng, Ben Liblit, and Mayur Naik. Statistical debugging: simultaneous identification of multiple bugs. In ICML 06: Proceedings of the 23rd international conference on Machine learning, pages 1105- 1112, 2006.