48 search results - page 4 / 10 » Seller-Focused Algorithms for Online Auctioning |
ESA
2007
Springer
15 years 3 months ago
2007
Springer
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-...
AAAI
2007
15 years 1 days ago
2007
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
WINE
2009
Springer
15 years 4 months 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, ...
JACM
2006
14 years 9 months ago
2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
GRAPHICSINTERFACE
2001
14 years 11 months ago
2001
This paper describes the integration of perceptual guidelines from human vision with an AI-based mixed-initiative search technique. The result is a visualization assistant, a syst...