Bernstein and colleagues: complexity of decentralized control

What changed

Defined Dec-MDP/Dec-POMDP decision problems and proved NEXP-level complexity under 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.

Evidence

The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. 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.

Contributors

• Daniel S. Bernstein · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.
• Robert Givan · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.
• Neil Immerman · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.
• Shlomo Zilberstein · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.

• INFORMS page for decentralized-control complexity paper
• UMass-hosted Bernstein decentralized-control paper

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction