On walrasian price of CPU time

Authors:
Xiaotie Deng;Li-Sha Huang;Minming Li
Affiliations:
Department of Computer Science, City Univ. of Hong Kong;State Key Laboratory of Intelligent Technology and Systems, Dept. of Computer Science and Technology, Tsinghua Univ., Beijing, China;State Key Laboratory of Intelligent Technology and Systems, Dept. of Computer Science and Technology, Tsinghua Univ., Beijing, China
Venue:
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Year:
2005

Citing 8
Cited 2

A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems

IEEE Transactions on Computers
Spawn: A Distributed Computational Economy

IEEE Transactions on Software Engineering
Market-based resource control for mobile agents

AGENTS '98 Proceedings of the second international conference on Autonomous agents
Bidding and allocation in combinatorial auctions

Proceedings of the 2nd ACM conference on Electronic commerce
A BGP-based mechanism for lowest-cost routing

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Globally Distributed Computation over the Internet - The POPCORN Project

ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
On the complexity of price equilibria

Journal of Computer and System Sciences - STOC 2002
On complexity of single-minded auction

Journal of Computer and System Sciences

Monotone properties of randomized symmetric incentive compatible auctions

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Properties of symmetric incentive compatible auctions

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.01

Visualization

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.