Intervention (Hidden)
In fall 2019, we partnered with the Army’s Human Resources Command and researchers from West Point to pilot replacing the current system of manually matching officers to bases with an algorithmic match based on the deferred acceptance algorithm (DAA; Gale and Shapley, 1962). This algorithm is the basis for the National Residency Matching Program, which matches all new doctors to hospitals in the United States every year, and for the mechanism that matches New York City public school students to school every year (Abdulkadiroğlu, Pathak, and Roth, 2005). When matches are determined using this algorithm, officers submit a rank ordered list of their preferences over positions at bases. The leadership for each hiring unit similarly submits a rank ordered list over candidates for each open position. The algorithm then uses these preferences to find a matching for which no unmatched officer-base pair would both prefer to be matched together over their assigned match.
These matching algorithms are transparent to participants, fair, and efficient to implement. They yield a match which is envy-free: if an officer is not given her first choice, then that means all other officers assigned ahead of her were preferred by that base. A benefit of this feature is that participants cannot benefit from misreporting their preferences over potential assignments.
The matching market between officers and units shares many features with a school choice problem (Abdulkadiroğlu and Sönmez, 2003). Just as students are guaranteed a spot in a public school, officers are guaranteed to match with a unit. Mirroring implementations of the deferred acceptance algorithm in school choice problems (Abdulkadiroğlu, Pathak, and Roth, 2009) this constraint is incorporated in to the algorithm by randomly imputing preferences so that within a market, every officer ranks every position and every position ranks every officer. For example, if a unit actively ranked 10 of 100 officers in a market, an imputed rank between 11 and 100 would be assigned for the 90 unranked officers. Specifically, officers were sorted into indifference classes based on their labels and then randomly assigned a ranking within this class. Human Resources Command ranked the indifference classes so that every officer in a more preferred class is imputed with a better ranking than officers in less preferred classes. Because the sorting is independent across positions, this is sometimes referred to as “multiple tiebreaking” (Abdulkadiroğlu, Pathak, and Roth, 2009). Units also had the option of giving an officer a “thumbs down” indicating that they are less preferred than unranked officers. Officers with a thumbs down were grouped into the least preferred class. An analogous imputation procedure was used to impute officers’ preferences.
This imputation is not costless. In particular, the imputation procedure does not treat any potential matches as entirely unacceptable to an officer or position. As a result, the resulting match may be unstable because an officer might prefer being unmatched (e.g. leaving the Army) to their assigned match. This is not a problem, however, if officers are actually just indifferent between unranked positions but do not view them as unacceptable. Importantly, this imputation is similar to what is done in other real-world matching markets, like school choice in New York City public schools (Abdulkadiroğlu, Pathak, and Roth, 2009).