Optimal stopping games where players have weighted privilege

Abstract

A non-zero-sum n-stage game version of a full-information best-choice problem under expected net value (ENV) maximization is analyzed and the solutions are obtained in some special cases of 2-person and 3-person games. The essential feature contained in this multistage game is the fact that the players have their own weights by which at each stage one player’s desired decision is preferred to the opponent’s one by drawing a lottery.