Grauberger, W.; Kimms, A. - In: European Journal of Operational Research 237 (2014) 3, pp. 1008-1020
Computing optimal capacity allocations in network revenue management is computationally hard. The problem of computing exact Nash equilibria in non-zero-sum games is computationally hard, too. We present a fast heuristic that, in case it cannot converge to an exact Nash equilibrium, computes an...