Scientific publications

This paper considers a noncooperative transport game of n players on a communication graph. Here players are passenger transportation companies (carriers). Service requests form a Poisson process with an intensity rate matrix Λ. Players announce prices for their services and passengers choose an appropriate service by minimizing their individual costs (the ticket price and the expected service time). For each carrier, we solve the pricing problem and define the equilibrium intensity flows in the conditions of competition. A special emphasis is placed on polynomial latency functions.