The effect of collusion in congestion games
From MaRDI portal
Publication:2931373
DOI10.1145/1132516.1132529zbMATH Open1300.91006OpenAlexW2140489133MaRDI QIDQ2931373FDOQ2931373
Éva Tardos, Tom Wexler, Ara Hayrapetyan
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132529
Recommendations
Cited In (37)
- Title not available (Why is that?)
- Selfish bin packing
- On existence of equilibrium under social coalition structures
- On the Uniqueness of Equilibrium in Atomic Splittable Routing Games
- Strong price of anarchy
- Adversarial behavior in network games
- Nonadaptive Selfish Routing with Online Demands
- Adaptive routing with stale information
- Multi-commodity Source Location Problems and Price of Greed
- Atomic congestion games: fast, myopic and concurrent
- Strong equilibrium in cost sharing connection games
- Local smoothness and the price of anarchy in splittable congestion games
- Equilibrium and potential in coalitional congestion games
- Strategic decentralization in binary choice composite congestion games
- Management of Variable Data Streams in Networks
- Robust and scalable middleware for selfish-computer systems
- Stackelberg strategies and collusion in network games with splittable flow
- Information diffusion in social sensing
- Collusion in Atomic Splittable Routing Games
- Coalitions in nonatomic network congestion games
- Coordinating oligopolistic players in unrelated machine scheduling
- Selfish Bin Packing
- Atomic Congestion Games: Fast, Myopic and Concurrent
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow
- The quality of equilibria for set packing and throughput scheduling games
- Computing the strong Nash equilibrium for Markov chains games
- Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion
- Collusive game solutions via optimization
- Cost-Sharing in Generalised Selfish Routing
- Selfishness, collusion and power of local search for the ADMs minimization problem
- Partition Equilibrium Always Exists in Resource Selection Games
- The price of collusion in series-parallel networks
- Partition equilibrium always exists in resource selection games
- On singleton congestion games with resilience against collusion
- Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness
- Social context congestion games
- Collusion in atomic splittable routing games
This page was built for publication: The effect of collusion in congestion games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931373)
