Congestion games with priority-based scheduling

DOI10.1007/978-3-030-57980-7_5MaRDI QIDQ2109948zbMATHOpenAlexFDO

Authors Vittorio Bilò, Cosimo Vinci

Publication date 21 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-57980-7_5

Mathematics Subject Classification ID

Games with infinitely many players (91A07) Potential and congestion games (91A14) Algorithmic game theory and complexity (91A68)

Recommendations

• A priority-based model of routing
• Mathematical Foundations of Computer Science 2004
• A unified approach to congestion games and two-sided markets
• Atomic congestion games with random players: network equilibrium and the price of anarchy

Cited in

(6)

• A priority-based model of routing
• On the robustness of the approximate price of anarchy in generalized congestion games
• Congestion games with priority-based scheduling
• Competitive packet routing with priority lists
• A unified approach to congestion games and two-sided markets
• Congestion control for a system with parallel stations and homogeneous customers using priority passes

This page was built for publication: Congestion games with priority-based scheduling

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