The Library
Atomic congestion games with random players : network equilibrium and the price of anarchy
Tools
Wang, Chenlan, Doan, Xuan Vinh and Chen, Bo (2022) Atomic congestion games with random players : network equilibrium and the price of anarchy. Journal of Combinatorial Optimization, 44 . pp. 2123-2142. doi:10.1007/s10878-020-00583-3 ISSN 1382-6905.
|
PDF
WRAP-Atomic-congestion-games-random-players-Doan-2020.pdf - Published Version - Requires a PDF viewer. Available under License Creative Commons Attribution 4.0. Download (432Kb) | Preview |
|
PDF
WRAP-Atomic-congestion-games-random-players-Doan-2020.pdf - Accepted Version Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer. Download (481Kb) |
Official URL: https://doi.org/10.1007/s10878-020-00583-3
Abstract
In this paper, we present a new model of congestion games with finite and random number of players, and an analytical method to compute the random path and link flows. We study the equilibrium condition, reformulate it as an equivalent variational inequality problem, and establish the existence and non-uniqueness of the equilibria. We also upper bound the price of anarchy with affine cost functions to characterize the quality of the equilibria. The upper bound is tight in some special cases, including the case of deterministic players. Finally a general lower bound is also provided.
Item Type: | Journal Article | ||||||||
---|---|---|---|---|---|---|---|---|---|
Subjects: | H Social Sciences > HB Economic Theory Q Science > QA Mathematics |
||||||||
Divisions: | Faculty of Social Sciences > Warwick Business School > Operations Management Faculty of Social Sciences > Warwick Business School |
||||||||
Library of Congress Subject Headings (LCSH): | Game theory, Computer networks -- Design and construction, Computer networks -- Economic aspects | ||||||||
Journal or Publication Title: | Journal of Combinatorial Optimization | ||||||||
Publisher: | Springer New York LLC | ||||||||
ISSN: | 1382-6905 | ||||||||
Official Date: | October 2022 | ||||||||
Dates: |
|
||||||||
Volume: | 44 | ||||||||
Page Range: | pp. 2123-2142 | ||||||||
DOI: | 10.1007/s10878-020-00583-3 | ||||||||
Status: | Peer Reviewed | ||||||||
Publication Status: | Published | ||||||||
Reuse Statement (publisher, data, author rights): | This is a post-peer-review, pre-copyedit version of an article published in Journal of Combinatorial Optimization. The final authenticated version is available online at: http://dx.doi.org/10.1007/s10878-020-00583-3. | ||||||||
Access rights to Published version: | Open Access (Creative Commons) | ||||||||
Date of first compliant deposit: | 20 April 2020 | ||||||||
Date of first compliant Open Access: | 4 June 2020 | ||||||||
RIOXX Funder/Project Grant: |
|
||||||||
Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year