Stackelberg strategies for network design games

DOI10.1080/15427951.2012.727772zbMATH Open1341.91023OpenAlexW2071713714MaRDI QIDQ2808832FDOQ2808832

Authors: Angelo Fanelli, Michele Flammini, Luca Moscardelli 

Publication date: 25 May 2016

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2012.727772

Recommendations

• Stackelberg Routing in Arbitrary Networks
• On Stackelberg strategies in affine congestion games
• On Stackelberg strategies in affine congestion games
• Stackelberg strategies and collusion in network games with splittable flow
• Stackelberg Strategies for Atomic Congestion Games

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Games involving graphs (91A43) Hierarchical games (including Stackelberg games) (91A65)

Cited In (9)

• A Stackelberg network game with a large number of followers
• The price of optimum in a matching game
• Access network synthesis game in next generation networks
• Network design with weighted players
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• Stackelberg strategies and collusion in network games with splittable flow
• A game theoretic analysis of network design with socially-aware users
• Stackelberg Strategies and Collusion in Network Games with Splittable Flow
• Stackelberg strategies on epidemic containment games

This page was built for publication: Stackelberg strategies for network design games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808832)