School of Software, Dalian University of Technology, Dalian, China

---

Abstract—In resource-limited environment, grid users compete for limited resources, and how to guarantee tasks’ victorious probabilities is one of the most primary issues that a resource scheduling model cares. In order to guarantee higher task’s victorious probabilities in grid resources scheduling situations, a novel model, namely ESPSA (Extended Second Price Sealed Auction), is proposed. The ESPSA model introduces an analyst entity, and designs analyst’s prediction algorithm based on Hidden Markov Model (HMM). In ESPSA model, grid resources are sold through second price sealed auction. Moreover, to achieve high victorious probabilities, the user brokers who are qualified to participate in the auctions will predict other players’ bids and then carry out the most beneficial bids. The ESPSA model is simulated based on GridSim toolkit. Simulation results show that the ESPSA model assures a higher victorious probability and superior to other traditional algorithms. Moreover, we analyze the existence of Nash equilibrium based on simulation results, thus, any participant who changes its strategy unilaterally could not make the results better.

Index Terms—Grid resource scheduling, game theory, extended second price sealed auction.

[PDF]

Cite: Weifeng Sun, Qiufen Xia, Zichuan Xu, Mingchu Li, Zhenquan Qin, "A Game Theoretic Resource Allocation Model Based on Extended Second Price Sealed Auction in Grid Computing," Journal of Computers vol. 7, no. 1, pp. 65-75, 2012.