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).)
Noncooperative Satellite Range Scheduling
2015-01-01
30 pages
Article/Chapter (Book)
Electronic Resource
English
Perfect Information , Payoff Vector , Stackelberg Game , Graph Element , Stackelberg Equilibrium Mathematics , Calculus of Variations and Optimal Control; Optimization , Economic Theory/Quantitative Economics/Mathematical Methods , Math Applications in Computer Science , Algorithms , Game Theory, Economics, Social and Behav. Sciences , Mathematical Applications in Computer Science
Parameter Requirements for Noncooperative Satellite Maneuver Reconstruction Using Adaptive Filters
Online Contents | 2015
|