220 search results - page 17 / 44 » Combinatorial auctions with externalities |
AAAI
2000
14 years 11 months ago
2000
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously ...
SIGECOM
2003
ACM
15 years 3 months ago
2003
ACM
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the bidders...
103
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...