Pricing in combinatorial double auction-based grid allocation model

Abstract This article proposes a novel grid resource allocation model, in which the users and the grid service providers participate in the combinatorial double auction for the resource allocation. To obtain the detailed resource allocation status and the price information, a novel pricing algorithm is designed for the allocation model. Simulation results demonstrate that the proposed algorithm completes the resource allocation and pricing efficiently, and exhibits incentive compatible characteristic. Moreover, users with the higher average price and providers with the lower average price get compensation during the pricing process.

[1]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[2]  Bai Wang,et al.  A Dynamic Price Model with Demand Prediction and Task Classification in Grid , 2007, Sixth International Conference on Grid and Cooperative Computing (GCC 2007).

[3]  Sajal K. Das,et al.  A pricing strategy for job allocation in mobile grids using a non-cooperative bargaining theory framework , 2005, J. Parallel Distributed Comput..

[4]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[5]  Michael Schwind,et al.  Dynamic Resource Prices in a Combinatorial Grid System , 2006, The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (CEC/EEE'06).

[6]  Noam Nisan,et al.  An efficient approximate allocation algorithm for combinatorial auctions , 2001, EC '01.

[7]  Daniel Grosu,et al.  Combinatorial auction-based protocols for resource allocation in grids , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[8]  Arne Andersson,et al.  Integer programming for combinatorial auction winner determination , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[9]  Craig Boutilier,et al.  Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.

[10]  Rajkumar Buyya,et al.  Economic-based Distributed Resource Management and Scheduling for Grid Computing , 2002, ArXiv.

[11]  Andrew B. Whinston,et al.  Solving the combinatorial double auction problem , 2005, Eur. J. Oper. Res..

[12]  Andrew B. Whinston,et al.  Pricing combinatorial auctions , 2004, Eur. J. Oper. Res..

[13]  Yang Jin,et al.  An autonomous pricing strategy toward market economy in computational grids , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.