An Online Multi-unit Auction with Improved Competitive Ratio

Simple item page
dc.creatorChakraborty, Sourav
dc.creatorDevanur, Nikhil
dc.date2009-01-11
dc.date.accessioned2026-07-07T12:28:19Z
dc.date.available2026-07-07T12:28:19Z
dc.descriptionWe improve the best known competitive ratio (from 1/4 to 1/2), for the online multi-unit allocation problem, where the objective is to maximize the single-price revenue. Moreover, the competitive ratio of our algorithm tends to 1, as the bid-profile tends to ``smoothen''. This algorithm is used as a subroutine in designing truthful auctions for the same setting: the allocation has to be done online, while the payments can be decided at the end of the day. Earlier, a reduction from the auction design problem to the allocation problem was known only for the unit-demand case. We give a reduction for the general case when the bidders have decreasing marginal utilities. The problem is inspired by sponsored search auctions.
dc.identifierhttps://arxiv.org/abs/0901.1427
dc.identifierhttp://arxiv.org/abs/0901.1427
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/215501
dc.subjectComputer Science and Game Theory
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.titleAn Online Multi-unit Auction with Improved Competitive Ratio
dc.typetext

Files

Collections

arXiv