Sciweavers

243 search results - page 41 / 49
» On Optimal Single-Item Auctions
Sort
View
WWW
2008
ACM
14 years 8 months ago
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
Yunhong Zhou, Victor Naroditskiy
WECWIS
2005
IEEE
99views ECommerce» more  WECWIS 2005»
14 years 28 days ago
Service Allocation for Composite Web Services Based on Quality Attributes
Web services are software artifacts that can be accessed over the Internet. They can be seen as pay-per-view functionalities that are exposed by some service providers. If there a...
Shahram Esmaeilsabzali, Kate Larson
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 18 days ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 6 months ago
Mechanism Design via Correlation Gap
For revenue and welfare maximization in singledimensional Bayesian settings, Chawla et al. (STOC10) recently showed that sequential posted-price mechanisms (SPMs), though simple i...
Qiqi Yan
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
14 years 7 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson