Zinovi Rabinovich, Safra Campus, Givat Ram, Claudia V. Goldman  Home/Search
Context
Related
| leibniz.cs.huji.ac...200229_uai2002.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: leibniz.cs.huji...h.php?year=2002 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The complexity of finding an optimal decentralized policy for a cooperative multi-agent system is known to be non-deterministically exponential. Agents in such a system try to maximize a single global utility function, and do not compete (Update)
Similar documents based on text: More All
0.5: Incremental and Mutual Adaptation in Multiagent Systems - Goldman, Rosenschein (Correct)
0.4: Mutual Adaptation Enhanced by Social Laws - Goldman, Rosenschein (1998) (Correct)
0.3: Multiagent Learning Systems and Expert Agents - Goldman, Rosenschein (1997) (Correct)
BibTeX entry: (Update)
@techreport{ rgr_2002,
author = {Zinovi Rabinovich and Claudia V. Goldman and Jeffrey S. Rosenschein},
title = {Non-approximability of decentralized control},
institution = {Leibniz Center for Computer Science, Hebrew University},
year = {2002},
number = {2002-29},
address = {Jerusalem},
url = {citeseer.ist.psu.edu/rabinovich02nonapproximability.html} }
Citations (may not include all citations):281 Machine Learning (context) - Watkins, Dayan - 1992
268 Dynamic programming and Markov processes (context) - Howard - 1960
242 Non-deterministic exponential time has two-prover interactiv.. - Babai, Fortnow et al. - 1991
199 Markov games as a framework for multi-agent reinforcement le.. - Littman - 1994
172 Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1992
150 Computational Complexity (context) - Papadimitriou - 1994
93 the power of multi-prover interactive protocols - Fortnow, Rompel et al. - 1994
84 Princeton University Press (context) - Bellman, Programming - 1957
84 Game Theory (context) - Owen - 1982
79 Stochastic games (context) - Shapley - 1953
47 A survey of computational complexity results in systems and .. - Blondel, Tsitsiklis - 2000
29 The complexity of Markov decision processes (context) - Papadimitriou, Tsitsiklis - 1987
24 the undecidability of probabilistic planning and infinite-ho.. - Madani, Hanks et al. - 1999
22 Alternative models for zero knowledge interactive proofs (context) - Feige - 1990
18 Models of Delayed Reinforcement Learning (context) - Watkins - 1989
[Article contains additional citations not shown here]
Documents on the same site (http://leibniz.cs.huji.ac.il/research/search.php?year=2002): More
New View Generation With a Bi-Centric Camera - Weinshall, Lee, Brodsky.. (2002) (Correct)
The Impact of InfoCenters on E-Marketplaces - Yarom, Goldman (2002) (Correct)
Hierarchical Bandwidth Sharing made Simple - Anker, Bergman, Dolev, Gelbourt (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC