Selfishness Need Not Be Bad-Reference-Cited by-同舟云学术

Selfishness Need Not Be Bad

Published:2021-03 Issue:2 Volume:69 Page:410-435
ISSN:0030-364X
Container-title:Operations Research
language:en
Short-container-title:Operations Research

Author:

Wu Zijun¹^ORCID,Möhring Rolf H.¹²^ORCID,Chen Yanyan³,Xu Dachuan⁴

Affiliation:

1. Institute for Applied Optimization, School of Artificial Intelligence and Bigdata, Hefei University, 230091 Hefei, P. R. China;

2. Institute of Mathematics, Technische Universität Berlin, 10623 Berlin, Germany;

3. Beijing Key Lab of Traffic Engineering, Beijing University of Technology, 100124 Beijing, P. R. China;

4. Department of Operations Research and Information Engineering, Beijing University of Technology, 100124 Beijing, P. R. China

Abstract

The price of anarchy (PoA) is a standard measure for the inefficiency of selfish routing in the static Wardrop traffic model. Empirical studies and a recent analysis reveal a surprising property that the PoA tends to one when the total demand T gets large. These results are extended by a new framework for the limit analysis of the PoA in arbitrary nonatomic congestion games that apply to arbitrary growth patterns of T and all regularly varying cost functions. For routing games with Bureau of Public Road (BPR) cost functions, the convergence follows a power law determined by the degree of the BPR functions, and a related conjecture need not hold. These findings are confirmed by an empirical analysis of traffic in Beijing.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications

Reference28 articles.

1. Regular Variation

2. Colini-Baldeschi R, Cominetti R, Scarsini M (2016) On the price of anarchy of highly congested nonatomic network games. Gairing M and Savani R, eds. Internat. Sympos. on Algorithmic Game Theory (Springer, New York), 117–128.

3. Correa JR, Schulz AS, Stier-Moses NE (2005) On the inefficiency of equilibria in congestion games. Integer programming and combinatorial optimization. Jünger M and Kaibel V, eds. Internat. IPCO Conf. (Springer, New York), 167–181.

4. Selfish Routing in Capacitated Networks

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ordinary and Prophet Planning Under Uncertainty in Bernoulli Congestion Games;Operations Research;2024-08-21

2. Employing an optimisation algorithm to design an evolutionary topological structure for non-misbehaving nodes with optimal path selection;Wireless Personal Communications;2024-07-18

3. Phase transitions of the price-of-anarchy function in multi-commodity routing games;Transportation Research Part B: Methodological;2024-04

4. Discrete-Time Replicator Equations on Parallel Neural Networks;Communications in Computer and Information Science;2024

5. A game-theoretic perspective of deep neural networks;Theoretical Computer Science;2023-01