Application material:

Research statement:

• postscript (updated: December 3, 2003)
• adobe PDF (updated: December 3, 2003)

Teaching statement:

• postscript (updated: December 3, 2003)
• adobe PDF (updated: December 3, 2003)

Curriculum vitae:

• postscript (updated: March 23, 2004)
• adobe PDF (updated: March 23, 2004)

Sample Papers:

• T. Sandholm, K. Larson,  M. Andersson, O. Shehory, F. Tohme, 1999. Anytime coalition structure generation with worst case guarantees, Artificial Intelligence, 111(1-2), 209-238. (ps) (pdf)
• K. Larson and T. Sandholm, 2001. Bargaining with limited computation: Deliberation Equilibrium, Artificial Intelligence, 132(2), 183-217. (ps) (pdf)
• K. Larson and T. Sandholm, 2003. Bidders with hard valuation problems, To be submitted in January 2004 (ps) (pdf)
• This paper includes and extends results presented in the following papers.
• K. Larson and T. Sandholm, 2001, Costly valuation computation in auctions, Eighth Conference on Theoretical Aspects of Rationality and Knowledge (TARK VIII), 169-182, Siena, Italy (pdf)
• K. Larson and T. Sandholm, 2002, Bidders with hard valuation problems, poster presentation at First International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2002), Bologna, Italy.(pdf)
• K. Larson and T. Sandholm, 2003. Strategic deliberation control and truthful revelation: An impossibility result.  Under review. (ps) (pdf)

If you have any difficulty downloading any of these files, please notify me via email.

Thanks,
Kate.