dblp.uni-trier.dewww.uni-trier.de

Kate Larson

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
25 Iyad Rahwan, Kate Larson: Pareto Optimality in Abstract Argumentation. AAAI 2008: 150-155
24EEIyad Rahwan, Kate Larson: Mechanism design for abstract argumentation. AAMAS (2) 2008: 1031-1038
23EEGreg Hines, Kate Larson: Using adaptive consultation of experts to improve convergence rates in multiagent learning. AAMAS (3) 2008: 1337-1340
22EEJie Zhang, Robin Cohen, Kate Larson: A Trust-Based Incentive Mechanism for E-Marketplaces. AAMAS-TRUST 2008: 135-161
21EEGreg Hines, Kate Larson: Learning When to Take Advice: A Statistical Test for Achieving A Correlated Equilibrium. UAI 2008: 274-281
2007
20EEYunqi Zhang, Kate Larson: Reducing Interaction Costs for Self-interested Agents. AMEC/TADA 2007: 166-181
19EEKate Larson: Reducing Costly Information Acquisition in Auctions. Computational Social Systems and the Internet 2007
2006
18EEKate Larson: Reducing costly information acquisition in auctions. AAMAS 2006: 1167-1174
17EEElodie Fourquet, Kate Larson, William Cowan: A reputation mechanism for layered communities. SIGecom Exchanges 6(1): 11-22 (2006)
2005
16EEKate Larson, Tuomas Sandholm: Mechanism design and deliberative agents. AAMAS 2005: 650-656
15EEShahram 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
13EEKate Larson, Tuomas Sandholm: Experiments on Deliberation Equilibria in Auctions. AAMAS 2004: 394-401
12EEKate Larson, Tuomas Sandholm: Strategic deliberation and truthful revelation: an impossibility result. ACM Conference on Electronic Commerce 2004: 264-265
11EEKate Larson, Tuomas Sandholm: Designing Auctions for Deliberative Agents. AMEC 2004: 87-100
2003
10EEKate Larson, Tuomas Sandholm: Miscomputing ratio: social cost of selfish computing. AAMAS 2003: 273-280
2002
9EEKate Larson, Tuomas Sandholm: An alternating offers bargaining model for computationally limited agents. AAMAS 2002: 135-142
8EEKate Larson, Tuomas Sandholm: Bidders with hard valuation problems. AAMAS 2002: 160-161
2001
7EEKate 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
4EEKate Larson, Tuomas Sandholm: Anytime Coalition Structure Generation: An Average Case Study. Agents 1999: 40-47
3EETuomas 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
1EETuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohmé: Anytime Coalition Structure Generation with Worst Case Guarantees CoRR cs.MA/9810005: (1998)

Coauthor Index

1Martin Andersson [1] [2] [3]
2Robin Cohen [22]
3William Cowan [17]
4Shahram Esmaeilsabzali [15]
5Elodie Fourquet [17]
6Greg Hines [21] [23]
7Iyad Rahwan [24] [25]
8Tuomas Sandholm [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [16]
9Onn Shehory [1] [2] [3]
10Fernando A. Tohmé (Fernando Tohmé) [1] [2] [3]
11Jie Zhang [22]
12Yunqi Zhang [20]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)