Recommendations
Cited in
(40)- scientific article; zbMATH DE number 7378728 (Why is no real title available?)
- Collusion constrained equilibrium
- Selfish bin packing
- Cost-sharing in generalised selfish routing
- On existence of equilibrium under social coalition structures
- 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
- Collusion in atomic splittable routing 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
- Coalitions in nonatomic network congestion games
- What's a little collusion between friends?
- Coordinating oligopolistic players in unrelated machine scheduling
- Selfish Bin Packing
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow
- Computing the strong Nash equilibrium for Markov chains games
- The quality of equilibria for set packing and throughput scheduling games
- Atomic Congestion Games: Fast, Myopic and Concurrent
- Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion
- Collusive game solutions via optimization
- Selfishness, collusion and power of local search for the ADMs minimization problem
- Partition equilibrium always exists in resource selection games
- Partition Equilibrium Always Exists in Resource Selection Games
- The price of collusion in series-parallel networks
- On singleton congestion games with resilience against collusion
- On the uniqueness of equilibrium in atomic splittable routing games
- Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness
- Complexity and parametric computation of equilibria in atomic splittable congestion games via weighted block Laplacians
- 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)
