Collusion in atomic splittable routing games
From MaRDI portal
Publication:2392243
DOI10.1007/s00224-012-9421-4zbMath1270.91016MaRDI QIDQ2392243
Publication date: 1 August 2013
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-012-9421-4
Related Items
Unnamed Item, Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function, Strategic decentralization in binary choice composite congestion games, Equilibrium computation in resource allocation games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stackelberg strategies and collusion in network games with splittable flow
- On the performance of approximate equilibria in congestion games
- A polynomial algorithm for minimum quadratic cost flow problems
- Topology of series-parallel networks
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Linear tolls suffice: new bounds and algorithms for tolls in single source networks
- Selfish unsplittable flows
- Coalitions in Nonatomic Network Congestion Games
- The effect of collusion in congestion games
- Braess's Paradox in large random graphs
- The Impact of Oligopolistic Competition in Networks
- Stackelberg Routing in Arbitrary Networks
- How bad is selfish routing?
- Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
- Technical Note—Traffic Equilibrium Paradoxes
- Faster Algorithms for Minimum Cycle Basis in Directed Graphs
- The Price of Collusion in Series-Parallel Networks
- The price of anarchy of finite congestion games
- Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
- Strong and Pareto Price of Anarchy in Congestion Games
- On the Value of Coordination in Network Design
- Stackelberg Scheduling Strategies
- Atomic congestion games among coalitions
- Intrinsic robustness of the price of anarchy
- Competitive routing in networks with polynomial costs
- Strong Price of Anarchy for Machine Load Balancing
- Exact Price of Anarchy for Polynomial Congestion Games
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Selfish Routing in Capacitated Networks
- Approximation and Online Algorithms
- The Price of Routing Unsplittable Flow
