Distributed Algorithms for DCOP: A Graphical-Game-Based Approach
暂无分享,去创建一个
[1] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[2] L. Shapley,et al. Potential Games , 1994 .
[3] Daphne Koller,et al. Multi-agent algorithms for solving graphical games , 2002, AAAI/IAAI.
[4] Stephen Fitzpatrick,et al. Distributed Coordination through Anarchic Optimization , 2003 .
[5] Katsutoshi Hirayama,et al. Forming Coalitions for Breaking Deadlocks , 1995, ICMAS.
[6] Milind Tambe,et al. Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..
[7] R.T. Maheswaran,et al. Decentralized network resource allocation as a repeated noncooperative market game , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).
[8] M. Yokoo,et al. Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems , 1996 .
[9] Michael L. Littman,et al. Graphical Models for Game Theory , 2001, UAI.
[10] Weixiong Zhang,et al. An analysis and application of distributed constraint satisfaction and optimization algorithms in sensor networks , 2003, AAMAS '03.
[11] R.T. Maheswaran,et al. Multi-user flow control as a Nash game: performance of various algorithms , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).
[12] Makoto Yokoo,et al. An asynchronous complete method for distributed constraint optimization , 2003, AAMAS '03.
[13] Makoto Yokoo,et al. The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..