Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators
summary
Private-link tolls can fail to have any pure equilibrium, cycle, or be arbitrarily inefficient; imposing caps below marginal tolls guarantees an equilibrium (indeed a strong Nash) that implements the social optimum. Proof uses convex variational characterizations, a key lemma: raising a toll reduces flow but raises link cost, and a second-order local-optimality bound; a linear program finds caps with provable guarantees (linear latencies give a 2× payment bound, series-parallel graphs achieve optimal payments).
AI-written summary · about
chapters (17)
- 0:00Introduction
- 0:28Problem setting and model
- 5:30Defining social cost
- 7:18Role of tolls
- 8:46Operator behavior
- 9:15Nash equilibrium defined
- 11:06Literature context
- 11:44Regulatory toll caps
- 12:36Main theoretical results
- 15:18Proof sketches
- 20:48Optimal toll selection
- 24:32Performance benchmarks
- 25:32Network complexity
- 25:52Series-parallel graphs
- 26:16Solution comparison
- 27:06Future work
- 27:22Q&A and conclusion
