We consider a repeated n-person nonzero-sum game with a stopping probability depending on strategies of players in the previous period. Introducing an incomplete information structure with respect to the stopping probability, we consider an information operation problem by the superior player and give the solving method. Furthermore we show that it is profitable to teach the opponents a little information, but unprofitable to teach too much information.
