Dynamic Resource Allocation: A comparison of First Price Sealed Bid and Vickrey Auctions
Date
2008Author
Opiyo, Elisha T O
Ayienga, Erick
Getao, Katherine
Okello-Odongo, William
Type
ArticleLanguage
enMetadata
Show full item recordAbstract
Resource allocation involves assigning the resources to the resource users. Where the resources and the
resource users do not change with time, the resource allocation problem can be solved as a scheduling
problem. Where the resources and the resource users change with time then some different allocation
mechanisms are needed. In this paper an environment is considered in which the resources emerge and the
resource requests also emerge unpredictably as time goes. The resources emerge with different capacities
and in the same way the resource requests also emerge from the users with different demands as time goes.
In this dynamic environment the resource allocation performance of the first price sealed bid and the
Vickrey auctions are explored and compared. The system allocation performance is measured using the
number of the emerging resource provisions and the resource requests that get matched. The simulation
results show that there is no performance difference between the two mechanisms apart from the fact that
the Auctioneer’s earnings are higher for the first price sealed bid auction.
Citation
International Journal of Computing and ICT Research, Special Issue Vol. 1, No. 1Publisher
School of Computing and Informatics
Subject
Artificial Intelligence ApplicationsMulti-Agent Systems
General Terms
Agents
Auctions
Grid Computing
Resource Allocation
Scheduling