159 search results - page 27 / 32 » Computational Complexity of Fundamental Problems in Social C... |
ATAL
2009
Springer
14 years 4 months ago
2009
Springer
In this paper we address the problem of decentralised coordination for agents that must make coordinated decisions over continuously valued control parameters (as is required in m...
ATAL
2010
Springer
13 years 11 months ago
2010
Springer
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
SIGECOM
2004
ACM
14 years 3 months ago
2004
ACM
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sh...
FECS
2006
13 years 11 months ago
2006
- In contrast to most of the senior level Artificial Intelligence (AI) courses where AI is taught in the jargon of theoretical computer science with crowd of complex matrix algebra...