281 search results - page 19 / 57 » A revealed preference approach to computational complexity i... |
IJCAI
2003
13 years 10 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
IJCAI
2003
2003
Towards Cooperative Negotiation for Decentralized Resource Allocation in Autonomic Computing Systems
13 years 10 months ago
Resource allocation is a key problem in autonomic computing. In this paper we use a data center scenario to motivate the need for decentralization and cooperative negotiation, and...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...