Stretch in Bottleneck Games

DOI10.1007/978-3-642-32241-9_50MaRDI QIDQ2914360zbMATH OpenOpenAlexFDO

Authors Costas Busch, R. Kannan

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32241-9_50

zbMATH Keywords

price of anarchyalgorithmic game theorycongestion gamesbottleneck games

Mathematics Subject Classification ID

Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Noncooperative games (91A10) Games involving graphs (91A43)

Recommendations

• Equilibria in bottleneck games
• Robust bottleneck routing games
• scientific article; zbMATH DE number 1688388
• scientific article; zbMATH DE number 6829368
• scientific article; zbMATH DE number 1809600
• On Games With Coupled Constraints
• A class of bottleneck expansion problems
• scientific article; zbMATH DE number 4051391
• Congestion network problems and related games

Cited in

(3)

• On the inefficiency of equilibria in linear bottleneck congestion games
• The strong price of anarchy of linear bottleneck congestion games
• Bottleneck congestion games with logarithmic price of anarchy

This page was built for publication: Stretch in Bottleneck Games

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