199 search results - page 6 / 40 » Using a Lagrangian Heuristic for a Combinatorial Auction Pro... |
DATE
2000
IEEE
14 years 4 days ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
JIFS
2007
13 years 8 months ago
2007
We present a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids, and which works for au...
SIGECOM
2005
ACM
14 years 2 months ago
2005
ACM
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
HM
2007
Springer
14 years 12 days ago
2007
Springer
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
ATAL
2006
Springer
14 years 8 days ago
2006
Springer
The VCG mechanism is the canonical method for motivating bidders in combinatorial auctions and exchanges to bid truthfully. We study two related problems concerning the VCG mechan...