We consider users bidding in a series of multi-unit sealed-bid auctions, aiming at reserving the same amount of units of the resource auctioned, e.g. transmission slots in a wireless network, Each user attains From each successful allocation of resource units an instant marginal utility that depends on his history of resource allocation. The user's bid at each auction equals this marginal utility. We introduce a random walk model for transient analysis of this series of auctions, we study the properties of the resulting user resource allocation patterns and we provide a numerical and experimental evaluation of this model. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Dramitinos, M., Stamonlis, G. D., & Courcoubetis, C. (2006). A random walk model for studying allocation patterns in auction-based resource allocation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4033 LNCS, pp. 25–36). Springer Verlag. https://doi.org/10.1007/11780502_4
Mendeley helps you to discover research relevant for your work.