60 search results - page 2 / 12 » Optimizing auctioneer's revenues in expanding multi-unit auc... |
Publication
Our attention is focused on designing an optimal procurement mechanism which a buyer can use for procuring multiple units of a homogeneous item based on bids submitted by autonomou...
AAAI
2000
13 years 6 months ago
2000
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously ...
JAIR
2010
13 years 3 months ago
2010
We present an incentive-compatible polynomial-time approximation scheme for multiunit auctions with general k-minded player valuations. The mechanism fully optimizes over an appro...
ACMICEC
2007
ACM
13 years 9 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...
AAAI
2004
13 years 6 months ago
2004
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...