Pricing network edges for heterogeneous selfish users

We study the negative consequences of selfish behavior in a congested network and economic means of influencing such behavior. We consider a model of selfish routing in which the latency experienced by network traffic on an edge of the network is a function of the edge congestion, and network users are assumed to selfishly route traffic on minimum-latency paths. The quality of a routing of traffic is measured by the sum of travel times (the total latency).It is well known that the outcome of selfish routing (a Nash equilibrium) does not minimize the total latency. An ancient strategy for improving the selfish solution is the principle of marginal cost pricing, which asserts that on each edge of the network, each network user on the edge should pay a tax offsetting the congestion effects caused by its presence. By pricing network edges according to this principle, the inefficiency of selfish routing can always be eradicated.This result, while fundamental, assumes a very strong homogeneity property: all network users are assumed to trade off time and money in an identical way. The guarantee also ignores both the algorithmic aspects of edge pricing and the unfortunate possibility that an efficient routing of traffic might only be achieved with exorbitant taxes. Motivated by these shortcomings, we extend this classical work on edge pricing in several different directions and prove the following results.We prove that the edges of a single-commodity network can always be priced so that an optimal routing of traffic arises as a Nash equilibrium, even for very general heterogeneous populations of network users.When there are only finitely many different types of network users and all edge latency functions are convex, we show how to compute such edge prices efficiently.We prove that an easy-to-check mathematical condition on the population of heterogeneous network users is both necessary and sufficient for the existence of edge prices that induce an optimal routing while requiring only moderate taxes.

[1]  D. Hearn,et al.  Congestion Toll Pricing of Traffic Networks , 1997 .

[2]  Stella C. Dafermos,et al.  Traffic assignment problem for a general network , 1969 .

[3]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[4]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[5]  M. Patriksson,et al.  SIDE CONSTRAINED TRAFFIC EQUILIBRIUM MODELS: TRAFFIC MANAGEMENT THROUGH LINK TOLLS. , 1998 .

[6]  Tim Roughgarden The price of anarchy is independent of the network topology , 2003, J. Comput. Syst. Sci..

[7]  Igal Milchtaich,et al.  Generic Uniqueness of Equilibrium in Large Crowding Games , 2000, Math. Oper. Res..

[8]  Tim Roughgarden,et al.  Selfish Routing , 2002 .

[9]  Michael J. Todd,et al.  Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[10]  D. Hearn,et al.  A Toll Pricing Framework for Traffic Assignment Problems with Elastic Demand , 2002 .

[11]  Christos H. Papadimitriou,et al.  Exponential lower bounds for finding Brouwer fixed points , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[12]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[13]  Mike J. Smith The marginal cost taxation of a transportation network , 1979 .

[14]  L. McKnight,et al.  Internet economics , 1997 .

[15]  Éva Tardos,et al.  Truthful mechanisms for one-parameter agents , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[16]  Tim Roughgarden,et al.  Designing networks for selfish users is hard , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[17]  Éva Tardos,et al.  Frugal path mechanisms , 2002, SODA '02.

[18]  小泉 信三 社会政策の原理 : Pigou, The economics of welfareを読む , 1923 .

[19]  Anna Nagurney,et al.  Sensitivity analysis for the asymmetric network equilibrium problem , 1984, Math. Program..

[20]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[21]  S. Dafermos The Traffic Assignment Problem for Multiclass-User Transportation Networks , 1972 .

[22]  D. Hearn,et al.  Solving Congestion Toll Pricing Models , 1998 .

[23]  Shirley Dex,et al.  JR 旅客販売総合システム(マルス)における運用及び管理について , 1991 .

[24]  Stella Dafermos,et al.  Toll Patterns for Multiclass-User Transportation Networks , 1973 .

[25]  J. Nash NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

[26]  A. C. Pigou Economics of welfare , 1920 .

[27]  Richard Cole,et al.  How much can taxes help selfish routing? , 2003, EC '03.

[28]  A. Peressini,et al.  The Mathematics Of Nonlinear Programming , 1988 .

[29]  S. Fischer Selfish Routing , 2002 .

[30]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[31]  C. B. Mcguire,et al.  Studies in the Economics of Transportation , 1958 .

[32]  Dietrich Braess,et al.  Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.

[33]  Kim C. Border,et al.  Fixed point theorems with applications to economics and game theory: Fixed point theorems for correspondences , 1985 .

[34]  Jeffrey K. MacKie-Mason,et al.  Pricing Congestible Network Resources (Invited Paper) , 1995, IEEE J. Sel. Areas Commun..

[35]  D. Schmeidler Equilibrium points of nonatomic games , 1973 .

[36]  James A. Mirrlees,et al.  The theory of optimal taxation , 2005 .