Paper Info
Title
Synergy Brittleness In Decentralized Minimax Decision Problems
Abstract
When a subset of agents achieves the optimal cost of the full system synergy is brittle. A finite horizon, decentralized, minimax decision problem is considered, necessary and sufficient conditions for synergy brittleness are derived. It is shown that synergy brittleness results in decoupled subsystems. The decoupling is used to derive necessary and sufficient conditions for a decomposition of the optimization problem. A distributed cliquing algorithm that efficiently computes the decomposition is given, and uniformly optimal policies for each subproblem are derived. The methods developed herein are applicable to the optimization of large, multiagent systems. The results are illustrated on a perimeter patrolling example.
Year
DOI
Venue
2007
10.1109/CDC.2007.4434802
PROCEEDINGS OF THE 46TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14
Keywords
Field
DocType
decision problem,multi agent systems,optimization problem
Minimax,Brittleness,Mathematical optimization,Decision problem,Computer science,Control theory,Decoupling (cosmology),Patrolling,Multi-agent system,Optimal cost,Optimization problem
Conference
ISSN
Citations 
PageRank 
0743-1546
0
0.34
References 
Authors
5
3
Name
Order
Citations
PageRank
d georgiev121.09
Pierre T. Kabamba25817.07
Dawn M. Tilbury3900123.02