scientific article
From MaRDI portal
Publication:2921792
zbMath1297.91037MaRDI QIDQ2921792
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Noncooperative games (91A10) Games involving graphs (91A43) Applications of game theory (91A80) Deterministic network models in operations research (90B10)
Related Items (17)
Partition Equilibrium Always Exists in Resource Selection Games ⋮ Bottleneck Congestion Games with Logarithmic Price of Anarchy ⋮ Atomic routing games on maximum congestion ⋮ Competitive online multicommodity routing ⋮ Principal-agent VCG contracts ⋮ Partition equilibrium always exists in resource selection games ⋮ Incentives and coordination in bottleneck models ⋮ The price of anarchy in series-parallel network congestion games ⋮ Price of Anarchy in Networks with Heterogeneous Latency Functions ⋮ Collusion in Atomic Splittable Routing Games ⋮ Local smoothness and the price of anarchy in splittable congestion games ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Stackelberg Strategies and Collusion in Network Games with Splittable Flow ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Nonadaptive Selfish Routing with Online Demands ⋮ Efficient graph topologies in network routing games ⋮ Efficiency of atomic splittable selfish routing with polynomial cost functions
This page was built for publication: