On Pigou's network, a repeated game among multiple competing route planners can reach optimal traffic flow, and this is impossible with a single planner or too few.
Implementing mediators with asynchronous cheap talk
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners
On Pigou's network, a repeated game among multiple competing route planners can reach optimal traffic flow, and this is impossible with a single planner or too few.