89 search results - page 4 / 18 » Robust solutions for combinatorial auctions |
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
Mixed Multi-Unit Combinatorial Auctions offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services. Their winner deter...
ATAL
2007
Springer
14 years 2 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...
PPDP
2010
Springer
13 years 7 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
WECWIS
2002
IEEE
14 years 1 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...
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...