Distributed Algorithms for DCOP: A Graphical-Game-Based Approach

17th ISCA International Conference on Parallel and Distributed Computing Systems 2004, PDCS 2004

Volumn , Issue , 2004, Pages 432-439

  Maheswaran, Rajiv T ^a   Pearce, Jonathan P ^a   Tambe, Milind ^a  

^a University of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED PARAMETER CONTROL SYSTEMS; STOCHASTIC SYSTEMS;

CONSTRAINT OPTIMIZATION PROBLEMS; DETERMINISTIC ALGORITHMS; DISTRIBUTED CONSTRAINT OPTIMIZATIONS; DISTRIBUTED-CONTROL; DYNAMIC ENVIRONMENTS; GAME-BASED APPROACHES; GRAPHICAL GAMES; LARGE-SCALE DYNAMICS; MONOTONICITY PROPERTY; STOCHASTIC ALGORITHMS;

CONSTRAINED OPTIMIZATION;

EID: 84958139209     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. S. Fitzpatrick and L. Meertens. Distributed coordination through anarchic optimization. In V. Lesser, C. L. Ortiz Jr., and M. Tanibe, editors, Distributed " Sensor Networks: A Multiagent Perspective, pages 257-295. Kluwer Academic Publishers, 2003.
2. K. Hirayama and J. Toyoda. Forming coalitions for breaking deadlocks. In Proc. ICMAS, pages 155-162, 1995.
3. M. Keams, M. Littman, and S. Singh. Graphical models for game theory. In Proc. UAI, pages 253-260, 2001.
4. R. T. Maheswaran and T. Basar. Multi-user flow control as a nash game: Performance of various algorithms. In Proc. CDC, Tampa, FL, December 1998.
5. R. T. Maheswaran and T. Basar. Decentralized network resource allocation as a repeated noncoopera-tive market game. In Proc. CDC, Orlando, FL, December 2001.
6. R. T. Maheswaran, M. Tambe, E. Bowring, J. P. Pearce, and P. Varakantham. Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling. In AAMAS 2004, New York, NY, My 2004.
7. P. J. Modi, W. Shen, M. Tambe, and M. Yokoo. An asynchronous complete method for distributed constraint optimization. In Proceedings of the Second International Conference on Autonomous Agents and Multi-Agent Systems, Sydney, Australia 2003.
8. D. Monderer and L. S. Shapley. Potential games. Games and Economic Behavior, 14:124-143, 1996.
9. R. W. Rosenthal. A class of games possessing pure-stratgy nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
10. D. Vickrey and D. Koller. Multi-agent algorithms for solving graphical games. In Proc. AAAI, pages 345-351, 2002.
11. M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. The distributed constraint satisfaction problem: formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering, 10 (5) :673-685, 1998.
12. M. Yokoo and K. Hirayama. Distributed breakout algorithm for solving distributed constraint satisfaction and optimization problems. In Proc. ICMAS, pages 401-408, 1996.
13. W. Zhang, Z. Xing, G. Wang, and L. Wittenburg. An analysis and application of distributed constraint satisfaction and optimization algorithms In sensor networks. In AAMAS 2003, pages 185-192, Melbourne, Australia, July 2003.