41 search results - page 8 / 9 » A Lagrangian Heuristic for Winner Determination Problem in C... |
CCIA
2005
Springer
14 years 27 days ago
2005
Springer
In this paper we extend the notion of multi-unit combinatorial reverse auction by adding a new dimension to the goods at auction. In such a new type of combinatorial auction a buye...
AAAI
2004
13 years 8 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
IAT
2003
IEEE
14 years 19 days ago
2003
IEEE
Multi-item, multi-unit negotiations in industrial procurement pose serious challenges to buying agents when trying to determine the best set of providering agents’ offers. Typic...
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...