Skip to main content

Dynamic Pricing and Automated Resource Allocation for Complex Information Services

Reinforcement Learning and Combinatorial Auctions

  • Book
  • © 2007

Overview

Part of the book series: Lecture Notes in Economics and Mathematical Systems (LNE, volume 589)

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

Access this book

eBook USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 129.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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

Keywords

About this book

Many firms provide their customers with online information products which require limited resources such as server capacity. This book develops allocation mechanisms that aim to ensure an efficient resource allocation in modern IT-services. Recent methods of artificial intelligence, such as neural networks and reinforcement learning, and nature-oriented optimization methods, such as genetic algorithms and simulated annealing, are advanced and applied to allocation processes in distributed IT-infrastructures, e.g. grid systems. The author presents two methods, both of which using the users’ willingness-to-pay to control the allocation process: The first approach uses a yield management method that tries to learn an optimal acceptance strategy for resource requests. The second method is a combinatorial auction able to deal with resource complementarities. The author finally generates a method to calculate dynamic resource prices, marking an important step towards the industrialization of grid systems.

Authors and Affiliations

  • Faculty of Economics and Business Administration, Johann Wolfgang Goethe University, Frankfurt am Main, Germany

    Michael Schwind

Bibliographic Information

Publish with us