On weak Pareto optimality of nonatomic routing networks
type: Item
instance of: scholarly article
title: On weak Pareto optimality of nonatomic routing networks
zbMATH Open document ID: 1503.91036
author: Zhuo Diao
author: Xiaodong Hu
author: Xujin Chen
published in: Journal of Combinatorial Optimization
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A07
zbMATH DE Number: 7595913
zbMATH Keywords: nonatomic selfish routing
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: weakly Pareto optimal
zbMATH Keywords: multi-commodity network
MaRDI profile type: Publication
full work available at URL: s10878-020-00539-7
OpenAlex ID: W3006372211
cites work: Über ein Paradoxon aus der Verkehrsplanung
cites work: Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing
cites work: Network characterizations for excluding Braess's paradox
cites work: Efficient graph topologies in network routing games
cites work: Strong equilibrium in network congestion games: increasing versus decreasing costs
cites work: Strong equilibrium in congestion games
cites work: Network structure and strong equilibrium in route selection games.
cites work: Worst-case equilibria
cites work: Network topology and the efficiency of equilibrium
cites work: How bad is selfish routing?
DOI: 10.1007/S10878-020-00539-7
description: scientific article; zbMATH DE number 7595913