Using Genetic Algorithms to Represent Higher-Level Planning in Simulation Models of Conflict

Table 1

Game payoff matrix P. This shows the possible courses of action available to the planner, denoted by the rows𝑂_𝑖. The perceived set of courses of action available to the opposing forces is shown as the columns𝐸_𝑗. For each combination of 𝑂_𝑖and𝐸_𝑗, we have the payoff value 𝑃_𝑖𝑗 with a positive payoff corresponding to a gain for the planner and a negative value corresponding to a gain for the opposing forces.

	E1	E2	⋯	ES
O𝟏	P𝟏𝟏	P12	⋯	P1S
O𝟐	P𝟐𝟏	P22	⋯	P2S
⋮	⋮	⋮	⋮	⋮
O𝐌	PM𝟏	PM𝟐	⋯	PMS