Window-games between TCP flows

DOI10.1016/j.tcs.2010.03.031zbMath1190.91034OpenAlexW2048096598MaRDI QIDQ982652

George B. Mertzios, Lazaros Tsavlidis, Pavlos S. Efraimidis

Publication date: 7 July 2010

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

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

zbMATH Keywords

Nash equilibriumalgorithmic game theorynetwork games

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Network protocols (68M12)

Uses Software

• ns-2

Cites Work

• Unnamed Item
• Unnamed Item
• Worst-case equilibria
• The structure and complexity of Nash equilibria for a selfish routing game
• A game theoretic comparison of TCP and digital fountain based protocols
• 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
• A mathematical model for the TCP tragedy of the commons
• Selfish unsplittable flows
• Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
• The price of selfish routing
• Algorithms, games, and the internet
• Prediction, Learning, and Games