41 search results - page 7 / 9 » A Lagrangian Heuristic for Winner Determination Problem in C... |
AAAI
2004
13 years 8 months ago
2004
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
IJCAI
2007
13 years 8 months ago
2007
We study auction-like algorithms for the distributed allocation of tasks to cooperating agents. To reduce the team cost of sequential single-item auction algorithms, we generalize...
SIGECOM
2003
ACM
14 years 18 days ago
2003
ACM
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the bidders...
FOCS
2008
IEEE
13 years 8 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...
CAEPIA
2003
Springer
14 years 18 days 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...