Sciweavers

3433 search results - page 3 / 687
» Heuristics for a bidding problem
Sort
View
WWW
2007
ACM
14 years 8 months ago
Dynamics of bid optimization in online advertisement auctions
We consider the problem of online keyword advertising auctions among multiple bidders with limited budgets, and study a natural bidding heuristic in which advertisers attempt to o...
Christian Borgs, Jennifer T. Chayes, Nicole Immorl...
AMEC
2004
Springer
14 years 28 days ago
An Options-Based Method to Solve the Composability Problem in Sequential Auctions
Abstract. Current auctions often expose bidding agents to two difficult, yet common, problems. First, bidding agents often have the opportunity to participate in successive auctio...
Adam I. Juda, David C. Parkes
ECAI
2006
Springer
13 years 11 months ago
Heuristic Bidding Strategies for Multiple Heterogeneous Auctions
Abstract. This paper investigates utility maximising bidding heuristics for agents that participate in multiple heterogeneous auctions, in which the auction format and the starting...
David C. K. Yuen, Andrew Byde, Nicholas R. Jenning...
EOR
2007
68views more  EOR 2007»
13 years 7 months ago
Multiattribute electronic procurement using goal programming
One of the key challenges of current day electronic procurement systems is to enable procurement decisions transcend beyond a single attribute such as cost. Consequently, multiatt...
S. Kameshwaran, Y. Narahari, Charles H. Rosa, Deva...
IPL
2010
93views more  IPL 2010»
13 years 6 months ago
Randomized algorithms for online bounded bidding
In the online bidding problem, a bidder is trying to guess a positive number T, by placing bids until the value of the bid is at least T. The bidder is charged with the sum of the...
Leah Epstein, Asaf Levin