Congestion games with priority-based scheduling

DOI10.1007/978-3-030-57980-7_5zbMATH Open1506.91015OpenAlexW3084367266MaRDI QIDQ2109948FDOQ2109948

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

Recommendations

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

Mathematics Subject Classification ID

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

Cited In (3)

• Congestion games with priority-based scheduling
• Scheduling games with machine-dependent priority lists
• On the robustness of the approximate price of anarchy in generalized congestion games

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)