A note on social learning in non-atomic routing games
From MaRDI portal
Publication:6106531
DOI10.1016/j.orl.2023.03.006zbMath1525.91057OpenAlexW4323669616MaRDI QIDQ6106531
Publication date: 3 July 2023
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2023.03.006
social learningincomplete informationrouting gameswardrop equilibriumSP networkscapacity conservations
Games involving graphs (91A43) Applications of game theory (91A80) Rationality and learning in game theory (91A26)
Cites Work
- Unnamed Item
- Repeated congestion games with bounded rationality
- Network characterizations for excluding Braess's paradox
- Network topology and the efficiency of equilibrium
- Weak and strong merging of opinions
- Potential games
- Social learning in nonatomic routing games
- Equilibrium routing under uncertainty
- Topology of series-parallel networks
- Selfish routing with incomplete information
- Social learning with private and common values
- A class of games possessing pure-strategy Nash equilibria
- A General Analysis of Sequential Social Learning
- Selfish Routing in Capacitated Networks
- Twenty Lectures on Algorithmic Game Theory
- Potential games with continuous player sets
This page was built for publication: A note on social learning in non-atomic routing games
