Sciweavers

243 search results - page 25 / 49
» On Optimal Single-Item Auctions
Sort
View
AAAI
2008
13 years 9 months ago
Efficient Metadeliberation Auctions
Imagine a resource allocation scenario in which the interested parties can, at a cost, individually research ways of using the resource to be allocated, potentially increasing the...
Ruggiero Cavallo, David C. Parkes
SIGECOM
2009
ACM
110views ECommerce» more  SIGECOM 2009»
14 years 1 months ago
On random sampling auctions for digital goods
In the context of auctions for digital goods, an interesting Random Sampling Optimal Price auction (RSOP) has been proposed by Goldberg, Hartline and Wright; this leads to a truth...
Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasa...
ATAL
2006
Springer
13 years 11 months ago
Sequences of take-it-or-leave-it offers: near-optimal auctions without full valuation revelation
Abstract. We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to retain much of their private valuation information, yet generates close-...
Tuomas Sandholm, Andrew Gilpin
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...
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner