Iterative Combinatorial Auction for Two-Sided Grid Markets: Multiple users and Multiple Providers

Authors

  • Aminul Haque

Keywords:

grid computing; economic models; auction; bid; profit; tight budget

Abstract

Heterogeneity and different ownerships of grid computing resources impose complexity in evaluating the market value of these resources. Auction protocols are proposed to meet this challenge efficiently. Auction models are also suitable for achieving better payoff and resource allocation for grid providers. Grid users and providers are usually geographically distributed. The number of users in grid computing could also be very high. Hence, models provide seamless support to multiple users and providers would be useful to promote grid computing. In this paper, we implement a novel First Price Open Cry auction (ascending-bid auction) that supports for multiple users and providers simultaneously. We explain about (i) bundle generation (resource packages by providers), (ii) creating corresponding agents to bundles, (iii) allowing users to choose their suitable bundles, and (iv) clearing bundles through solving winner determination problem. The simulation results predict when and how to map providers2019; private values on resource bundles, such that maximum revenue and better utilization of idle resources. K

How to Cite

Aminul Haque. (2018). Iterative Combinatorial Auction for Two-Sided Grid Markets: Multiple users and Multiple Providers. Global Journal of Computer Science and Technology, 18(B1), 45–54. Retrieved from https://computerresearch.org/index.php/computer/article/view/1702

Iterative Combinatorial Auction for Two-Sided Grid Markets: Multiple users and Multiple Providers

Published

2018-01-15