Selfish unsplittable flows

DOI10.1016/J.TCS.2005.09.024MaRDI QIDQ2581267zbMATH OpenOpenAlexWikidataFDO

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

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

network congestion gamesprice of anarchypure Nash equilibriaquadratic programmingunsplittable flows

Mathematics Subject Classification ID

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

Recommendations

• Automata, Languages and Programming
• 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

Cites work

• A class of games possessing pure-strategy Nash equilibria
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Approximate equilibria and ball fusion
• Atomic resource sharing in noncooperative networks
• Congestion games with player-specific payoff functions
• Duality in quadratic programming
• How bad is selfish routing?
• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 2038734 (Why is no real title available?)
• scientific article; zbMATH DE number 2038735 (Why is no real title available?)
• scientific article; zbMATH DE number 2086616 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 2119691 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003
• Potential games
• Probability Inequalities for Sums of Bounded Random Variables
• Selfish traffic allocation for server farms
• STACS 2004
• The complexity of pure Nash equilibria
• The price of anarchy is independent of the network topology
• The price of selfish routing
• Theoretical Computer Science
• Worst-case equilibria

Cited in

(68)

• Pure Nash equilibria in player-specific and weighted congestion games
• How hard is it to find extreme Nash equilibria in network congestion games?
• Weighted congestion games with separable preferences
• Congestion games with mixed objectives
• Internalization of social cost in congestion games
• On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
• Collusion in atomic splittable routing games
• Stability vs. optimality in selfish ring routing
• On potential equations of finite games
• Congestion games with variable demands
• Congestion Games with Multi-Dimensional Demands
• The price of anarchy in nonatomic consumption-relevance congestion games
• The complexity of welfare maximization in congestion games
• Sharing non-anonymous costs of multiple resources optimally
• Congestion Games with Mixed Objectives
• Restoring Pure Equilibria to Weighted Congestion Games
• Cost-sharing scheduling games on restricted unrelated machines
• Bottleneck congestion games with logarithmic price of anarchy
• Routing (un-) splittable flow in games with player-specific affine latency functions
• 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
• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
• Sensitivity analysis for convex separable optimization over integral polymatroids
• The complexity of pure equilibria in mix-weighted congestion games on parallel links
• Network topology and equilibrium existence in weighted network congestion games
• Routing selfish unsplittable traffic
• Uniform mixed equilibria in network congestion games with link failures
• The price of stability of weighted congestion games
• Pure Nash Equilibria in Resource Graph Games
• Computing approximate equilibria in weighted congestion games via best-responses
• Wealth Inequality and the Price of Anarchy
• On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies
• On the impact of singleton strategies in congestion games
• The price of stability of weighted congestion games
• Congestion games with complementarities
• Window-Games between TCP Flows
• Atomic Congestion Games: Fast, Myopic and Concurrent
• Automata, Languages and Programming
• Experimental and Efficient Algorithms
• Equilibria in Multiclass and Multidimensional Atomic Congestion Games
• The price of routing unsplittable flow
• On the existence of pure Nash equilibria in weighted congestion games
• The price of routing unsplittable flow
• Cost-sharing games in real-time scheduling systems
• Cost-sharing games in real-time scheduling systems
• Project games
• A convergence analysis of the price of anarchy in atomic congestion games
• Exact price of anarchy for weighted congestion games with two players
• Graphical congestion games
• Tight bounds for selfish and greedy load balancing
• Characterizing the existence of potential functions in weighted congestion games
• Computing the price of anarchy in atomic network congestion games (invited talk)
• Nash equilibria in two-resource congestion games with player-specific payoff functions
• On potential equations of finite symmetric games
• Node-max-cut and the complexity of equilibrium in linear weighted congestion games
• Existence and complexity of approximate equilibria in weighted congestion games
• Computing approximate mixed Nash equilibria for symmetric weighted congestion games
• The impact of social ignorance on weighted congestion games
• Congestion games with load-dependent failures: Identical resources
• The structure and complexity of Nash equilibria for a selfish routing game
• Atomic routing games on maximum congestion
• A new model for selfish routing
• Nash equilibria in discrete routing games with convex latency functions
• The price of atomic selfish ring routing
• Window-games between TCP flows
• Atomic congestion games: fast, myopic and concurrent

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 Q2581267)