11 search results - page 1 / 3 » On the Sensitivity of Incremental Algorithms for Combinatori... |
WECWIS
2002
IEEE
14 years 10 days 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
14 years 21 days ago
2003
ACM
Combinatorial auctions are difficult to analyze in part because of the vast number of potential strategies available to the bidders. Proxy bidding interfaces limit the users’ s...
AI
2002
Springer
13 years 7 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
SIGECOM
2003
ACM
14 years 20 days ago
2003
ACM
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
ATAL
2004
Springer
14 years 25 days ago
2004
Springer
Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among ...