105 search results - page 2 / 21 » A Lower Bound on the Competitive Ratio of Truthful Auctions |
WINE
2005
Springer
13 years 11 months ago
2005
Springer
We give a simple analysis of the competitive ratio of the random sampling auction from [10]. The random sampling auction was first shown to be worst-case competitive in [9] (with ...
WINE
2009
Springer
14 years 23 days ago
2009
Springer
We 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, ...
WINE
2007
Springer
14 years 8 days ago
2007
Springer
We study the problem of hiring a team of selfish agents to perform a task. Each agent is assumed to own one or more elements of a set system, and the auctioneer is trying to purch...
SIGECOM
2005
ACM
13 years 11 months ago
2005
ACM
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
MANSCI
2010
13 years 4 months ago
2010
: Do firms neglect competition when making entry decisions? Using a dataset of 14,973 eBay auctions this paper addresses this question analyzing the time of day at which sellers se...