48 search results - page 5 / 10 » Seller-Focused Algorithms for Online Auctioning |
WWW
2008
ACM
15 years 10 months ago
2008
ACM
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
SIGECOM
2004
ACM
15 years 3 months ago
2004
ACM
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
AI
2003
Springer
15 years 3 months ago
2003
Springer
The Internet has opened opportunities for efficient on-line trading, and researchers have developed algorithms for various auctions, as well as exchanges for standardized commoditi...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
Bidders on eBay have no dominant bidding strategy when faced with multiple auctions each offering an item of interest. As seen through an analysis of 1,956 auctions on eBay for a...
102
click to vote
SIGECOM
2005
ACM
15 years 3 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...