Window-Games between TCP Flows

DOI10.1007/978-3-540-79309-0_10zbMath1136.91350OpenAlexW1744441305MaRDI QIDQ5459975

Pavlos S. Efraimidis, Lazaros Tsavlidis

Publication date: 2 May 2008

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_10

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Applications of game theory (91A80) Queues and service in operations research (90B22)

Cites Work

• Probabilistic methods for algorithmic discrete mathematics
• Potential games
• Congestion games with player-specific payoff functions
• Robust game theory
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
• Algorithms, games, and the internet

This page was built for publication: Window-Games between TCP Flows