Sciweavers

21 search results - page 3 / 5
» Randomized methods for solving the Winner Determination Prob...
Sort
View
ATAL
2009
Springer
14 years 7 days ago
A mixed multi-unit combinatorial auctions test suite
Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit c...
Andrea Giovannucci, Jesús Cerquides, Ulle E...
ATAL
2010
Springer
13 years 6 months ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish
AAAI
2004
13 years 7 months ago
Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
Craig Boutilier, Tuomas Sandholm, Rob Shields
IJCAI
2001
13 years 7 months ago
CABOB: A Fast Optimal Algorithm for Combinatorial Auctions
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...
CAEPIA
2003
Springer
13 years 11 months ago
Negotiation Support in Highly-Constrained Trading Scenarios
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...
Juan A. Rodríguez-Aguilar, Antonio Reyes-Mo...