Sciweavers

43 search results - page 5 / 9
» Online Auction and List Price Revenue Management
Sort
View
WWW
2008
ACM
14 years 8 months ago
Budget constrained bidding in keyword auctions and online knapsack problems
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...
Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Luko...
INFOCOM
2011
IEEE
12 years 11 months ago
To preempt or not: Tackling bid and time-based cheating in online spectrum auctions
—Online spectrum auctions offer ample flexibility for bidders to request and obtain spectrum on-the-fly. Such flexibility, however, opens up new vulnerabilities to bidder mani...
Lara B. Deek, Xia Zhou, Kevin C. Almeroth, Haitao ...
SIGECOM
2006
ACM
93views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
The sequential auction problem on eBay: an empirical analysis and a solution
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...
Adam I. Juda, David C. Parkes
WINE
2009
Springer
202views Economy» more  WINE 2009»
14 years 2 months ago
A New Ranking Scheme of the GSP Mechanism with Markovian Users
Sponsored search auction is used by most search engines to select ads to display on the web page of a search result, according to advertisers’ bidding prices. The income of this ...
Xiaotie Deng, Jiajin Yu
WPES
2005
ACM
14 years 1 months ago
The privacy cost of the second-chance offer
This paper examines a generalization of a two-stage game common on eBay: an ascending-price auction followed by price discrimination (the second chance offer). High bids in the a...
Sumit Joshi, Yu-An Sun, Poorvi L. Vora