An effective balanced budget and a $d$-nonmanipulable technique for processor time allocation

We propose a technique for processor time allocation in a grid system which is not manipulable by users and satisfies efficiency, individual rationality, and budget balance conditions. We assume that computers in the system differ in speed and running expenses; every user has one job and a linear usefulness function; the budget of a job coincides with the financial estimate of its usefulness. The mechinque suggested in this article generates a balanced distribution of processor time. It establishes the users' payments in accordance with a generalized Vickrey auction, and payments to the suppliers so that to guarantee budget balance and individual rationality.