Searching for authors named "Kate Larson" – sorted by Relevance.
-
Reducing costly information acquisition in auctions. AAMAS
- Reducing Costly Information Acquisition in Auctions Extended Abstract Kate Larson Cheriton School
- Cited by 5 (0 self) – Add To MetaCart
-
Strategic deliberation and truthful revelation: An impossibility result
- Strategic Deliberation and Truthful Revelation: An Impossibility Result Kate Larson and Tuomas
- Cited by 4 (1 self) – Add To MetaCart
-
Bidders with hard valuation problems
- Bidders with Hard Valuation Problems ∗ Kate Larson KLARSON@(email omitted); Tuomas Sandholm SANDHOLM
- Cited by 1 (1 self) – Add To MetaCart
-
Designing auctions for deliberative agents
- Designing Auctions for Deliberative Agents Kate Larson and Tuomas Sandholm Computer Science
- Cited by 1 (1 self) – Add To MetaCart
-
Miscomputing Ratio: The Social Cost of Selfish Computing
- . Kate Larson and Tuomas Sandholm Computer Science Department Carnegie Mellon University 5000 Forbes Ave
- Cited by 4 (2 self) – Add To MetaCart
-
Experiments on Deliberation Equilibria in Auctions
- , New York, USA. Copyright 2004 ACM 1-58113-864-4/04/0007...$5.00 Kate Larson and Tuomas Sandholm
- Cited by 5 (1 self) – Add To MetaCart
-
Computationally Limited Agents in Auctions
- Computationally Limited Agents in Auctions Kate Larson Computer Science Department Carnegie Mellon
- Cited by 14 (11 self) – Add To MetaCart
-
Using Performance Profile Trees to Improve Deliberation Control
- for Artificial Intelligence (www.aaai.org). All rights reserved. Kate Larson and Tuomas Sandholm Computer Science
- Cited by 4 (1 self) – Add To MetaCart
-
Theory, Economics
- .O.Box 502216, Dubai, UAE Kate Larson Cheriton School of Computer Science University of Waterloo 200 University
- Add To MetaCart
-
An Alternating Offers Bargaining Model for Computationally Limited Agents
- ABSTRACT An Alternating Offers Bargaining Model for Computationally Limited Agents Kate Larson
- Cited by 20 (3 self) – Add To MetaCart

