본문

서브메뉴

Unifying Strategic Military Force Design and Operational Warfighting: A Stochastic Game Approach
Unifying Strategic Military Force Design and Operational Warfighting: A Stochastic Game Ap...
Unifying Strategic Military Force Design and Operational Warfighting: A Stochastic Game Approach

상세정보

자료유형  
 학위논문 서양
최종처리일시  
20260202105601
ISBN  
9798265407504
DDC  
000
저자명  
McCarthy, Joseph.
서명/저자  
Unifying Strategic Military Force Design and Operational Warfighting: A Stochastic Game Approach
발행사항  
[Sl] : Georgia Institute of Technology, 2024
발행사항  
Ann Arbor : ProQuest Dissertations & Theses, 2024
형태사항  
124 p
주기사항  
Source: Dissertations Abstracts International, Volume: 87-05, Section: B.
주기사항  
Advisor: Dahan, Mathieu;White, Chelsea.
학위논문주기  
Thesis (Ph.D.)--Georgia Institute of Technology, 2024.
초록/해제  
요약Military strategic investment and operational warfighting are necessarily intertwined, yet it is quite challenging to integrate these two levels analytically. In this thesis, we provide a framework to unify these levels through stochastic games and a force design model. We start with the operational level, where we exploit the structure of military games to construct a tractable representation of the large-scale problem. Then, at the strategic level, we use this representation to evaluate strategic investment decisions.In Chapter 1, we set the stage by laying out the challenges in integrating strategic force design and operational planning. We motivate our problem by demonstrating the importance of military force design and the necessity of unifying the strategic level with the operational. We also introduce our contributions to the military decision-making domain.In Chapter 2, we consider the operational level where military leadership prepares for, and when necessary, fights armed conflicts. We develop the campaign stochastic game (CSG), a twoplayer, discounted, zero-sum stochastic game model for dynamic operational planning in military campaigns. At each stage, the players manage multiple commanders who order military actions on objectives reachable through existing supply lines. When a battle for the control of an objective occurs, its stochastic outcome depends on the actions and the enabling support provided by the control of other objectives. Each player aims to maximize the cumulative number of objectives they control, weighted by their criticality. To solve this large-scale stochastic game, we derive properties of its Markov perfect equilibria by leveraging the logistics and military operational command and control structure. We show the consequential isotonicity of the optimal value function with respect to the partially ordered state space, which in turn leads to a significant reduction of the state and action spaces. We also accelerate both Shapley's value iteration and Van der Wal's algorithm by eliminating dominated actions and investigating pure equilibria of the matrix game solved at each iteration. We demonstrate the computational value of our equilibrium results on a case study that portrays an operational-level military campaign with geopolitical implications. Our analysis reveals a complex interplay between the game's parameters and dynamics in equilibrium, resulting in new military insights for campaign analysts, operational planners, and leadership.In Chapter 3, we consider the strategic-level military force design problem, where strategic leadership must allocate military resources (assets, activities, and technologies) to man, train, and equip a future military force. We envision a future global landscape, consisting of CSGs occurring with various probabilities, that is realized after the investment is implemented. To address the challenging military force design problem, we evaluate military force designs directly in the operational context where they may be employed. To measure the effectiveness of an investment, we evaluate the force design through its CSG value. We show the isotonicity of the CSG value with respect to the partially ordered force design space, demonstrating that we only need to search the non-dominated portfolio space. We generate training data from CSGs through the accelerated Van der Wal algorithm. We then fit a regression model that yields a candidate set of military investments. To efficiently search these candidate portfolios, we introduce a screening algorithm which fixes an adversary policy and exploits the efficiency of the Markov decision process relative to the stochastic game. We develop a strategic case study that considers investing in a suite of resources with a limited budget for an uncertain global landscape. Our analysis reveals the nonlinear performance of force designs in various military campaigns, providing insights for leadership. This chapter provides a novel technique for military force designers to rapidly evaluate strategic decisions in the operational context. We conclude the thesis by summarizing our contributions and proposing avenues for future work.Together, the thesis chapters represent an original methodology to integrate military strategic and operational decision making. Strategic leadership can rely directly on the investment's warfighting effectiveness to make ideal decisions. Operational leadership can discover how their warplans are affected when new resources are introduced to their areas of responsibility. The unified framework provides the possibility for enhanced military integration between the two levels.
일반주제명  
Invasions
일반주제명  
Motivation
일반주제명  
Campaigns
일반주제명  
Geopolitics
일반주제명  
Cruise missiles
일반주제명  
Decision making
일반주제명  
Military engagements
일반주제명  
Design
일반주제명  
Linear programming
일반주제명  
Games
일반주제명  
Markov analysis
일반주제명  
Military studies
일반주제명  
Political science
기타저자  
Georgia Institute of Technology.
기본자료저록  
Dissertations Abstracts International. 87-05B.
전자적 위치 및 접속  
로그인 후 원문을 볼 수 있습니다.

