Inducing Approximately Optimal Flow Using Truthful Mediators
Inducing Approximately Optimal Flow Using Truthful Mediators
We revisit a classic coordination problem from the perspective of mechanism design: how can we coordinate a social welfare maximizing flow in a network congestion game with selfish players? The classical approach, which computes tolls as a function of known demands, fails when the demands are unknown to the mechanism …