See this document in CiteSeerX!

Washington  (Make Corrections)  
University Louis Washington School of Engineering Applied Science Sequencing ...



  Home/Search   Context   Related

 
View or download:
wustl.edu/cs/techrepo...wucs9805.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wustl.edu/cs/techreports/1998/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Task (re)allocation is a key problem in multiagent systems. Several different contract types have been introduced to be used for task reallocation: original, cluster, swap, and multiagent contracts. Instead of only using one of these contract types, they can be interleaved in a sequence of contract types. This is a powerful way of constructing algorithms that find the best solution reachable in a bounded amount of time. The experiments in this paper study how to best sequence the... (Update)

Similar documents (at the sentence level):   More
68.6%:   Sequencing of Contract Types for Anytime Task Reallocation - Andersson, Sandholm   (Correct)
25.0%:   Performance Of Leveled Commitment Protocols For Automated.. - Andersson (1998)   (Correct)
21.3%:   Contract Type Sequencing for Reallocative Negotiation - Andersson, Sandholm (2000)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Leveled Commitment Contracting among Myopic Individually.. - Andersson, Sandholm (1998)   (Correct)
0.3:   Distributed Rational Decision Making - Sandholm (1999)   (Correct)
0.2:   Contract Types for Satisficing Task Allocation: I Theoretical.. - Sandholm (1998)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ st-washington,
  author = "University In St",
  title = "Washington",
  url = "citeseer.ist.psu.edu/766195.html" }
Citations (may not include all citations):
3972   Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
494   The contract net protocol: High-level communication and cont.. (context) - Smith - 1980
278   Depth-first iterative-deepening: an optimal admissible tree .. (context) - Korf - 1985
177   An implementation of the contract net protocol based on marg.. - Sandholm - 1993
154   Empirical Methods for Artificial Intelligence (context) - Cohen - 1995
124   The Art and Science of Negotiation (context) - Raiffa - 1982
74   Analyzing the airwaves auction - McAfee, McMillan - 1996
60   Negotiation among Self-Interested Computationally Limited Ag.. (context) - Sandholm - 1996
55   Frontiers of Electronic Commerce (context) - Kalakota, Whinston - 1996
38   Constraint-directed negotiation of resource reallocations (context) - Sathi, Fox - 1989
32   Contract types for satisficing task allocation: I theoretica.. - Sandholm - 1998
26   the gains and losses of speculation in equilibrium markets - Sandholm, Ygge - 1997
24   Leveled commitment contracting among myopic individually rat.. - Andersson, Sandholm - 1997
17   Tradeoffs in Contract-Based Distributed Scheduling (context) - Sen - 1993
7   Contract types for satisficing task allocation: II experimen.. - Andersson, Sandholm - 1998
6   Contract types for optimal task allocation: II experimental .. (context) - Andersson, Sandholm - 1997
2   Contract types for optimal task allocation: I theoretical re.. (context) - Sandholm - 1997

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC