A linear programming approach to solving bilinear programmes
Mathematical Programming: Series A and B
Fast algorithms for finding randomized strategies in game trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A complementarity approach to a quasistatic multi-rigid-body contact problem
Computational Optimization and Applications
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Neuro-Dynamic Programming
Sequential Optimality and Coordination in Multiagent Systems
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
The Complexity of Decentralized Control of Markov Decision Processes
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Transition-independent decentralized markov decision processes
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Algorithms for partially observable markov decision processes
Algorithms for partially observable markov decision processes
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Decentralized Markov Decision Processes with Event-Driven Interactions
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Communication for Improving Policy Computation in Distributed POMDPs
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Exploiting structure in decentralized markov decision processes
Exploiting structure in decentralized markov decision processes
Formal models and algorithms for decentralized decision making under uncertainty
Autonomous Agents and Multi-Agent Systems
Anytime coordination using separable bilinear programs
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Interaction structure and dimensionality reduction in decentralized MDPs
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Solving transition independent decentralized Markov decision processes
Journal of Artificial Intelligence Research
Communication-based decomposition mechanisms for decentralized MDPs
Journal of Artificial Intelligence Research
Average-reward decentralized Markov decision processes
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Memory-bounded dynamic programming for DEC-POMDPs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Taming decentralized POMDPs: towards efficient policy computation for multiagent settings
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Offline Planning for Communication by Exploiting Structured Interactions in Decentralized MDPs
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
An investigation into mathematical programming for finite horizon decentralized POMDPs
Journal of Artificial Intelligence Research
Decentralized monitoring of distributed anytime algorithms
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Robust online optimization of reward-uncertain MDPs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Producing efficient error-bounded solutions for transition independent decentralized mdps
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hi-index | 0.00 |
Multiagent planning and coordination problems are common and known to be computationally hard. We show that a wide range of two-agent problems can be formulated as bilinear programs. We present a successive approximation algorithm that significantly outperforms the coverage set algorithm, which is the state-of-the-art method for this class of multiagent problems. Because the algorithm is formulated for bilinear programs, it is more general and simpler to implement. The new algorithm can be terminated at any time and-unlike the coverage set algorithm-it facilitates the derivation of a useful online performance bound. It is also much more efficient, on average reducing the computation time of the optimal solution by about four orders of magnitude. Finally, we introduce an automatic dimensionality reduction method that improves the effectiveness of the algorithm, extending its applicability to new domains and providing a new way to analyze a subclass of bilinear programs.