163 search results - page 19 / 33 » Coalitions Among Intelligent Agents: A Tractable Case |
AAAI
1993
13 years 8 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
FLAIRS
2007
13 years 9 months ago
2007
This paper addresses the issue of learning from communication among agents that work in the same domain, are capable of learning from examples, and communicate using an argumentat...
AAAI
2010
13 years 9 months ago
2010
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...