Efficiency of Market-Based Resource Allocation among Many Participants

Market mechanisms have been suggested in the last few years as a tool for allocating shared networks resources among several competing users. In this paper, we consider the efficiency loss of such mechanisms in the presence of a large number of users. We model the user interactions as a game with a heterogeneous population of players characterized by random utility functions. If the utility functions are bounded, then the non-cooperative equilibrium are nearly as efficient as the social optimum with high probability when the number of users is large. This efficiency result holds for a single link with a fixed or an increasing capacity. Using a standard probabilistic analysis, we show that the efficiency loss incurred by the market mechanism decreases almost exponentially in the number of users. If, however, the utility functions are not bounded, then the loss of efficiency does not converge to zero. We also provide results for networks by sampling the users at random based on their paths.

[1]  M. Shubik,et al.  Efficiency properties of strategies market games: An axiomatic approach , 1980 .

[2]  Kevin Roberts,et al.  The limit points of monopolistic competition , 1980 .

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

[4]  A. Mas-Colell,et al.  Efficiency Properties of Strategic Market Games: An Axiomatic Approach* , 1982 .

[5]  Shie Mannor,et al.  Asymptotics of Efficiency Loss in Competitive Market Mechanisms , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  Jean-François Mertens,et al.  Upper Hemi-Continuity of the Equilibrium-Set Correspondence for Pure Exchange Economies , 1972 .

[7]  John N. Tsitsiklis,et al.  Efficiency loss in a network resource allocation game: the case of elastic supply , 2004, IEEE Transactions on Automatic Control.

[8]  M. Shubik COMMODITY MONEY, OLIGOPOLY, CREDIT and BANKRUPTCY IN A GENERAL EQUILIBRIUM MODEL , 1973 .

[9]  D. Bertsekas 6.253 Convex Analysis and Optimization, Spring 2010 , 2004 .

[10]  John N. Tsitsiklis,et al.  Efficiency loss in a network resource allocation game: the case of elastic supply , 2005, IEEE Trans. Autom. Control..

[11]  Edward J. Green,et al.  Noncooperative price taking in large dynamic markets , 1980 .

[12]  Guilherme Carmona Nash and Limit Equilibria of Games with a Continuum of Players , 2003 .

[13]  S. Shenker Fundamental Design Issues for the Future Internet , 1995 .

[14]  Eric J. Friedman,et al.  A Generic Analysis of Selfish Routing , 2002 .

[15]  L. Shapley Noncooperative General Exchange , 1976 .

[16]  Yin Zhang,et al.  On selfish routing in internet-like environments , 2006, TNET.

[17]  J. Hüsler Extremes and related properties of random sequences and processes , 1984 .

[18]  Herbert A. David,et al.  Order Statistics, Third Edition , 2003, Wiley Series in Probability and Statistics.

[19]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[20]  Peter L. Bartlett,et al.  Neural Network Learning - Theoretical Foundations , 1999 .

[21]  W. Hoeffding Probability Inequalities for sums of Bounded Random Variables , 1963 .

[22]  Augustin M. Cournot Cournot, Antoine Augustin: Recherches sur les principes mathématiques de la théorie des richesses , 2019, Die 100 wichtigsten Werke der Ökonomie.

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

[24]  R. Aumann Markets with a continuum of traders , 1964 .

[25]  D. J. Roberts,et al.  THE INCENTIVES FOR PRICE-TAKING BEHAVIOR IN LARGE EXCHANGE ECONOMIES , 1976 .

[26]  H. N. Nagaraja,et al.  Order Statistics, Third Edition , 2005, Wiley Series in Probability and Statistics.

[27]  B. Hajek,et al.  A Framework for Studying Demand in Hierarchical Networks (Preliminary draft ) , 2004 .

[28]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[29]  Erik Ordentlich,et al.  Universal portfolios with side information , 1996, IEEE Trans. Inf. Theory.

[30]  E. Green Continuum and Finite-Player Noncooperative Models of Competition , 1984 .

[31]  T. Palfrey,et al.  Private Information in Large Economies , 1986 .

[32]  Yin Zhang,et al.  On selfish routing in Internet-like environments , 2003, IEEE/ACM Transactions on Networking.

[33]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[34]  Andrew Postlewaite,et al.  Approximate Efficiency of Non-Walrasian Nash Equilibria , 1978 .