Sciweavers

7 search results - page 1 / 2
» Tractable negotiation in tree-structured domains
Sort
View
ECAI
2008
Springer
13 years 6 months ago
Hybrid tractable CSPs which generalize tree structure
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
Martin C. Cooper, Peter G. Jeavons, András ...
ATAL
2006
Springer
13 years 8 months ago
Tractable negotiation in tree-structured domains
Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high co...
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
ECAI
2004
Springer
13 years 10 months ago
Tractability Results for Automatic Contracting
Abstract. Automated negotiation techniques have received considerable attention over the past decade, and much progress has been made in developing negotiation protocols and strate...
Paul E. Dunne, Michael Laurence, Michael Wooldridg...
COLLABORATION
1999
Springer
13 years 9 months ago
A Service-Oriented Negotiation Model between Autonomous Agents
Abstract. We present a formal model of negotiation between autonomous agents. The purpose of the negotiation is to reach an agreement about the provision of a service by one agent ...
Carles Sierra, Peyman Faratin, Nicholas R. Jenning...
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
13 years 9 months ago
Boosting Active Learning to Optimality: A Tractable Monte-Carlo, Billiard-Based Algorithm
Abstract. This paper focuses on Active Learning with a limited number of queries; in application domains such as Numerical Engineering, the size of the training set might be limite...
Philippe Rolet, Michèle Sebag, Olivier Teyt...