MARC

 008260126s2024        us                              c    eng  d
■001000017360651
■00520260202105601
■006m          o    d                
■007cr#unu||||||||
■020    ▼a9798265407504
■035    ▼a(MiAaPQ)AAI32315979
■035    ▼a(MiAaPQ)GeorgiaTech75297
■040    ▼aMiAaPQ▼cMiAaPQ
■0820  ▼a000
■1001  ▼aMcCarthy,  Joseph.
■24510▼aUnifying  Strategic  Military  Force  Design  and  Operational  Warfighting:  A  Stochastic  Game  Approach
■260    ▼a[Sl]▼bGeorgia  Institute  of  Technology▼c2024
■260  1▼aAnn  Arbor▼bProQuest  Dissertations  &  Theses▼c2024
■300    ▼a124  p
■500    ▼aSource:  Dissertations  Abstracts  International,  Volume:  87-05,  Section:  B.
■500    ▼aAdvisor:  Dahan,  Mathieu;White,  Chelsea.
■5021  ▼aThesis  (Ph.D.)--Georgia  Institute  of  Technology,  2024.
■520    ▼aMilitary  strategic  investment  and  operational  warfighting  are  necessarily  intertwined,  yet  it  is  quite  challenging  to  integrate  these  two  levels  analytically.  In  this  thesis,  we  provide  a  framework  to  unify  these  levels  through  stochastic  games  and  a  force  design  model.  We  start  with  the  operational  level,  where  we  exploit  the  structure  of  military  games  to  construct  a  tractable  representation  of  the  large-scale  problem.  Then,  at  the  strategic  level,  we  use  this  representation  to  evaluate  strategic  investment  decisions.In  Chapter  1,  we  set  the  stage  by  laying  out  the  challenges  in  integrating  strategic  force  design  and  operational  planning.  We  motivate  our  problem  by  demonstrating  the  importance  of  military  force  design  and  the  necessity  of  unifying  the  strategic  level  with  the  operational.  We  also  introduce  our  contributions  to  the  military  decision-making  domain.In  Chapter  2,  we  consider  the  operational  level  where  military  leadership  prepares  for,  and  when  necessary,  fights  armed  conflicts.  We  develop  the  campaign  stochastic  game  (CSG),  a  twoplayer,  discounted,  zero-sum  stochastic  game  model  for  dynamic  operational  planning  in  military  campaigns.  At  each  stage,  the  players  manage  multiple  commanders  who  order  military  actions  on  objectives  reachable  through  existing  supply  lines.  When  a  battle  for  the  control  of  an  objective  occurs,  its  stochastic  outcome  depends  on  the  actions  and  the  enabling  support  provided  by  the  control  of  other  objectives.  Each  player  aims  to  maximize  the  cumulative  number  of  objectives  they  control,  weighted  by  their  criticality.  To  solve  this  large-scale  stochastic  game,  we  derive  properties  of  its  Markov  perfect  equilibria  by  leveraging  the  logistics  and  military  operational  command  and  control  structure.  We  show  the  consequential  isotonicity  of  the  optimal  value  function  with  respect  to  the  partially  ordered  state  space,  which  in  turn  leads  to  a  significant  reduction  of  the  state  and  action  spaces.  We  also  accelerate  both  Shapley's  value  iteration  and  Van  der  Wal's  algorithm  by  eliminating  dominated  actions  and  investigating  pure  equilibria  of  the  matrix  game  solved  at  each  iteration.  We  demonstrate  the  computational  value  of  our  equilibrium  results  on  a  case  study  that  portrays  an  operational-level  military  campaign  with  geopolitical  implications.  Our  analysis  reveals  a  complex  interplay  between  the  game's  parameters  and  dynamics  in  equilibrium,  resulting  in  new  military  insights  for  campaign  analysts,  operational  planners,  and  leadership.In  Chapter  3,  we  consider  the  strategic-level  military  force  design  problem,  where  strategic  leadership  must  allocate  military  resources  (assets,  activities,  and  technologies)  to  man,  train,  and  equip  a  future  military  force.  We  envision  a  future  global  landscape,  consisting  of  CSGs  occurring  with  various  probabilities,  that  is  realized  after  the  investment  is  implemented.  To  address  the  challenging  military  force  design  problem,  we  evaluate  military  force  designs  directly  in  the  operational  context  where  they  may  be  employed.  To  measure  the  effectiveness  of  an  investment,  we  evaluate  the  force  design  through  its  CSG  value.  We  show  the  isotonicity  of  the  CSG  value  with  respect  to  the  partially  ordered  force  design  space,  demonstrating  that  we  only  need  to  search  the  non-dominated  portfolio  space.  We  generate  training  data  from  CSGs  through  the  accelerated  Van  der  Wal  algorithm.  We  then  fit  a  regression  model  that  yields  a  candidate  set  of  military  investments.  To  efficiently  search  these  candidate  portfolios,  we  introduce  a  screening  algorithm  which  fixes  an  adversary  policy  and  exploits  the  efficiency  of  the  Markov  decision  process  relative  to  the  stochastic  game.  We  develop  a  strategic  case  study  that  considers  investing  in  a  suite  of  resources  with  a  limited  budget  for  an  uncertain  global  landscape.  Our  analysis  reveals  the  nonlinear  performance  of  force  designs  in  various  military  campaigns,  providing  insights  for  leadership.  This  chapter  provides  a  novel  technique  for  military  force  designers  to  rapidly  evaluate  strategic  decisions  in  the  operational  context.  We  conclude  the  thesis  by  summarizing  our  contributions  and  proposing  avenues  for  future  work.Together,  the  thesis  chapters  represent  an  original  methodology  to  integrate  military  strategic  and  operational  decision  making.  Strategic  leadership  can  rely  directly  on  the  investment's  warfighting  effectiveness  to  make  ideal  decisions.  Operational  leadership  can  discover  how  their  warplans  are  affected  when  new  resources  are  introduced  to  their  areas  of  responsibility.  The  unified  framework  provides  the  possibility  for  enhanced  military  integration  between  the  two  levels.
■590    ▼aSchool  code:  0078.
■650  4▼aInvasions
■650  4▼aMotivation
■650  4▼aCampaigns
■650  4▼aGeopolitics
■650  4▼aCruise  missiles
■650  4▼aDecision  making
■650  4▼aMilitary  engagements
■650  4▼aDesign
■650  4▼aLinear  programming
■650  4▼aGames
■650  4▼aMarkov  analysis
■650  4▼aMilitary  studies
■650  4▼aPolitical  science
■690    ▼a0389
■690    ▼a0601
■690    ▼a0454
■690    ▼a0750
■690    ▼a0796
■690    ▼a0615
■71020▼aGeorgia  Institute  of  Technology.
■7730  ▼tDissertations  Abstracts  International▼g87-05B.
■790    ▼a0078
■791    ▼aPh.D.
■792    ▼a2024
■793    ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17360651▼nKERIS▼z이  자료의  원문은  한국교육학술정보원에서  제공합니다.

미리보기

내보내기

chatGPT토론

Ai 추천 관련 도서


    신착도서 더보기
    최근 3년간 통계입니다.

    소장정보

    • 예약
    • 소재불명신고
    • 나의폴더
    • 우선정리요청
    • 비도서대출신청
    • 야간 도서대출신청
    소장자료
    등록번호 청구기호 소장처 대출가능여부 대출정보
    TF17458 전자도서 대출가능 마이폴더 부재도서신고 비도서대출신청 야간 도서대출신청

    * 대출중인 자료에 한하여 예약이 가능합니다. 예약을 원하시면 예약버튼을 클릭하십시오.

    해당 도서를 다른 이용자가 함께 대출한 도서

    관련 인기도서

    로그인 후 이용 가능합니다.