Equilibrium in a transportation game

We study a noncooperative non‐zero‐sum m‐player transportation game associated with the operation of the queueing system M/M/m on a graph. There are m transportation companies (carriers) serving the input flow of customers (passengers) with the exponential distribution of the service time described by the parameters μ i (i = 1, 2, …,m). The input flow forms a Poisson process with an intensity matrix Λ. The problem of pricing and optimal intensity evaluation is solved for each carrier in the case of competition.