Issue No. 08 - August (2009 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.168
Michal Feldman , Hebrew University of Jerusalem, Jerusalem
Kevin Lai , Hewlett-Packard Laboratories, Palo Alto
Li Zhang , Microsoft Research Silicon Valley, Mountain View
We study the problem of allocating shared resources, such as bandwidth in computer networks and computational resources in shared clusters, among multiple users by the proportional-share market mechanism. Under this mechanism, each user partitions his budget among the multiple resources and receives a fraction of each resource proportional to his bid. We first formulate the resource allocation game under the proportional-share mechanism and study the efficiency and fairness of the equilibrium in this game. We present analytic and simulation results demonstrating that the proportional-share mechanism achieves a reasonable balance of high degrees of efficiency and fairness at the equilibrium.
Game theory, resource allocation, proportional-share mechanism.
K. Lai, M. Feldman and L. Zhang, "The Proportional-Share Allocation Market for Computational Resources," in IEEE Transactions on Parallel & Distributed Systems, vol. 20, no. , pp. 1075-1088, 2008.