2026-08-15T17:31:50Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:991 2024-03-06T11:07:09Z ddc:004 open_access

A Comparison Between Mechanisms for Sequential Compute Resource Auctions Byde, Andrew Auction resource allocation This paper describes simulations designed to test the relative efficiency of two di®erent sequential auction mechanisms for allocating compute resources between users in a shared data-center. Specifically we model the environment of a data center dedicated to CGI rendering in which animators delegate responsibility for acquiring adequate compute resources to bidding agents that automously bid on their behalf. For each of two possible auction types we apply a genetic algorithm to a broad class of bidding strategies to determine a near-optimal bidding strategy for a specified auction type, and use statistics of the performance of these strategies to determine the most suitable auction type for this domain. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Andrew Byde 2007 Is Part Of Dagstuhl Seminar Proceedings, Volume 6461, Negotiation and Market Engineering (2007) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.06461.4 urn:nbn:de:0030-drops-9914 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06461.4 eng https://creativecommons.org/licenses/by/4.0/legalcode