Skip to main content

A Random Walk Model for Studying Allocation Patterns in Auction-Based Resource Allocation

  • Conference paper
Book cover Performability Has its Price (ICQT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4033))

Included in the following conference series:

  • 301 Accesses

Abstract

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.

This research was partly supported by EU-IST-2003-507607 B-BONE and IST-NoE EuroNGI. The authors wish to thank B-BONE and EuroNGI partners for useful discussions on the subject of this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dramitinos, M., Stamoulis, G.D., Courcoubetis, C.: Auction-based Resource Reservation in 2.5/3G Networks. Kluwer/ACM Mobile Networks and Applications Special Issue: Mobile and Pervasive Commerce 9(6), 557–566 (2004)

    Google Scholar 

  2. Maillé, P., Tuffin, B.: An Auction-Based Pricing Scheme for Bandwidth Sharing with History-Dependent Utility Functions. In: Proc. of the First International Workshop on Incentive Based Computing, France (September 2005)

    Google Scholar 

  3. Maillé, P., Tuffin, B.: The Progressive Second Price Mechanism in a Stochastic Environment. Netnomics 5(2), 119–147 (2003)

    Article  Google Scholar 

  4. FP6-IST-507607 Project B-BONE, http://b-bone.ptinovacao.pt/

  5. Ross, S.: Stochastic Processes. Wiley Series in Probability and Mathematical Statistics (1996), ISBN 0-471-12062-6

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dramitinos, M., Stamoulis, G.D., Courcoubetis, C. (2006). A Random Walk Model for Studying Allocation Patterns in Auction-Based Resource Allocation. In: Stiller, B., Reichl, P., Tuffin, B. (eds) Performability Has its Price. ICQT 2006. Lecture Notes in Computer Science, vol 4033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780502_4

Download citation

  • DOI: https://doi.org/10.1007/11780502_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35456-7

  • Online ISBN: 978-3-540-35457-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics