A game-theoretic model for repeated helicopter allocation between two squads

Loading...
Thumbnail Image
Authors
McGowan, Jason M.
Subjects
Advisors
Lin, Kyle Y.
Date of Issue
2006-06
Date
Publisher
Monterey California. Naval Postgraduate School
Language
Abstract
A platoon commander has a helicopter to support two squads, which encounter two types of missions -- critical or routine --on a daily basis. During a mission, a squad always benefits from having the helicopter, but the benefit is greater during a critical mission than during a routine mission. Because the commander cannot verify the mission type beforehand, a selfish squad would always claim a critical mission to compete for the helicopterâ which leaves the commander no choice but to assign the helicopter at random. In order to encourage truthful reports from the squads, we design a token system that works as follows. Each squad keeps a token bank, with tokens deposited at a certain frequency. A squad must spend either 1 or 2 tokens to request the helicopter, while the commander assigns the helicopter to the squad who spends more tokens, or breaks a tie at random. The two selfish squads become players in a two-person non-zero-sum game. We find the Nash Equilibrium of this game, and use numerical examples to illustrate the benefit of the token system.
Type
Thesis
Description
Series/Report No
Department
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
xviii, 33 p. ;
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
Collections