199 search results - page 5 / 40 » Using a Lagrangian Heuristic for a Combinatorial Auction Pro... |
WLP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
AAAI
2000
13 years 10 months ago
2000
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
GECCO
2009
Springer
14 years 12 days ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
AAAI
2006
13 years 10 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
IAT
2006
IEEE
14 years 2 months ago
2006
IEEE
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...