A Fast Algorithm for Unit Level Team Resource Allocation in a Game Environment

Proceedings of the IEEE Conference on Decision and Control

Volumn 3, Issue , 2003, Pages 2872-2877

  Galati, David ^a   Liu, Yong ^a   Simaan, Marwan A ^a  

^a University of Pittsburgh   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; FUNCTIONS; GAME THEORY; MONTE CARLO METHODS; RESOURCE ALLOCATION;

NASH STRATEGY; OBJECTIVE FUNCTIONS;

CONTROL SYSTEM ANALYSIS;

EID: 1542318568     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Nash, J. F, "Equilibrium Points in N-Person Games," Proc. of the Nat. Academy of Sciences, Vol. 36, 1950, pp. 48-49.
2. Starr A.W., and Ho, Y.C., "Nonzero-Sum Differential Games", Journal of Optimization Theory and Applications, Vol.3, No.3, 1969, pp.184-206.
3. J. B. Cruz, Jr., M. A. Simaan, A. Gacic, H. Jiang, B. Letellier, M. Li, and Y. Liu "Game- Theoretic Modeling and Control of Military Operations" IEEE Transactions on Aerospace and Electronic Systems, Vol. 37, No. 4, 2001, pp. 1393-1405.
4. J. B. Cruz, Jr., M. A. Simaan, A. Gacic, and Y. Liu "Moving Horizon Nash Strategies for a Military Air Operation," IEEE Transactions on Aerospace and Electronic Systems, Vol. 38, No. 3, 2002, pp. 989-999.
5. Y. Liu, M. A. Simaan, and J. B. Cruz, Jr. "An Application of Dynamic Nash Task Assignment Strategies to Multi-Team Military Air Operations," Automatica, Vol. 39, 2003, pp. 1469-1478.
6. D. Galati, Y. Liu, and M. A. Simaan, "Performance of the Unit Level Team Resource Allocation Algorithm in Non-Cooprative Team Games" in preparation.
7. Lin, S.,"Computer Solution for Traveling Salesman Problem, " Bell Sys. Tech Jour, Vol. 44, No. 10, 1965, pp. 3345-3369.
8. Aoki, M., Introduction to Optimization Techniques, The Macmillan Company, New York, NY, 1982.
9. Rosenbrock, H.H., "An Automatic Method for Finding the Greatest of Least Value of a Function," Computer Journal, Vol. 3,1960, pp. 175-184.
10. 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.
11. Kampe, A. F. Jr.,"Direct Search," Comm. of ACM, Vol. 6, 1963, pp.313-314.
12. Garfinkel, R. S. and Nemhauser G.L., Integer Programming, Wiley, New York, 1972.
13. Mitten, L. G., "Branch and Bound Methods: General Formulation and Properties," Operations Research, Vol. 18, 1970, pp. 24-34.
14. Blas, E., "A Note of the Branch and Bound Principle," Operations Research, Vol. 16, 1968, pp. 442-445.
15. nd IEEE CDC, Hawaii, December, 2003.