File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1504/IJMMNO.2010.031751
- Scopus: eid_2-s2.0-79954989473
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: The efficiency analysis for oligopolistic games when cost functions are non-separable
Title | The efficiency analysis for oligopolistic games when cost functions are non-separable |
---|---|
Authors | |
Keywords | PoA System optimum Price of anarchy Equilibrium Non-separable Oligopolistic games |
Issue Date | 2010 |
Citation | International Journal of Mathematical Modelling and Numerical Optimisation, 2010, v. 1, n. 3, p. 237-257 How to Cite? |
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 special cases, the bound turns out to be explicit in the sense that it is representable explicitly by the number of players, and the constants measuring the degree of asymmetry and non-linearity of the cost function. Copyright © 2010 Inderscience Enterprises Ltd. |
Persistent Identifier | http://hdl.handle.net/10722/250969 |
ISSN | 2020 SCImago Journal Rankings: 0.195 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Han, Deren | - |
dc.contributor.author | Yang, Hai | - |
dc.contributor.author | Yuan, Xiaoming | - |
dc.date.accessioned | 2018-02-01T01:54:13Z | - |
dc.date.available | 2018-02-01T01:54:13Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | International Journal of Mathematical Modelling and Numerical Optimisation, 2010, v. 1, n. 3, p. 237-257 | - |
dc.identifier.issn | 2040-3607 | - |
dc.identifier.uri | http://hdl.handle.net/10722/250969 | - |
dc.description.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 special cases, the bound turns out to be explicit in the sense that it is representable explicitly by the number of players, and the constants measuring the degree of asymmetry and non-linearity of the cost function. Copyright © 2010 Inderscience Enterprises Ltd. | - |
dc.language | eng | - |
dc.relation.ispartof | International Journal of Mathematical Modelling and Numerical Optimisation | - |
dc.subject | PoA | - |
dc.subject | System optimum | - |
dc.subject | Price of anarchy | - |
dc.subject | Equilibrium | - |
dc.subject | Non-separable | - |
dc.subject | Oligopolistic games | - |
dc.title | The efficiency analysis for oligopolistic games when cost functions are non-separable | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1504/IJMMNO.2010.031751 | - |
dc.identifier.scopus | eid_2-s2.0-79954989473 | - |
dc.identifier.volume | 1 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 237 | - |
dc.identifier.epage | 257 | - |
dc.identifier.eissn | 2040-3615 | - |
dc.identifier.issnl | 2040-3607 | - |