163 search results - page 13 / 33 » Coalitions Among Intelligent Agents: A Tractable Case |
AAAI
2010
13 years 9 months ago
2010
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We resolve an open problem regarding the complexity of unweighted coalitional manipulation, namely, the complexity of Copeland -manipulation for {0, 1}. Copeland , 0 1, is an...
AAAI
2007
13 years 9 months ago
2007
A team of agents is jointly able to achieve a goal if despite any incomplete knowledge they may have about the world or each other, they still know enough to be able to get to a g...
25
Voted
AAAI
2000
13 years 8 months ago
2000
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...