12 search results - page 2 / 3 » Winner determination for combinatorial auctions for tasks wi... |
IAT
2006
IEEE
13 years 11 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...
WECWIS
2002
IEEE
13 years 9 months ago
2002
IEEE
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
ACMICEC
2003
ACM
13 years 10 months ago
2003
ACM
We discuss 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. We are interested in b...
CAEPIA
2009
Springer
13 years 6 months ago
2009
Springer
Mixed Multi-Unit Combinatorial Auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, little is known about the fac...
ACMICEC
2007
ACM
13 years 9 months ago
2007
ACM
This paper presents a decentralized task allocation method that can handle allocation of tasks with time and precedence constraints in a multi-agent setting where not all informat...