Sciweavers

199 search results - page 4 / 40
» Using a Lagrangian Heuristic for a Combinatorial Auction Pro...
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Time constraints in mixed multi-unit combinatorial auctions
We extend the framework of mixed multi-unit combinatorial auctions to include time constraints, present an expressive bidding language, and show how to solve the winner determinati...
Andreas Witzel, Ulle Endriss
FC
2009
Springer
118views Cryptology» more  FC 2009»
14 years 3 months ago
Cryptographic Combinatorial Clock-Proxy Auctions
We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The “clock phase” functions as a trust...
David C. Parkes, Michael O. Rabin, Christopher Tho...
CEC
2008
IEEE
14 years 3 months ago
Differential evolution for discrete optimization: An experimental study on Combinatorial Auction problems
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
Jingqiao Zhang, Viswanath Avasarala, Arthur C. San...
ATAL
2007
Springer
14 years 2 months ago
Bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
Benito Mendoza García, José M. Vidal
COR
2011
13 years 3 months ago
A Lagrangian heuristic for satellite range scheduling with resource constraints
The task of scheduling communications between satellites and ground control stations is getting more and more critical since an increasing number of satellites must be controlled ...
Fabrizio Marinelli, Salvatore Nocella, Fabrizio Ro...