Discover millions of ebooks, audiobooks, and so much more with a free trial

Only $11.99/month after trial. Cancel anytime.

Analysis of Auctions for Service Allocation
Analysis of Auctions for Service Allocation
Analysis of Auctions for Service Allocation
Ebook88 pages53 minutes

Analysis of Auctions for Service Allocation

Rating: 0 out of 5 stars

()

Read preview

About this ebook

This is an Ebook for the readers of sujects of Auctions, Theory, Queueing theory, Networking, etc.I reprint my works based on some of my works at Imperial College and personal works at Korea through the unintetional sabbatical years.
LanguageEnglish
Release dateFeb 10, 2015
ISBN9781634133821
Analysis of Auctions for Service Allocation

Related to Analysis of Auctions for Service Allocation

Related ebooks

Computers For You

View More

Related articles

Reviews for Analysis of Auctions for Service Allocation

Rating: 0 out of 5 stars
0 ratings

0 ratings0 reviews

What did you think?

Tap to rate

Review must be at least 10 words

    Book preview

    Analysis of Auctions for Service Allocation - Gunhwan Kim

    followed.

    Chapter 1

    Preface-Introduction

    Allocation is a common problem that can be observed almost every applications. Suppose there exist service providers that want to supply large quantity of resources and many users that demand those resources. Consequently, issues arise on how the resources should be allocated to the users having specific requirements and valuations for using those resources. In many cases, due to heterogeneity of types, massiveness of the amount of resources, and uncertainty of demands of users, the resource providers themselves may experience difficulty in determining the resource allocations or prices. Thus they may feel the needs of automation for determining resource allocations and corresponding prices due to the reasons such as to maximize the utilization or profit. Auction models are helpful in that they can provide market based mechanisms that can determine the resource allocations and corresponding prices on the basis of demands of the users who may consume the resources and the supply of the providers that may own the resources.

    In this article, we present a novel mathematical model to predict and evaluate the performance of market based resource allocation which uses auctions in allocating service slots of the systems. For instance, resources such as service processing capability of systems or radio resources like channel or bandwidth for mobile networks could be considered. Especially, we speculate the situation that auctions are used for resource allocations on a time slot basis. The allocation mechanism considered in this model allocates recurring free service slots through auctions using parallelism as soon as service slots are available to achieve its maximum utilization.

    There have been researches that try to employ auctions or economic models in resource allocation of networks or computing systems, for instance, [35], [7], [33]. In [35], they sought to employ auctions or economic models in the perspectives of algorithm design or platform development. In [7], considering the situation where the dynamic arrival and departures of agents having types of which distribution is known, the on-line mechanisms such as VCG-type auctions were studied. In [33], they studied the problem of allocating network capacity through the periodic auctions with Makrov Decision Process (MDP) for optimal revenue problem over general network topology.

    On the other hand, there have been researches regarding auctions or auction mechanism, for instance, [1], [2], [3], [4], [5], [6]. In [1], an auction model was considered where the number of bidders are coming from a pool of potential bidders. They showed that at equilibrium each potential bidder has a fixed probability of participating at the auction, thus the number of bidders was described by a binomial distribution. In on-line setting [4], they suggested that Poisson distribution is an appropriate approximation for the binomial distribution proposed by [1]. Their assumptions were in on-line auctions the pool of potential bidders is very large, and among them only a small fraction of bidders participate in an individual auction. The work in [2] on discrete bid levels was done on the basis of describing the number of bidders participating in any auction by Poisson distribution. Efficient allocation of goods in an on-line type auction setting considering dynamic arrival and departure of bidders was studied in [3], based on the competitive analysis with an emphasis on incentive-compatibility. In [5], stochastic analysis on the interaction between bidders and a seller was presented for the single item sequential automated English auction where the bidders’ bid arrives at a random time interval increasing a bid and the auctioneer decides the acceptance of the bid. In [6] which is an extension for the process model for automated English auctions in [5], mobile bidder model was presented for automated English auctions, where any bidder, except for the one who has made the most recent bid, is allowed to move at any time from one auction to another one, or to depart from the whole auction systems. Approximated product form solutions about the auction states were presented with active bidders assumption and more frequent auction activity, such as bidding and selling, assumption.

    In [17], economic models like commodity market, spot market, and contract net for resource management and scheduling in Grid computing were studied. Because resources in the Grid are heterogeneous and geographically distributed, the management of resources and application scheduling in distributed environment is a complex task. They provide a distributed computational economy for the effective management of resources and application scheduling such as deadline and budget constrained scheduling. The framework provides requirements, mechanism, discussion of tool-kits and resource broker and experimental evaluations are provided. In [35], they proposed GRIMP (Grid Marketplace), a generic framework that provides services to support spontaneous creation of grid resources markets on demand

    Enjoying the preview?
    Page 1 of 1