Auctioning vertically integrated online services: Computational approaches for real-time allocation

Ravi Bapna, Paulo B Goes, Alok Gupta

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

We develop three auction-based pricing and allocation solution methods for the case where a capacity-constrained online service provider offers multiple classes of unique, one-time services with differentiated quality. Consumers desire exactly one of the many service classes offered. We call such a setting a vertically integrated online services market. Examples of these services are webcasting of special events over the Internet, provision of video-on-demand, and allocation of grid computing resources. We model the pricing and allocation decision faced by firms in such a setting as a knapsack problem with an added preference elicitation dimension. We present a variety of computational solution approaches based on adaptations of the traditional greedy heuristic for knapsack problems. The solution approaches vary in efficacy depending on whether bidders are restricted to bid in one service class or allowed to bid in multiple service classes, as well as on the overall variability of the demand. In the case bidders can bid in multiple classes but are interested in consuming only one service class, a direct application of the heuristics developed for the single service case results in a nonfair allocation. We develop a novel data structure to eliminate the unfair allocation while maintaining the original computation complexity of the simpler setting. The paper contributes by presenting a menu of auction clearing mechanisms for selling vertically integrated online services.

Original languageEnglish (US)
Pages (from-to)65-97
Number of pages33
JournalJournal of Management Information Systems
Volume25
Issue number3
DOIs
StatePublished - 2009

Fingerprint

Video on demand
Grid computing
Data structures
Costs
Sales
Internet
Online services
Integrated
Bid
Heuristics
Knapsack problem
Pricing
Auctions

Keywords

  • Auction-based pricing
  • Online services
  • Service classes
  • Service computing
  • Service pricing

ASJC Scopus subject areas

  • Management Information Systems
  • Information Systems and Management
  • Management Science and Operations Research
  • Computer Science Applications

Cite this

Auctioning vertically integrated online services : Computational approaches for real-time allocation. / Bapna, Ravi; Goes, Paulo B; Gupta, Alok.

In: Journal of Management Information Systems, Vol. 25, No. 3, 2009, p. 65-97.

Research output: Contribution to journalArticle

@article{dc3090039e0f478692b121a8ae4d2256,
title = "Auctioning vertically integrated online services: Computational approaches for real-time allocation",
abstract = "We develop three auction-based pricing and allocation solution methods for the case where a capacity-constrained online service provider offers multiple classes of unique, one-time services with differentiated quality. Consumers desire exactly one of the many service classes offered. We call such a setting a vertically integrated online services market. Examples of these services are webcasting of special events over the Internet, provision of video-on-demand, and allocation of grid computing resources. We model the pricing and allocation decision faced by firms in such a setting as a knapsack problem with an added preference elicitation dimension. We present a variety of computational solution approaches based on adaptations of the traditional greedy heuristic for knapsack problems. The solution approaches vary in efficacy depending on whether bidders are restricted to bid in one service class or allowed to bid in multiple service classes, as well as on the overall variability of the demand. In the case bidders can bid in multiple classes but are interested in consuming only one service class, a direct application of the heuristics developed for the single service case results in a nonfair allocation. We develop a novel data structure to eliminate the unfair allocation while maintaining the original computation complexity of the simpler setting. The paper contributes by presenting a menu of auction clearing mechanisms for selling vertically integrated online services.",
keywords = "Auction-based pricing, Online services, Service classes, Service computing, Service pricing",
author = "Ravi Bapna and Goes, {Paulo B} and Alok Gupta",
year = "2009",
doi = "10.2753/MIS0742-1222250302",
language = "English (US)",
volume = "25",
pages = "65--97",
journal = "Journal of Management Information Systems",
issn = "0742-1222",
publisher = "M.E. Sharpe Inc.",
number = "3",

}

TY - JOUR

T1 - Auctioning vertically integrated online services

T2 - Computational approaches for real-time allocation

AU - Bapna, Ravi

AU - Goes, Paulo B

AU - Gupta, Alok

PY - 2009

Y1 - 2009

N2 - We develop three auction-based pricing and allocation solution methods for the case where a capacity-constrained online service provider offers multiple classes of unique, one-time services with differentiated quality. Consumers desire exactly one of the many service classes offered. We call such a setting a vertically integrated online services market. Examples of these services are webcasting of special events over the Internet, provision of video-on-demand, and allocation of grid computing resources. We model the pricing and allocation decision faced by firms in such a setting as a knapsack problem with an added preference elicitation dimension. We present a variety of computational solution approaches based on adaptations of the traditional greedy heuristic for knapsack problems. The solution approaches vary in efficacy depending on whether bidders are restricted to bid in one service class or allowed to bid in multiple service classes, as well as on the overall variability of the demand. In the case bidders can bid in multiple classes but are interested in consuming only one service class, a direct application of the heuristics developed for the single service case results in a nonfair allocation. We develop a novel data structure to eliminate the unfair allocation while maintaining the original computation complexity of the simpler setting. The paper contributes by presenting a menu of auction clearing mechanisms for selling vertically integrated online services.

AB - We develop three auction-based pricing and allocation solution methods for the case where a capacity-constrained online service provider offers multiple classes of unique, one-time services with differentiated quality. Consumers desire exactly one of the many service classes offered. We call such a setting a vertically integrated online services market. Examples of these services are webcasting of special events over the Internet, provision of video-on-demand, and allocation of grid computing resources. We model the pricing and allocation decision faced by firms in such a setting as a knapsack problem with an added preference elicitation dimension. We present a variety of computational solution approaches based on adaptations of the traditional greedy heuristic for knapsack problems. The solution approaches vary in efficacy depending on whether bidders are restricted to bid in one service class or allowed to bid in multiple service classes, as well as on the overall variability of the demand. In the case bidders can bid in multiple classes but are interested in consuming only one service class, a direct application of the heuristics developed for the single service case results in a nonfair allocation. We develop a novel data structure to eliminate the unfair allocation while maintaining the original computation complexity of the simpler setting. The paper contributes by presenting a menu of auction clearing mechanisms for selling vertically integrated online services.

KW - Auction-based pricing

KW - Online services

KW - Service classes

KW - Service computing

KW - Service pricing

UR - http://www.scopus.com/inward/record.url?scp=66549084008&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=66549084008&partnerID=8YFLogxK

U2 - 10.2753/MIS0742-1222250302

DO - 10.2753/MIS0742-1222250302

M3 - Article

AN - SCOPUS:66549084008

VL - 25

SP - 65

EP - 97

JO - Journal of Management Information Systems

JF - Journal of Management Information Systems

SN - 0742-1222

IS - 3

ER -