In this paper, we consider a "satisficing" criterion to solve two-person zero-sum games with random payoffs. In particular, a player wants to maximize the payoff level he can achieve with a specified confidence. The problem reduces to solving a nonconvex mathematical programming problem. The...