What is recorded here?
Defined decentralized Markov decision-process models and established NEXP-completeness or hardness results for finite-horizon decentralized control under the paper's formal assumptions.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
The record is the exact four-author 2002 journal article. Its complexity classifications apply to the specified Dec-MDP and Dec-POMDP formulations; they are not a planning algorithm, an empirical performance claim or a result for every multi-agent model.
Read the original work
- INFORMS page for decentralized-control complexity paper
- UMass-hosted Bernstein decentralized-control paper
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Daniel S. Bernstein; Robert Givan; Neil Immerman; Shlomo Zilberstein
The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.
Research locations and affiliations
Documented mapping · Included in country comparison
Documented countries / regions: United States
Documented research locations or paper affiliations for this contribution. Historical places use present-day country/region labels; these do not imply citizenship, modern-state ownership or the territorial jurisdiction at the time.
English catalogue narrative
Bernstein and colleagues: complexity of decentralized control
Defined decentralized Markov decision-process models and established NEXP-completeness or hardness results for finite-horizon decentralized control under the paper's formal assumptions.
Scientific scope
The record is the exact four-author 2002 journal article. Its complexity classifications apply to the specified Dec-MDP and Dec-POMDP formulations; they are not a planning algorithm, an empirical performance claim or a result for every multi-agent model.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Daniel S. Bernstein; Robert Givan; Neil Immerman; Shlomo Zilberstein
The named authors contributed to this scoped work; individual effort shares and later applications are not assigned by the byline.