Sciweavers

214 search results - page 21 / 43
» atal 2006
Sort
View
ATAL
2006
Springer
14 years 1 months ago
Learning against multiple opponents
We address the problem of learning in repeated N-player (as opposed to 2-player) general-sum games. We describe an extension to existing criteria focusing explicitly on such setti...
Thuc Vu, Rob Powers, Yoav Shoham
ATAL
2006
Springer
14 years 1 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
ATAL
2006
Springer
14 years 1 months ago
Reducing costly information acquisition in auctions
Most research on auctions assumes that potential bidders have private information about their willingness to pay for the item being auctioned, and that they use this information s...
Kate Larson
ATAL
2006
Springer
14 years 1 months ago
Learning the required number of agents for complex tasks
Coordinating agents in a complex environment is a hard problem, but it can become even harder when certain characteristics of the tasks, like the required number of agents, are un...
Sébastien Paquet, Brahim Chaib-draa
ATAL
2006
Springer
14 years 1 months ago
Negotiating efficient outcomes over multiple issues
It is difficult to reach optimal outcomes in bilateral negotiations with multiple issues when the agents' preferences and priorities of the issues are not common knowledge. S...
Sabyasachi Saha, Sandip Sen