Selfish unsplittable flows

DOI10.1007/978-3-540-27836-8_51MaRDI QIDQ5466497zbMATH OpenOpenAlexFDO

Authors Dimitris Fotakis, Spyros Kontogiannis, P. G. Spirakis

Publication date 24 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99859

zbMATH Keywords

network congestion gamesprice of anarchypure Nash equilibriaquadratic programmingunsplittable flows

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18) Quadratic programming (90C20) Noncooperative games (91A10) Games involving graphs (91A43)

Recommendations

• Selfish unsplittable flows
• The price of routing unsplittable flow
• The price of routing unsplittable flow
• Routing (un-) splittable flow in games with player-specific affine latency functions
• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions

Cited in

(11)

• Selfish routing with incomplete information
• Mixed Nash equilibria in selfish routing problems with dynamic constraints
• Selfish unsplittable flows
• Routing (un-) splittable flow in games with player-specific affine latency functions
• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
• Convergence and approximation in potential games
• Routing selfish unsplittable traffic
• Efficient convergence to pure Nash equilibria in weighted network congestion games
• The price of routing unsplittable flow
• Equilibria problems on games: complexity versus succinctness
• On best response dynamics in weighted congestion games with polynomial delays

This page was built for publication: Selfish unsplittable flows

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