Selfish unsplittable flows

DOI10.1016/j.tcs.2005.09.024zbMath1152.90355OpenAlexW2077066745WikidataQ59818727 ScholiaQ59818727MaRDI QIDQ2581267

Dimitris Fotakis, Paul G. Spirakis, Spyros C. Kontogiannis

Publication date: 9 January 2006

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

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

zbMATH Keywords

quadratic programmingprice of anarchypure Nash equilibrianetwork congestion gamesunsplittable flows

Mathematics Subject Classification ID

Noncooperative games (91A10) Quadratic programming (90C20) Deterministic network models in operations research (90B10)

Related Items (56)

On potential equations of finite games ⋮ Congestion Games with Complementarities ⋮ Bottleneck Congestion Games with Logarithmic Price of Anarchy ⋮ The complexity of welfare maximization in congestion games ⋮ Congestion games with load-dependent failures: Identical resources ⋮ Congestion games with mixed objectives ⋮ The structure and complexity of Nash equilibria for a selfish routing game ⋮ Atomic routing games on maximum congestion ⋮ Cost-sharing scheduling games on restricted unrelated machines ⋮ A game-theoretic algorithm for non-linear single-path routing problems ⋮ A Glimpse at Paul G. Spirakis ⋮ Weighted Boolean Formula Games ⋮ A Selective Tour Through Congestion Games ⋮ Collusion in atomic splittable routing games ⋮ Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids ⋮ Sharing Non-anonymous Costs of Multiple Resources Optimally ⋮ A convergence analysis of the price of anarchy in atomic congestion games ⋮ Congestion Games with Mixed Objectives ⋮ Exact price of anarchy for weighted congestion games with two players ⋮ Unnamed Item ⋮ Graphical congestion games ⋮ Tight bounds for selfish and greedy load balancing ⋮ Characterizing the existence of potential functions in weighted congestion games ⋮ On approximate pure Nash equilibria in weighted congestion games with polynomial latencies ⋮ Stability vs. optimality in selfish ring routing ⋮ The complexity of pure equilibria in mix-weighted congestion games on parallel links ⋮ Network topology and equilibrium existence in weighted network congestion games ⋮ Restoring Pure Equilibria to Weighted Congestion Games ⋮ A new model for selfish routing ⋮ Nash equilibria in discrete routing games with convex latency functions ⋮ The impact of social ignorance on weighted congestion games ⋮ The price of atomic selfish ring routing ⋮ Window-games between TCP flows ⋮ Atomic congestion games: fast, myopic and concurrent ⋮ Congestion Games with Variable Demands ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ Window-Games between TCP Flows ⋮ Atomic Congestion Games: Fast, Myopic and Concurrent ⋮ Congestion Games with Multi-Dimensional Demands ⋮ Unnamed Item ⋮ Cost-sharing games in real-time scheduling systems ⋮ The price of anarchy in nonatomic consumption-relevance congestion games ⋮ Pure Nash equilibria in player-specific and weighted congestion games ⋮ Cost-sharing games in real-time scheduling systems ⋮ Project games ⋮ Internalization of social cost in congestion games ⋮ Wealth Inequality and the Price of Anarchy ⋮ On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies ⋮ How hard is it to find extreme Nash equilibria in network congestion games? ⋮ Weighted congestion games with separable preferences ⋮ The Price of Stability of Weighted Congestion Games ⋮ The Price of Stability of Weighted Congestion Games ⋮ A unifying approximate potential for weighted congestion games ⋮ Equilibria in Multiclass and Multidimensional Atomic Congestion Games ⋮ Pure Nash Equilibria in Resource Graph Games

Cites Work

• Approximate equilibria and ball fusion
• Potential games
• Congestion games with player-specific payoff functions
• A class of games possessing pure-strategy Nash equilibria
• How bad is selfish routing?
• Duality in quadratic programming
• Selfish traffic allocation for server farms
• The complexity of pure Nash equilibria
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• The price of selfish routing
• STACS 2004
• Probability Inequalities for Sums of Bounded Random Variables
• Mathematical Foundations of Computer Science 2003
• Theoretical Computer Science
• The price of anarchy is independent of the network topology
• Atomic resource sharing in noncooperative networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Selfish unsplittable flows