Stochastic game of data transmission in the presence of buffers of finite capacity

The game-theoretic model of data transmission in a network of a given topology is presented. Two players (network nodes) tend to send as many random data packagesas possible to the final nodes through one common node. Each playerhas a finite capacity buffer for storing data packages. A system of costs for sending and storing data packages andrewards for the successful package delivery is introduced. A dynamic conflict-controlled process is modelled as a stochastic gamewith a finite set of states. The existence of the Nash equilibrium and a cooperative solution is proved. The cooperative solution is a strategy profile which maximizes the total expected payoff. The price of anarchy in the network is calculated. The price comparesthe players' payoffs in the Nash equilibrium and cooperative solution.