TY - JOUR

T1 - Network capacity management under competition

AU - Jiang, Houyuan

AU - Pang, Zhan

PY - 2011/10

Y1 - 2011/10

N2 - We consider capacity management games between airlines who transport passengers over a joint airline network. Passengers are likely to purchase alternative tickets of the same class from competing airlines if they do not get tickets from their preferred airlines. We propose a Nash and a generalized Nash game model to address the competitive network revenue management problem. These two models are based on well-known deterministic linear programming and probabilistic nonlinear programming approximations for the non-competitive network capacity management problem. We prove the existence of a Nash equilibrium for both games and investigate the uniqueness of a Nash equilibrium for the Nash game. We provide some further uniqueness and comparative statics analysis when the network is reduced to a single-leg flight structure with two products. The comparative statics analysis reveals some useful insights on how Nash equilibrium booking limits change monotonically in the prices of products. Our numerical results indicate that airlines can generate higher and more stable revenues from a booking scheme that is based on the combination of the partitioned booking-limit policy and the generalized Nash game model. The results also show that this booking scheme is robust irrespective of which booking scheme the competitor takes.

AB - We consider capacity management games between airlines who transport passengers over a joint airline network. Passengers are likely to purchase alternative tickets of the same class from competing airlines if they do not get tickets from their preferred airlines. We propose a Nash and a generalized Nash game model to address the competitive network revenue management problem. These two models are based on well-known deterministic linear programming and probabilistic nonlinear programming approximations for the non-competitive network capacity management problem. We prove the existence of a Nash equilibrium for both games and investigate the uniqueness of a Nash equilibrium for the Nash game. We provide some further uniqueness and comparative statics analysis when the network is reduced to a single-leg flight structure with two products. The comparative statics analysis reveals some useful insights on how Nash equilibrium booking limits change monotonically in the prices of products. Our numerical results indicate that airlines can generate higher and more stable revenues from a booking scheme that is based on the combination of the partitioned booking-limit policy and the generalized Nash game model. The results also show that this booking scheme is robust irrespective of which booking scheme the competitor takes.

KW - Revenue management

KW - Capacity control

KW - Generalized Nash games

KW - Existence

KW - Uniqueness

U2 - 10.1007/s10589-010-9340-8

DO - 10.1007/s10589-010-9340-8

M3 - Journal article

VL - 50

SP - 287

EP - 326

JO - Computational Optimization and Applications

JF - Computational Optimization and Applications

SN - 0926-6003

IS - 2

ER -