Urgency-aware optimal routing in repeated games through artificial currencies

DOI10.1016/j.ejcon.2021.06.024zbMath1480.91035arXiv2011.11595OpenAlexW3186570040MaRDI QIDQ2068548

Dario Paccagnan, Andrea Agazzi, Mauro Salazar, W. P. M. H. Heemels

Publication date: 19 January 2022

Published in: European Journal of Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.11595

zbMATH Keywords

game theoryrepeated gamestraffic assignment problemincentive designsystem-optimal routing

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Multistage and repeated games (91A20)

Cites Work

• A class of games possessing pure-strategy Nash equilibria
• How bad is selfish routing?
• From Monetary to Nonmonetary Mechanism Design via Artificial Currencies
• Studies on Robust Social Influence Mechanisms: Incentives for Efficient Network Routing in Uncertain Settings
• Nash and Wardrop Equilibria in Aggregative Games With Coupling Constraints
• Unnamed Item

This page was built for publication: Urgency-aware optimal routing in repeated games through artificial currencies