101 search results - page 2 / 21 » Solving Combinatorial Auctions Using Stochastic Local Search |
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...
FC
2009
Springer
14 years 2 months ago
2009
Springer
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
AAAI
2000
13 years 9 months ago
2000
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...