Multiple access game with imperfect information

We propose a model of data transmission in the network of a special topology, in which two players (nodes of the network) tend to send as many randomly appeared data packages as they can through a common node. We assume that the player does not have complete information on the number of data packages of the other player for possible transfer to the destination node. To solve the game, we propose to use cooperative and noncooperative approaches, according to which the cooperative solution and Nash equilibrium are found. To compare the players' payoffs in the cooperative solution and the Nash equilibrium, the price of anarchy is calculated.