Collusion in Atomic Splittable Routing Games

DOI10.1007/978-3-642-22012-8_45zbMath1334.91023OpenAlexW2127423478MaRDI QIDQ3012948

Chien-Chung Huang

Publication date: 7 July 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_45

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43) Deterministic network models in operations research (90B10)

Related Items (2)

Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games

Cites Work

• The effect of collusion in congestion games
• The Impact of Oligopolistic Competition in Networks
• How bad is selfish routing?
• The Price of Collusion in Series-Parallel Networks
• Stackelberg Strategies and Collusion in Network Games with Splittable Flow
• Atomic Congestion Games Among Coalitions
• Competitive routing in networks with polynomial costs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Collusion in Atomic Splittable Routing Games