549 search results - page 7 / 110 » Computational Bundling for Auctions |
ACMICEC
2007
ACM
14 years 2 months ago
2007
ACM
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...
SIGECOM
2003
ACM
14 years 4 months ago
2003
ACM
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efïŹcient mechanisms for selling items to bidders, and are attractive when the biddersâ...
AAAI
2010
14 years 10 days ago
2010
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
IAT
2009
IEEE
14 years 5 months ago
2009
IEEE
As the use of automated negotiations becomes more mainstream, one key attribute that needs to be incorporated is a measure of a sellerâs trust or reliability. In this paper, we ...
ATAL
2004
Springer
14 years 4 months ago
2004
Springer
Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among ...