Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions

DOI10.1007/11786986_44zbMath1223.91016OpenAlexW1603063217MaRDI QIDQ3613785

Martin Gairing, Karsten Tiemann, Burkhard Monien

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Traffic problems in operations research (90B20)

Related Items (14)

Optimal cost sharing for capacitated facility location games ⋮ Coordination mechanisms ⋮ Strong equilibria in games with the lexicographical improvement property ⋮ On a generalized Cournot oligopolistic competition game ⋮ Transportation network with externalities ⋮ Exact price of anarchy for weighted congestion games with two players ⋮ Characterizing the existence of potential functions in weighted congestion games ⋮ Unnamed Item ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ Subjective vs. Objective Reality — The Risk of Running Late ⋮ Pure Nash equilibria in player-specific and weighted congestion games ⋮ Informational Braess’ Paradox: The Effect of Information on Traffic Congestion ⋮ Project games ⋮ Weighted congestion games with separable preferences

This page was built for publication: Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions