Advertisement

Noncooperative Satellite Range Scheduling

Chapter
  • 661 Downloads
Part of the Springer Optimization and Its Applications book series (SOIA, volume 106)

Abstract

In previous work the authors have provided the first game-theoretic approach to the Satellite Range Scheduling problem, modeling the problem as a Stackelberg game and computing its equilibrium in polynomial time. Compared to previous work which focused on the perfect information case, this chapter introduces several variants of this problem with limited information, sheds some light on alternative models, and provides further insight on the relations with the centralized version of the problem. (This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).)

Keywords

Perfect Information Payoff Vector Stackelberg Game Graph Element Stackelberg Equilibrium 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgements

This research was performed while the author held a National Research Council Research Associateship Award at the Air Force Research Laboratory (AFRL).

References

  1. 1.
    C. Wang, Y. Xi, Noncooperative game theory as a unified framework for single machine scheduling, in 5 th Asian Control Conference (IEEE, Melbourne, 2004)Google Scholar
  2. 2.
    N. Immorlica, L. Li, V.S. Mirrokni, A. Schulz, Coordination mechanisms for selfish scheduling, in Workshop on Internet and Network Economics (Springer, Heidelberg, 2005)zbMATHGoogle Scholar
  3. 3.
    L. Agussurja, H.C. Lau, The price of stability in selfish scheduling games, in International Conference on Intelligent Agent Technology (IEEE, Fremont, 2007)Google Scholar
  4. 4.
    A.J. Vazquez, R.S. Erwin, Noncooperative satellite range scheduling with perfect information, in 2015 IEEE Aerospace Conference (IEEE, Big Sky, 2015)Google Scholar
  5. 5.
    T. Basar, G.J. Olsder, Dynamic Noncooperative Game Theory. Classics in Applied Mathematics (SIAM, Philadelphia, 1982)Google Scholar
  6. 6.
    B. Heydenreich, R. Müller, M. Uetz, Games and mechanism design in machine scheduling - an introduction. Prod. Oper. Manag. 16(4), 437–454 (2007)CrossRefGoogle Scholar
  7. 7.
    A. Globus, J. Crawford, J. Lohn, A. Pryor, A comparison of techniques for scheduling Earth observing satellites, in Proceedings of the Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI, San Jose, 2004)Google Scholar
  8. 8.
    L. Barbulescu, J.P. Watson, L.D. Whitley, A.E. Howe, Scheduling space-ground communications for the Air Force Satellite Control Network. J. Sched. 7(1), 7–34 (2004)CrossRefzbMATHGoogle Scholar
  9. 9.
    W.J. Wolfe, S.E. Sorensen, Three scheduling algorithms applied to the Earth observing systems domain. Manag. Sci. 46(1), 148–168 (2000)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.National Research CouncilAlbuquerqueUSA
  2. 2.Air Force Research LaboratorySpace Vehicles Directorate, KirtlandAlbuquerqueUSA

Personalised recommendations