Analysis of Auctions for Service Allocation
By Gunhwan Kim
()
About this ebook
Related to Analysis of Auctions for Service Allocation
Related ebooks
Pricing Types: Signalling Market Positioning Intent Rating: 0 out of 5 stars0 ratingsAlgorithmic Trading Methods: Applications Using Advanced Statistics, Optimization, and Machine Learning Techniques Rating: 0 out of 5 stars0 ratingsCloud Brokering Rating: 0 out of 5 stars0 ratingsPlanning, Negotiating, Implementing, and Managing Wide Area Networks: A Practical Guide Rating: 0 out of 5 stars0 ratingsBudget Constraints and Optimization in Sponsored Search Auctions Rating: 0 out of 5 stars0 ratingsSupply Chain Performance and Evaluation Models Rating: 0 out of 5 stars0 ratingsPortfolio Optimization with Different Information Flow Rating: 0 out of 5 stars0 ratingsModeling of Transport Demand: Analyzing, Calculating, and Forecasting Transport Demand Rating: 0 out of 5 stars0 ratingsService Computing: Concept, Method and Technology Rating: 0 out of 5 stars0 ratingsA Collection of Service Essays: A Practical Approach Rating: 0 out of 5 stars0 ratingsCyber-Physical Systems: Foundations, Principles and Applications Rating: 0 out of 5 stars0 ratingsJournals of Regulatory Frame Work in Malawi: Book 1 Rating: 0 out of 5 stars0 ratingsQuality of Experience Paradigm in Multimedia Services: Application to OTT Video Streaming and VoIP Services Rating: 0 out of 5 stars0 ratingsAppraising Business Opportunities: The Stratisquare Framework Rating: 0 out of 5 stars0 ratingsDynamic Analysis of High-Speed Railway Alignment: Theory and Practice Rating: 4 out of 5 stars4/5Introduction to Network Traffic Flow Theory: Principles, Concepts, Models, and Methods Rating: 0 out of 5 stars0 ratingsTraffic Congestion and Land Use Regulations: Theory and Policy Analysis Rating: 0 out of 5 stars0 ratingsPublic Transportation Quality of Service: Factors, Models, and Applications Rating: 5 out of 5 stars5/5Service Breakthroughs Rating: 0 out of 5 stars0 ratingsQuality of Experience Engineering for Customer Added Value Services: From Evaluation to Monitoring Rating: 0 out of 5 stars0 ratingsSustainable Asset Management: AI & Blockchain Unleashed Rating: 0 out of 5 stars0 ratingsVending Machine Route Planning Strategies Plan Rating: 0 out of 5 stars0 ratingsSupply Chain and Procurement Quick Reference: How to navigate and be successful in structured organizations Rating: 0 out of 5 stars0 ratingsTrading Systems and Methods Rating: 5 out of 5 stars5/5Mastering Procurement Management: Rating: 0 out of 5 stars0 ratingsComputational Materials Engineering: Achieving High Accuracy and Efficiency in Metals Processing Simulations Rating: 0 out of 5 stars0 ratingsManufacturing: Engineering, Management and Marketing Rating: 0 out of 5 stars0 ratingsMaintenance Management in Network Utilities: Framework and Practical Implementation Rating: 0 out of 5 stars0 ratingsCleaning Business Pricing Strategies Rating: 0 out of 5 stars0 ratingsThe Ultimate Guide to Unlocking the Full Potential of Cloud Services: Tips, Recommendations, and Strategies for Success Rating: 0 out of 5 stars0 ratings
Computers For You
The Invisible Rainbow: A History of Electricity and Life Rating: 4 out of 5 stars4/5Elon Musk Rating: 4 out of 5 stars4/5Slenderman: Online Obsession, Mental Illness, and the Violent Crime of Two Midwestern Girls Rating: 4 out of 5 stars4/5Standard Deviations: Flawed Assumptions, Tortured Data, and Other Ways to Lie with Statistics Rating: 4 out of 5 stars4/5The ChatGPT Millionaire Handbook: Make Money Online With the Power of AI Technology Rating: 0 out of 5 stars0 ratingsSQL QuickStart Guide: The Simplified Beginner's Guide to Managing, Analyzing, and Manipulating Data With SQL Rating: 4 out of 5 stars4/5101 Awesome Builds: Minecraft® Secrets from the World's Greatest Crafters Rating: 4 out of 5 stars4/5Mastering ChatGPT: 21 Prompts Templates for Effortless Writing Rating: 5 out of 5 stars5/5Everybody Lies: Big Data, New Data, and What the Internet Can Tell Us About Who We Really Are Rating: 4 out of 5 stars4/5Practical Lock Picking: A Physical Penetration Tester's Training Guide Rating: 5 out of 5 stars5/5Dark Aeon: Transhumanism and the War Against Humanity Rating: 5 out of 5 stars5/5The Hacker Crackdown: Law and Disorder on the Electronic Frontier Rating: 4 out of 5 stars4/5How to Create Cpn Numbers the Right way: A Step by Step Guide to Creating cpn Numbers Legally Rating: 4 out of 5 stars4/5CompTIA IT Fundamentals (ITF+) Study Guide: Exam FC0-U61 Rating: 0 out of 5 stars0 ratingsThe Professional Voiceover Handbook: Voiceover training, #1 Rating: 5 out of 5 stars5/5Procreate for Beginners: Introduction to Procreate for Drawing and Illustrating on the iPad Rating: 0 out of 5 stars0 ratingsGrokking Algorithms: An illustrated guide for programmers and other curious people Rating: 4 out of 5 stars4/5CompTIA Security+ Practice Questions Rating: 2 out of 5 stars2/5Alan Turing: The Enigma: The Book That Inspired the Film The Imitation Game - Updated Edition Rating: 4 out of 5 stars4/5Deep Search: How to Explore the Internet More Effectively Rating: 5 out of 5 stars5/5Ultimate Guide to Mastering Command Blocks!: Minecraft Keys to Unlocking Secret Commands Rating: 5 out of 5 stars5/5Computer Science: A Concise Introduction Rating: 4 out of 5 stars4/5Master Builder Roblox: The Essential Guide Rating: 4 out of 5 stars4/5Creating Online Courses with ChatGPT | A Step-by-Step Guide with Prompt Templates Rating: 4 out of 5 stars4/5
Reviews for Analysis of Auctions for Service Allocation
0 ratings0 reviews
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