36 search results - page 3 / 8 » Super Solutions for Combinatorial Auctions |
WECWIS
2002
IEEE
14 years 17 days ago
2002
IEEE
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
WLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
ICTAI
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
AUSAI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by appl...
AAIM
2009
Springer
14 years 2 months ago
2009
Springer
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...