A network pricing game for selfish traffic
type: Item
instance of: scholarly article
title: A network pricing game for selfish traffic
zbMATH Open document ID: 1266.91005
author: Ara Hayrapetyan
author: Tom Wexler
author: Éva Tardos
published in: Distributed Computing
publication date: 2013-06-20T00:00:00Z
Mathematics Subject Classification ID: 91Axx
Mathematics Subject Classification ID: 68M11
zbMATH DE Number: 6177551
zbMATH Keywords: game theory
zbMATH Keywords: network pricing games
zbMATH Keywords: price of anarchy
MaRDI profile type: Publication
full work available at URL: s00446-006-0020-y
OpenAlex ID: W1983085889
cites work: Competition and Efficiency in Congested Markets
cites work: Competition in Service Industries
cites work: The Price of Stability for Network Design with Fair Cost Allocation
cites work: Near-optimal network design with selfish agents
cites work: Pricing network edges for heterogeneous selfish users
cites work: How much can taxes help selfish routing?
cites work: Selfish Routing in Capacitated Networks
cites work: Selfish traffic allocation for server farms
cites work: Q4828962
cites work: On a network creation game
cites work: Q3409969
cites work: The price of anarchy is independent of the network topology
cites work: Stackelberg scheduling strategies
cites work: How bad is selfish routing?
DOI: 10.1007/S00446-006-0020-Y
description: scientific article; zbMATH DE number 6177551