199 search results - page 2 / 40 » Using a Lagrangian Heuristic for a Combinatorial Auction Pro... |
IJCAI
2001
13 years 6 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
IJCAI
2001
13 years 6 months ago
2001
This paper presents a method for designing bundles in a combinatorial auction protocol that is robust against false-name bids. Internet auctions have become an integral part of El...
AI
2002
Springer
13 years 5 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
EOR
2008
13 years 5 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...