Search the dblp DataBase

Publications of Author

1. Kate Larson, Tuomas Sandholm
   Deliberation in Equilibrium: Bargaining in Computationally Complex Problems. [Citation Graph (0, 0)][DBLP]
   AAAI/IAAI, 2000, pp:48-55 [Conf]
   
2. Kate Larson, Tuomas Sandholm
   Using Performance Profile Trees to Improve Deliberation Control. [Citation Graph (0, 0)][DBLP]
   AAAI, 2004, pp:73-79 [Conf]
   
3. Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohmé
   Anytime Coalition Structure Generation with Worst Case Guarantees. [Citation Graph (0, 0)][DBLP]
   AAAI/IAAI, 1998, pp:46-53 [Conf]
   
4. Kate Larson, Tuomas Sandholm
   Anytime Coalition Structure Generation: An Average Case Study. [Citation Graph (0, 0)][DBLP]
   Agents, 1999, pp:40-47 [Conf]
   
5. Kate Larson, Tuomas Sandholm
   Designing Auctions for Deliberative Agents. [Citation Graph (0, 0)][DBLP]
   AMEC, 2004, pp:87-100 [Conf]
   
6. Kate Larson
   Reducing costly information acquisition in auctions. [Citation Graph (0, 0)][DBLP]
   AAMAS, 2006, pp:1167-1174 [Conf]
   
7. Kate Larson, Tuomas Sandholm
   An alternating offers bargaining model for computationally limited agents. [Citation Graph (0, 0)][DBLP]
   AAMAS, 2002, pp:135-142 [Conf]
   
8. Kate Larson, Tuomas Sandholm
   Bidders with hard valuation problems. [Citation Graph (0, 0)][DBLP]
   AAMAS, 2002, pp:160-161 [Conf]
   
9. Kate Larson, Tuomas Sandholm
   Miscomputing ratio: social cost of selfish computing. [Citation Graph (0, 0)][DBLP]
   AAMAS, 2003, pp:273-280 [Conf]
   
10. Kate Larson, Tuomas Sandholm
    Experiments on Deliberation Equilibria in Auctions. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2004, pp:394-401 [Conf]
    
11. Kate Larson, Tuomas Sandholm
    Mechanism design and deliberative agents. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2005, pp:650-656 [Conf]
    
12. Kate Larson, Tuomas Sandholm
    Strategic deliberation and truthful revelation: an impossibility result. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2004, pp:264-265 [Conf]
    
13. Shahram Esmaeilsabzali, Kate Larson
    Service Allocation for Composite Web Services Based on Quality Attributes. [Citation Graph (0, 0)][DBLP]
    CEC Workshops, 2005, pp:71-82 [Conf]
    
14. Kate Larson, Tuomas Sandholm
    Bargaining with limited computation: Deliberation equilibrium. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:132, n:2, pp:183-217 [Journal]
    
15. Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohmé
    Coalition Structure Generation with Worst Case Guarantees. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:111, n:1-2, pp:209-238 [Journal]
    
16. Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohmé
    Anytime Coalition Structure Generation with Worst Case Guarantees [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
    
17. Kate Larson, Tuomas Sandholm
    Anytime coalition structure generation: an average case study. [Citation Graph (0, 0)][DBLP]
    J. Exp. Theor. Artif. Intell., 2000, v:12, n:1, pp:23-42 [Journal]
    
18. 
    Pareto Optimality in Abstract Argumentation. [Citation Graph (, )][DBLP]
    
    
19. 
    Mechanism design for abstract argumentation. [Citation Graph (, )][DBLP]
    
    
20. 
    Using adaptive consultation of experts to improve convergence rates in multiagent learning. [Citation Graph (, )][DBLP]
    
    
21. 
    Reducing Interaction Costs for Self-interested Agents. [Citation Graph (, )][DBLP]
    
    
22. 
    A Trust-Based Incentive Mechanism for E-Marketplaces. [Citation Graph (, )][DBLP]
    
    
23. 
    Mechanism design for task procurement with flexible quality of service. [Citation Graph (, )][DBLP]
    
    
24. 
    Coalitional affinity games. [Citation Graph (, )][DBLP]
    
    
25. 
    Scalable mechanism design for the procurement of services with uncertain durations. [Citation Graph (, )][DBLP]
    
    
26. 
    Sharing a reward based on peer evaluations. [Citation Graph (, )][DBLP]
    
    
27. 
    An investigation of representations of combinatorial auctions. [Citation Graph (, )][DBLP]
    
    
28. 
    Preference elicitation for risky prospects. [Citation Graph (, )][DBLP]
    
    
29. 
    Cultivating desired behaviour: policy teaching via environment-dynamics tweaks. [Citation Graph (, )][DBLP]
    
    
30. 
    Parameterizing the winner determination problem for combinatorial auctions. [Citation Graph (, )][DBLP]
    
    
31. 
    Reducing Costly Information Acquisition in Auctions. [Citation Graph (, )][DBLP]
    
    
32. 
    Exchanging Reputation Information between Communities: A Payment-Function Approach. [Citation Graph (, )][DBLP]
    
    
33. 
    Flexible Procurement of Services with Uncertain Durations using Redundancy. [Citation Graph (, )][DBLP]
    
    
34. 
    Coalitional Affinity Games and the Stability Gap. [Citation Graph (, )][DBLP]
    
    
35. 
    A Characterisation of Strategy-Proofness for Grounded Argumentation Semantics. [Citation Graph (, )][DBLP]
    
    
36. 
    Learning When to Take Advice: A Statistical Test for Achieving A Correlated Equilibrium. [Citation Graph (, )][DBLP]
    
    
37. 
    Mechanism Design for Task Procurement with Flexible Quality of Service. [Citation Graph (, )][DBLP]
    
    
38. 
    Not-So Hidden Information: Optimal Contracts for Undue Influence in E2E Voting Systems. [Citation Graph (, )][DBLP]
    
    
39. 
    Insuring Risk-Averse Agents. [Citation Graph (, )][DBLP]
    
    
40. 
    Braess's Paradox for Flows Over Time [Citation Graph (, )][DBLP]