Full-information best-choice game with two stops

We consider a full-information best-choice game in which each player wants to hire two secretaries. The aim of a player is to maximize the sum of expected applicant' quality values. Two models are considered: m-person best-choice game with the possibility of an applicant refusing an offer and two-person best-choice game with dominant player. The optimal strategies are received. We prove that in the best-choice game with the possibility of an applicant refusing an offer the players' payoffs don't depend on total number of players in the game.