A non-zero-sum no-information best-choice game (Q2386342)

A nonzero-mean game is studied. There are two players that jointly interview a given number \(n\) of applicants. The applicants present in a random order, and each such an order is equally likely. If both players accept a candidate then she is accepted, if both reject, she is rejected. If there choices are different, then an arbitration comes in and forces them to agree with player I [II] with probability \(p\) \([1-p]\). Each player minimizes his expected payoff. An explicit solution s well as numerical results are given for some \(n\) and \(p\).