Stackelberg Strategies for Atomic Congestion Games
From MaRDI portal
Publication:3527221
DOI10.1007/978-3-540-75520-3_28zbMath1151.91374OpenAlexW2155867373WikidataQ59818614 ScholiaQ59818614MaRDI QIDQ3527221
Publication date: 25 September 2008
Published in: Algorithms – ESA 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_28
Noncooperative games (91A10) Communication networks in operations research (90B18) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (8)
Inefficiency of pure Nash equilibria in series-parallel network congestion games ⋮ Efficient methods for selfish network design ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Congestion games with linearly independent paths: convergence time and price of anarchy ⋮ Stackelberg Strategies and Collusion in Network Games with Splittable Flow ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy ⋮ Dynamic Resource Allocation Games
This page was built for publication: Stackelberg Strategies for Atomic Congestion Games
