Sciweavers

1662 search results - page 1 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ICMAS
2000
13 years 8 months ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge
AAAI
1990
13 years 8 months ago
A Design Based Approach to Constructing Computational Solutions to Diagnostic Problems
Troubleshooting problems in real manufacturing environments impose constraints on admissible solutions that make the computational solutions offered by "troubleshooting from ...
D. Volovik, Imran A. Zualkernan, Paul E. Johnson, ...
AAAI
2000
13 years 8 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
TARK
2009
Springer
14 years 2 months ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets
ATAL
2003
Springer
14 years 20 days ago
Agent network topology and complexity
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
Xiaolong Jin, Jiming Liu