Game-theoretic analysis of Internet switching with selfish users

DOI10.1016/J.TCS.2012.05.029zbMATH Open1247.68026OpenAlexW2084461307MaRDI QIDQ714792FDOQ714792

Alex Kesselman, Stefano Leonardi

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.029

zbMATH Keywords

drop policyInternet switchingselfish users

Mathematics Subject Classification ID

Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Internet topics (68M11)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Non-cooperative games
• How bad is selfish routing?
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Selfish traffic allocation for server farms
• Automata, Languages and Programming
• Resource pricing and the evolution of congestion control
• On the existence of equilibria in noncooperative optimal flow control
• Routing into two parallel links: Game-theoretic distributed algorithms
• On the convergence to Nash equilibrium in problems of distributed computing

Cited In (3)

• A barrier function method for generalized Nash equilibrium problems
• Generalized Nash equilibrium problems and Newton methods
• A penalty method for generalized Nash equilibrium problems

This page was built for publication: Game-theoretic analysis of Internet switching with selfish users

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714792)