Abstract
We study a Walrasian Equilibrium model to determine the prices of CPU time as merchandise. The customers have jobs that require a given length of CPU slot allocation with their valuations dependent on the assigned time slots. The owner of CPU processing time receives compensation for time slots sold to the customers, subject to the condition that the slots sold to a customer is those that customer most desires, given the price structure for the time slots. We establish conditions for jobs to have Walrasian Equilibrium, and obtain algorithm and complexity results to determine Walrasian equilibrium price and allocation. In particular, the issues of excessive supply of CPU time and price dynamics are discussed under our model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arrow, K.J., Debreu, G.: Existence of an equilibrium for competitive economy. Econometrica 22, 265–290 (1954)
Bikhchandani, S., Mamer, J.W.: Competitive equalibrium in an exchange economy with indivisibilities. Journal of Economy Theory 74, 385–413 (1997)
Bredin, J., Kotz, D., Rus, D.: Market-based resource control for mobile agents. In: the Proceeding of the 2nd International Conference on Autonomous Agents, ACM Press, New York (1998)
Chen, N., Deng, X., Sun, X.: On complexity of single-minded auction. Journal of Computer and System Sciences 69(4), 675–687 (2004)
Chen, N., Deng, X., Sun, X., Yao, A.C.-C.: Dynamic price sequence and incentive compatibility. In: DÃaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 320–331. Springer, Heidelberg (2004)
Deng, X., Papadimitriou, C., Safra, S.: On the complexity of price equilibria. Journal of Computer and System Sciences 67(2), 311–324 (2003)
Feigenbaum, J., Papadimitriou, C.H., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. In: the Proceedings of PODC (2002)
Ferguson, D., Nikolaou, C., Sairamesh, J., Yemini, Y.: Economic models for allocating resources in computer systems (1996)
Ferguson, D., Yemini, Y., Nikolaou, C.: Microeconomic algorithms for load balancing in distributed computer systems. In: the Proceedings of DCS (1988)
Goldberg, V., Hartline, J.D., Wright, A.: Competitive auctions and digital goods (2001)
Gul, F., Stacchetti, E.: Walrasian equilibrium with gross substitutes. Journal of. Economy Theory 87, 95–124 (1999)
Kurose, J.F., Simha, R.: A microeconomic approach to optimal resource allocation in distributed computer systems. IEEE Trans. on Computers 38(5), 705–717 (1989)
Nisan, N.: Bidding and allocation in combinatorial auctions. In: ACM Conference on Electronic Commerce, pp. 1–12 (2000)
Nisan, N., London, L., Regev, O., Camiel, N.: Globally distributed computation over the internet - the POPCORN project. In: International Conference on Distributed Computing Systems (1998)
Waldspurger, C.A., Hogg, T., Huberman, B.A., Kephart, J.O.: andW. S. Stornetta. Spawn: A distributed computational economy. IEEE Transactions on Software 18(2), 103–117 (1992)
Walras, L.: Elements d’Economique Politique Pure. Corbaz, Lausanne, Switzerland (1874)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deng, X., Huang, LS., Li, M. (2005). On Walrasian Price of CPU Time. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_60
Download citation
DOI: https://doi.org/10.1007/11533719_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)