Publication:2934708
From MaRDI portal
zbMath1302.68024MaRDI QIDQ2934708
Publication date: 18 December 2014
91A65: Hierarchical games (including Stackelberg games)
91A80: Applications of game theory
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
68M11: Internet topics
Related Items
Adaptive constraint satisfaction for Markov decision process congestion games: application to transportation networks, The price of optimum: complexity and approximation for a matching game, Stackelberg strategies and collusion in network games with splittable flow, Stackelberg thresholds in network routing games or the value of altruism, Stackelberg strategies for atomic congestion games, Non-cooperative cost sharing games via subsidies, The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions, Stackelberg strategies for selfish routing in general multicommodity networks, Beyond Pigouvian taxes: a worst case analysis, The minimum tollbooth problem in atomic network congestion games with unsplittable flows, Equilibrium network design of shared-vehicle systems, Efficient coordination mechanisms for unrelated machine scheduling, Collusion in atomic splittable routing games, Stackelberg network pricing games, On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users, A Selective Tour Through Congestion Games, Stackelberg Strategies and Collusion in Network Games with Splittable Flow
