The Price of Collusion in Series-Parallel Networks

DOI10.1007/978-3-642-13036-6_24zbMath1285.91022OpenAlexW1498355005MaRDI QIDQ3569827

Lisa K. Fleischer, Umang Bhaskar, Chien-Chung Huang

Publication date: 22 June 2010

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_24

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (8)

Strategic decentralization in binary choice composite congestion games ⋮ Collusion in atomic splittable routing games ⋮ The price of anarchy in series-parallel network congestion games ⋮ Unnamed Item ⋮ r-extreme signalling for congestion control ⋮ Collusion in Atomic Splittable Routing Games ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Dynamic Atomic Congestion Games with Seasonal Flows

This page was built for publication: The Price of Collusion in Series-Parallel Networks