Abstract
In a repeated n–person nonzero–sum game with an incomplete information structure, taking into account social motives of players, we consider an information operation problem by an information-dominant player. We formulate this problem and derive the optimal subjective information operation and subjective Nash equilibrium strategies of all players.A numerical example is given to explain these concepts.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have