Computationally Manageable Combinational Auctions
Management Science
iBundle: an efficient ascending price bundle auction
Proceedings of the 1st ACM conference on Electronic commerce
Approaches to winner determination in combinatorial auctions
Decision Support Systems - Special issue on information and computational economics
AkBA: a progressive, anonymous-price combinatorial auction
Proceedings of the 2nd ACM conference on Electronic commerce
Preference elicitation in combinatorial auctions
Proceedings of the 3rd ACM conference on Electronic Commerce
Combinatorial auctions using rule-based bids
Decision Support Systems
Iterative Combinatorial Auctions: Theory and Practice
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Management Science
On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions
Journal of Heuristics
Decision support for multi-unit combinatorial bundle auctions
Decision Support Systems
A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions
INFORMS Journal on Computing
Iterative Combinatorial Auctions with Bidder-Determined Combinations
Management Science
A New and Improved Design for Multiobject Iterative Auctions
Management Science
An interactive approach for multi-attribute auctions
Decision Support Systems
Hi-index | 0.00 |
In multiple-unit combinatorial auctions both bidders and bid takers can benefit from support mechanisms that suggest new bids for the bidders. We present a support tool called Group Support Mechanism, which suggests bundles of bids to several bidders not among the provisional winners. It improves upon the Quantity Support Mechanism we developed earlier. The efficiency of the final allocation is better when the Group Support Mechanism is used instead of the Quantity Support Mechanism, especially in cases when the efficient allocation consists of three or more bids.