Josh Letchford Department of Computer Science Duke University Phone: (919) 660-6589 Office: D330 LSRC Email: jcl [at] cs [dot] duke [dot] edu

Research Interests: Game Theory, Solution Concepts, Stackelberg Games, Games on Networks.

PUBLICATIONS

Joshua Letchford and Yevgeniy Vorobeychik. Computing Randomized Security Strategies in Networked Domains. Workshop on Applied Adversarial Reasoning and Risk Modeling (AARM) at AAAI 2011, San Francisco, CA, 2011.

Vincent Conitzer, Nicole Immorlica, Joshua Letchford, Kamesh Munagala, and Liad Wagman. False-Name-Proofness in Social Networks. In the Sixth Workshop on Internet and Network Economics (WINE-10), pp. 209-221, Stanford, CA, 2010.

Joshua Letchford and Vincent Conitzer. Computing Optimal Strategies to Commit to in Extensive-Form Games. In Proceedings of the Eleventh ACM Conference on Electronic Commerce (EC-10), pp. 83-92, Cambridge, MA, USA, 2010.

Joshua Letchford, Vincent Conitzer, and Kamesh Munagala. Learning and Approximating the Optimal Strategy to Commit To. In the Second International Symposium on Algorithmic Game Theory (SAGT-09), pp. 250-262, Paphos, Cyprus, 2009. Full version with appendices.

Joshua Letchford, Vincent Conitzer, and Kamal Jain. An "Ethical" Game-Theoretic Solution Concept for Two-Player Perfect-Information Games. In Proceedings of the Fourth Workshop on Internet and Network Economics (WINE-08), pp. 696-707, Shanghai, China, 2008. Full version with appendices.