Secretary problems with inspection costs as a game

A secretary problem without recall, with given rewards and inspection costs is considered as a game of an opponent against a statistician. Probability distributions on the set of arrangements of the arrivals and randomized stopping rules are the strategies for the two players. We give a condition under which minimax strategies may be obtained in a systematic way.