Show simple item record

dc.contributor.authorOpiyo, Elisha T. O.
dc.contributor.authorAyienga, Erick
dc.contributor.authorGetao, Katherine
dc.contributor.authorOkello-Odongo, William
dc.contributor.authorManderick, Bernard
dc.contributor.authorNowé, Ann
dc.date.accessioned2013-07-12T09:03:28Z
dc.date.available2013-07-12T09:03:28Z
dc.date.issued2008
dc.identifier.isbn978-9970-02-871-2
dc.identifier.urihttp://hdl.handle.net/10570/1907
dc.description.abstractResource 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.en_US
dc.language.isoenen_US
dc.publisherFountain Publishers Kampalaen_US
dc.subjectDynamic Resourceen_US
dc.subjectResource allocationen_US
dc.subjectPriceen_US
dc.titleDynamic Resource Allocation: A Comparison of First Price Sealed Bid and Vickrey Auctionsen_US
dc.typeBook chapteren_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record