Sciweavers

19 search results - page 1 / 4
» Matchmaking among minimal agents without a facilitator
Sort
View
AGENTS
2001
Springer
13 years 9 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
ANTSW
2010
Springer
13 years 2 months ago
Coordinating Heterogeneous Swarms through Minimal Communication among Homogeneous Sub-swarms
robotics, the agents are often assumed to be identical. In this abstract, we argue that the cooperation between swarms of different kinds of robots can enhance the capabilities of ...
Carlo Pinciroli, Rehan O'Grady, Anders Lyhne Chris...
AAAI
2006
13 years 6 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
SWARM
2008
SPRINGER
222views Optimization» more  SWARM 2008»
13 years 4 months ago
Biologically inspired redistribution of a swarm of robots among multiple sites
We present a biologically inspired approach to the dynamic assignment and reassignment of a homogeneous swarm of robots to multiple locations, which is relevant to applications lik...
M. Ani Hsieh, Ádám M. Halász,...
AAAI
2006
13 years 6 months ago
Handling Self-Interest in Groups, with Minimal Cost
In group decision-making problems that involve selfinterested agents with private information, reaching socially optimal outcomes requires aligning the goals of individuals with t...
Ruggiero Cavallo