Sciweavers

3433 search results - page 146 / 687
» Heuristics for a bidding problem
Sort
View
ICS
2010
Tsinghua U.
16 years 3 months ago
Beyond Equilibria: Mechanisms for Repeated Combinatorial Auctions
: We study the design of mechanisms in combinatorial auction domains. We focus on settings where the auction is repeated, motivated by auctions for licenses or advertising space. W...
Brendan Lucier
ICDM
2006
IEEE
129views Data Mining» more  ICDM 2006»
16 years 17 days ago
Keyword Generation for Search Engine Advertising
Keyword3 generation for search engine advertising is an important problem for sponsored search or paidplacement advertising. A recent strategy in this area is bidding on nonobviou...
Amruta Joshi, Rajeev Motwani
SIGECOM
2003
ACM
119views ECommerce» more  SIGECOM 2003»
15 years 11 months ago
Preference elicitation in proxied multiattribute auctions
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as qualit...
Aditya V. Sunderam, David C. Parkes
ICMAS
2000
15 years 7 months ago
Integer Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...
Arne Andersson, Mattias Tenhunen, Fredrik Ygge
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
15 years 7 months ago
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...
Emmanouil Pountourakis, Angelina Vidali