A Novel Auction Mechanism for Selling Time-Sensitive E-Services

Abstract

Many e-services are time-sensitive as the users request them for a specific time period. Such services need to be repeatedly offered to keep them constantly utilized. This paper studies winner selection strategies in a recurring auction for such time-sensitive e-services. We observe that because of uneven wealth distribution, the least wealthy bidders tend to drop out of recurring auction as they persistently loose. The bidders dropping out of an auction decrease competition and can cause a collapse of winning prices. We propose and evaluate a novel auction mechanism that enables bidder drop control. Compared to traditional auction mechanisms, ours increases revenue of the e-service provider and decreases loss of fairness of the e-service allocation.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 39 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.