Sciweavers

28821 search results - page 5461 / 5765
» Distributed and parallel systems
Sort
View
ATAL
2006
Springer
15 years 10 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
15 years 10 months ago
Learning to identify winning coalitions in the PAC model
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
Ariel D. Procaccia, Jeffrey S. Rosenschein
ATAL
2006
Springer
15 years 10 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
ATAL
2006
Springer
15 years 10 months ago
False-name-proof combinatorial auction protocol: Groves Mechanism with SubModular Approximation
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
Makoto Yokoo, Toshihiro Matsutani, Atsushi Iwasaki
ATVA
2006
Springer
114views Hardware» more  ATVA 2006»
15 years 10 months ago
Selective Approaches for Solving Weak Games
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...
Malte Helmert, Robert Mattmüller, Sven Schewe
« Prev « First page 5461 / 5765 Last » Next »