| 2008 |
|---|
| 25 | | Iyad Rahwan,
Kate Larson:
Pareto Optimality in Abstract Argumentation.
AAAI 2008: 150-155 |
| 24 | EE | Iyad Rahwan,
Kate Larson:
Mechanism design for abstract argumentation.
AAMAS (2) 2008: 1031-1038 |
| 23 | EE | Greg Hines,
Kate Larson:
Using adaptive consultation of experts to improve convergence rates in multiagent learning.
AAMAS (3) 2008: 1337-1340 |
| 22 | EE | Jie Zhang,
Robin Cohen,
Kate Larson:
A Trust-Based Incentive Mechanism for E-Marketplaces.
AAMAS-TRUST 2008: 135-161 |
| 21 | EE | Greg Hines,
Kate Larson:
Learning When to Take Advice: A Statistical Test for Achieving A Correlated Equilibrium.
UAI 2008: 274-281 |
| 2007 |
|---|
| 20 | EE | Yunqi Zhang,
Kate Larson:
Reducing Interaction Costs for Self-interested Agents.
AMEC/TADA 2007: 166-181 |
| 19 | EE | Kate Larson:
Reducing Costly Information Acquisition in Auctions.
Computational Social Systems and the Internet 2007 |
| 2006 |
|---|
| 18 | EE | Kate Larson:
Reducing costly information acquisition in auctions.
AAMAS 2006: 1167-1174 |
| 17 | EE | Elodie Fourquet,
Kate Larson,
William Cowan:
A reputation mechanism for layered communities.
SIGecom Exchanges 6(1): 11-22 (2006) |
| 2005 |
|---|
| 16 | EE | Kate Larson,
Tuomas Sandholm:
Mechanism design and deliberative agents.
AAMAS 2005: 650-656 |
| 15 | EE | Shahram Esmaeilsabzali,
Kate Larson:
Service Allocation for Composite Web Services Based on Quality Attributes.
CEC Workshops 2005: 71-82 |
| 2004 |
|---|
| 14 | | Kate Larson,
Tuomas Sandholm:
Using Performance Profile Trees to Improve Deliberation Control.
AAAI 2004: 73-79 |
| 13 | EE | Kate Larson,
Tuomas Sandholm:
Experiments on Deliberation Equilibria in Auctions.
AAMAS 2004: 394-401 |
| 12 | EE | Kate Larson,
Tuomas Sandholm:
Strategic deliberation and truthful revelation: an impossibility result.
ACM Conference on Electronic Commerce 2004: 264-265 |
| 11 | EE | Kate Larson,
Tuomas Sandholm:
Designing Auctions for Deliberative Agents.
AMEC 2004: 87-100 |
| 2003 |
|---|
| 10 | EE | Kate Larson,
Tuomas Sandholm:
Miscomputing ratio: social cost of selfish computing.
AAMAS 2003: 273-280 |
| 2002 |
|---|
| 9 | EE | Kate Larson,
Tuomas Sandholm:
An alternating offers bargaining model for computationally limited agents.
AAMAS 2002: 135-142 |
| 8 | EE | Kate Larson,
Tuomas Sandholm:
Bidders with hard valuation problems.
AAMAS 2002: 160-161 |
| 2001 |
|---|
| 7 | EE | Kate Larson,
Tuomas Sandholm:
Bargaining with limited computation: Deliberation equilibrium.
Artif. Intell. 132(2): 183-217 (2001) |
| 2000 |
|---|
| 6 | | Kate Larson,
Tuomas Sandholm:
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems.
AAAI/IAAI 2000: 48-55 |
| 5 | | Kate Larson,
Tuomas Sandholm:
Anytime coalition structure generation: an average case study.
J. Exp. Theor. Artif. Intell. 12(1): 23-42 (2000) |
| 1999 |
|---|
| 4 | EE | Kate Larson,
Tuomas Sandholm:
Anytime Coalition Structure Generation: An Average Case Study.
Agents 1999: 40-47 |
| 3 | EE | Tuomas Sandholm,
Kate Larson,
Martin Andersson,
Onn Shehory,
Fernando Tohmé:
Coalition Structure Generation with Worst Case Guarantees.
Artif. Intell. 111(1-2): 209-238 (1999) |
| 1998 |
|---|
| 2 | | Tuomas Sandholm,
Kate Larson,
Martin Andersson,
Onn Shehory,
Fernando Tohmé:
Anytime Coalition Structure Generation with Worst Case Guarantees.
AAAI/IAAI 1998: 46-53 |
| 1 | EE | Tuomas Sandholm,
Kate Larson,
Martin Andersson,
Onn Shehory,
Fernando Tohmé:
Anytime Coalition Structure Generation with Worst Case Guarantees
CoRR cs.MA/9810005: (1998) |
