1662 search results - page 11 / 333 » The Computational Complexity of Agent Design Problems |
SIGECOM
2004
ACM
14 years 27 days 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
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
AAAI
2010
13 years 9 months ago
2010
We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We ...
ATAL
2003
Springer
14 years 21 days ago
2003
Springer
In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical sol...
AAAI
2006
13 years 9 months ago
2006
Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in our understanding o...