Effectiveness of the nash strategies in competitive multi-team target assignment problems

Proceedings of the IEEE Conference on Decision and Control

Volumn 5, Issue , 2004, Pages 4856-4861

  Galati, David G ^a   Simaan, Marwan A ^a  

^a University of Pittsburgh   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; MATHEMATICAL MODELS; OPTIMAL CONTROL SYSTEMS; OPTIMIZATION; PERFORMANCE; PROBLEM SOLVING;

MULTI-TEAM TARGET ASSIGNMENT PROBLEMS; NASH STRATEGY; RANDOM STRATEGY; TEAM OPTIMAL STRATEGY;

GAME THEORY;

EID: 14544269088     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2004.1429566     Document Type: Conference Paper

References (15)

1. Matlin, S.M. "A Review of the Literature on the Missile-Allocation Problem" Operations Research, Vol. 18,1970, pp. 334-373.
2. Murphey, R.A. "Target-Based Weapon Target Assignment Problems. Nonlinear Assignment Problems: Algorithms and Applications Vol 7. P. M. Pardalos and L. S. Pitsoulis (Eds.), Kluwer Academic Publishers, pp.39-53, 1999.
3. Lee, Z-J. Lee, Su, S-G, and Lee C-Y, "Efficiently Solving General Weapon-Target Assignment Problem by Genetic Algorithms with Greedy Eugenics," IEEE Transactions on Systems Man and Cybernetics Part B, Vol. 33, No. 1,pp. 113-121, 2003
4. Nash, J. F, "Equilibrium Points in N-Person Games," Proc. of the Nat. Academy of Sciences, Vol. 36, 1950, pp. 48-49
5. Liu Y., Simaan, M.A. and Cruz, Jr., J. B, "An Application of Dynamic Nash Task Assignment Strategies to Multi-Team Military Air Operations," Automatica, Vol. 39, 2003, pp. 1469-1478.
6. nd IEEE Conference on Decision and Control, Maui, Hawaii, December, 2003, pp. 2872-2877.
7. nd IEEE Conference on Decision and Control, Hawaii, December, 2003.
8. Lin, S., "Computer Solution for Traveling Salesman Problem," Bell Sys. Tech Jour, Vol. 44, No. 10, 1965, pp. 3345-3369.
9. Aoki, M., Introduction to Optimization Techniques, Macmillan Company, New York, NY, 1982.
10. Rosenbrock, H. H., "An Automatic Method for Finding the Greatest of Least Value of a Function," Computer Journal, Vol. 3, 1960, pp.175-184.
11. Hooke, R. and Jeeves, T. A. "Direct Search Solution of Numerical and Statistical Problems," Jour. of ACM, Vol. 8, No. 2, 1961, pp. 212-229.
12. Kampe, A. F. Jr., "Direct Search," Comm. of ACM, Vol. 6, 1963, pp.313-314.
13. Garfinkel, R. S. and Nemhauser G.L., Integer Programming, Wiley, New York, 1972.
14. Mitten, L. G., "Branch and Bound Methods: General Formulation and Properties," Operations Research, Vol. 18, 1970, pp. 24-34.
15. Blas, E., "A Note of the Branch and Bound Principle," Operations Research, Vol. 16, 1968, pp. 442-445.