68 search results - page 9 / 14 » Optimal Auctions for Spiteful Bidders |
116
click to vote
STOC
2012
ACM
13 years 1 days ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
81
Voted
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...
FC
2009
Springer
15 years 4 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we consider the design of an agent that is able to autonomously make optimal bundling decisions when selling multiple heterogeneous items within existing online auc...
SIGECOM
2003
ACM
15 years 2 months ago
2003
ACM
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...