In Congestion Games, Taxes Achieve Optimal Approximation
研究了拥堵博弈中税收干预的效果，发现高效计算的税收能达到与最优多项式时间算法相同的性能，且任何其他可处理的干预都无法超越。
The Power of Traffic Tolls The paper “In Congestion Games, Taxes Achieve Optimal Approximation” by Paccagnan and Gairing investigates the power and limitations of taxes as interventions in congestion games. Perhaps surprisingly, they find that efficiently computed taxes can achieve the same performance as the best polynomial time algorithm, even when the algorithm has full control over the agents’ actions. The authors establish three main results to support this claim. First, they prove that minimizing congestion is NP-hard to approximate within a given factor based on the latency functions. Second, they demonstrate how convex optimization tools can be used to design optimal taxes. Third, they provide a polynomial time algorithm with an approximation factor matching the hardness barrier. The upshot of their contribution can be summarized as follows: Judiciously designed taxes achieve optimal approximation, and no other tractable intervention can improve upon this result.