68 search results - page 10 / 14 » Integer Programming for Combinatorial Auction Winner Determi... |
CAEPIA
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. Negotiation events in industrial procurement involving multiple, highly customisable goods pose serious challenges to buyers when trying to determine the best set of prov...
CCIA
2005
Springer
15 years 3 months 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...
104
click to vote
FOCS
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
AAAI
2004
14 years 11 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...
116
click to vote
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...