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...
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
We consider the problem of fair allocation in the package assignment model, where a set of indivisible items, held by single seller, must be efficiently allocated to agents with q...
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...
Tuomas Sandholm, Subhash Suri, Andrew Gilpin, Davi...
This paper discusses an on-line Tasks Assignment and Routing Problem(TARP) for Autonomous Transportation Systems(ATSs) in manufacturing systems. The TARP results in a constrained ...