Uniform Mixed Equilibria in Network Congestion Games with Link Failures

DOI10.1287/MOOR.2023.1365MaRDI QIDQ6149404zbMATH OpenOpenAlexFDO

Authors Vittorio Bilò, Luca Moscardelli, Cosimo Vinci

Publication date 5 March 2024

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.2023.1365

zbMATH Keywords

congestion gamesefficiencyfault-tolerant routingNash equilibriaprice of anarchyprice of stability

Mathematics Subject Classification ID

Potential and congestion games (91A14) Games involving graphs (91A43) Algorithmic game theory and complexity (91A68)

Recommendations

• Uniform mixed equilibria in network congestion games with link failures
• Congestion games with mixed objectives
• Congestion games with failures
• Mixed Nash equilibria in selfish routing problems with dynamic constraints
• Congestion Games with Mixed Objectives

Cited in

(3)

• Utility-sharing games: how to improve the efficiency with limited subsidies
• Multi-leader congestion games with an adversary
• Network congestion games with player failures for charging problem of EVs via matrix approach

This page was built for publication: Uniform Mixed Equilibria in Network Congestion Games with Link Failures

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