Refereed Conference and Journal Papers

Kate Larson and Tuomas Sandholm. 2004, Experiments on deliberation equilibria in auctions, To appear in AAMAS-2004, July 2004.

Kate Larson and Tuomas Sandholm. 2004, Using performance profile trees to improve deliberation control, To appear in AAAI-2004, July 2004.

Kate Larson and Tuomas Sandholm. 2004, Strategic Deliberation and Truthful Revelation: An Impossibility Result, To appear in ACM Conference on Electronic Commerce (short paper), June 2004.

Kate Larson and Tuomas Sandholm. 2003, Miscomputing Ratio: Social Cost of Selfish Computing In the proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2003), Melbourne, Australia, July 2003

Kate Larson and Tuomas Sandholm. 2002, An Alternating Offers Bargaining Model for Computationally Limited Agents. In the proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2002), Bologna, Italy, July 2002

Kate Larson and Tuomas Sandholm. 2001, Bargaining with limited computation: Deliberation equilibrium. Artificial Intelligence, 132(2): 183--217. A short, early version appeared in AAAI-2000.

Kate Larson and Tuomas Sandholm. 2001, Costly Valuation Computation in Auctions,. In the proceedings of the Eighth Conference of Theoretical Aspects of Knowledge and Rationality (TARK VIII), Siena, Italy, July 2001

Kate Larson and Tuomas Sandholm. 2000, Deliberation in Equilibrium: Bargaining in Computationally Complex Problems.In the proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000), Austin, TX, July 31--August 2.

Kate Larson and Tuomas Sandholm. 2000, Anytime Coalition Structure Generation: An Average Case Study. Journal of Theoretical and Experimental Arificial Intelligence. 12(2000), 23-42. A short version appeared in AGENTS'99

Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, and Fernando Tohmé. 1999, Anytime Coalition Structure Generation with Worst Case Guarantees. Artificial Intelligence, (111)1-2, 209-238. A short version appeared AAAI'98.

Kate Larson and Tuomas Sandholm. 1999, Anytime Coalition Structure Generation: An Average Case Study. Third International Conference on Autonomous Agents (AGENTS), pp. 40--47, Seattle, WA, May, 1999.

Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, and Fernando Tohmé. 1998, Anytime Coalition Structure Generation with Worst Case Guarantees. Fifteenth National Conference on Artificial Intelligence (AAAI), pp. 46--53, Madison, WI, July 1998.

Refereed Workshop Papers and Posters

Kate Larson and Tuomas Sandholm. 2002, Miscomputing Ratio: The Social Cost of Selfish Computing . AAAI 2002 Workshop on Game Theoretic and Decision Theoretic Agents

Kate Larson and Tuomas Sandholm. 2002, Bidders with Hard Valuation Problems . In the proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2002), Bologna, Italy, July 2002

Kate Larson and Tuomas Sandholm. 2002,Equilibrium Strategies for Bidders with Hard Valuation Problems. Stanford Institute for Theoretical Economics (SITE) Workshop on The Economics of the Internet. Stanford, June, 2002.

Kate Larson and Tuomas Sandholm. 2001, Computationally Limited Agents in Auctions. Workshop on Agent-based Approaches to B2B, Autonomous Agents 2001, Montreal, May 2001.

Thesis Proposal

Kate Larson, Mechanism Design for Computationally Bounded Agents, April 8, 2002.

Invited Talks

Strategic Information Acquisition and Auctions, Aladdin Workshop on Auction Theory and Practice, Carnegie Mellon University, November 7-8, 2003.

Bidding Agents with Hard Valuation Problems, In Software agents for automated decisionmaking, INFORMS 2003, Atlanta, GA, October 2003.

Equilibrium Strategies for Bidders with Hard Valuation Problems. Dagstuhl Workshop on Electronic Market Design, Germany, June 2002.

Recent Submissions