549 search results - page 14 / 110 » Computational Bundling for Auctions |
109
click to vote
SIGECOM
2000
ACM
15 years 4 months ago
2000
ACM
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
CMPB
2006
14 years 11 months ago
2006
106
click to vote
IOR
2011
14 years 3 months ago
2011
Consider selling bundles of indivisible goods to buyers with concave utilities that are additively separable in money and goods. We propose an ascending auction for the case when ...
105
click to vote
CORR
2006
Springer
14 years 11 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
167
click to vote
CAEPIA
2011
Springer
13 years 11 months ago
2011
Springer
Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to be employed for the automated assembly of supply chains of agents. However, in order for mixed auctions ...