The efficiency analysis for oligopolistic games when cost functions are non-separable

Abstract

Abstract: By deriving an upper bound of the so-called ‘price of anarchy’, this paper analyses the efficiency of oligopolistic games in networks with non-separable and asymmetric cost functions, splittable flows and fixed demands. The new bound is determined by the optimal objective function values of some optimisation problems. In particular, for some… (More)
DOI: 10.1504/IJMMNO.2010.031751

Topics

Cite this paper

@article{Han2010TheEA, title={The efficiency analysis for oligopolistic games when cost functions are non-separable}, author={Deren Han and Hai Yang and Xiaoming Yuan}, journal={IJMNO}, year={2010}, volume={1}, pages={237-257} }