Game-theoretic analysis of Internet switching with selfish users
type: Item
instance of: scholarly article
title: Game-theoretic analysis of Internet switching with selfish users
zbMATH Open document ID: 1247.68026
author: Stefano Leonardi
author: Alex Kesselman
published in: Theoretical Computer Science
publication date: 2012-10-11T00:00:00Z
Mathematics Subject Classification ID: 68M11
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 6093017
zbMATH Keywords: selfish users
zbMATH Keywords: Internet switching
zbMATH Keywords: drop policy
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.05.029
OpenAlex ID: W2084461307
cites work: Routing into two parallel links: Game-theoretic distributed algorithms
cites work: On the convergence to Nash equilibrium in problems of distributed computing
cites work: Automata, Languages and Programming
cites work: Selfish traffic allocation for server farms
cites work: Q4828962
cites work: Q4449199
cites work: Q4449200
cites work: Q5687197
cites work: Q4737150
cites work: Q4223194
cites work: Q5501369
cites work: Resource pricing and the evolution of congestion control
cites work: Rate control for communication networks: shadow prices, proportional fairness and stability
cites work: On the existence of equilibria in noncooperative optimal flow control
cites work: Non-cooperative games
cites work: How bad is selfish routing?
DOI: 10.1016/J.TCS.2012.05.029
description: scientific article; zbMATH DE number 6093017