1662 search results - page 61 / 333 » The Computational Complexity of Agent Design Problems |
IAT
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
FOCS
2008
IEEE
13 years 9 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
ATAL
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we present an online method for POMDPs, called RTBSS (Real-Time Belief Space Search), which is based on a look-ahead search to find the best action to execute at e...
AGENTS
1999
Springer
14 years 1 months ago
1999
Springer
We consider the problem of how to design large decentralized multiagent systems (MAS’s) in an automated fashion, with little or no hand-tuning. Our approach has each agent run a...