Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Computationally Manageable Combinational Auctions
Management Science
Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics
Proceedings of the 2nd ACM conference on Electronic commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Winner determination in combinatorial auction generalizations
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
An Algorithm for Multi-Unit Combinatorial Auctions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
BOB: improved winner determination in combinatorial auctions and generalizations
Artificial Intelligence
Incentive compatible multi unit combinatorial auctions
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Incompletely specified combinatorial auction: an alternative allocation mechanism for business-to-business negotiations
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Combinatorial Auctions
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
Management Science
Poster: co-allocation based scheduling for parallel systems
Proceedings of the 2011 companion on High Performance Computing Networking, Storage and Analysis Companion
Hi-index | 0.01 |
Single unit combinatorial auction problem (CAP) and its multi-unit extension have received a lot of attention recently. This paper introduces yet another variant of CAP which generalizes the multi-unit CAP further to allow bids on collections of items that can come from bidder defined classes of items. A bidder may be indifferent to some items with different brands, specifications or qualities and consider them as substitutable. In this case, these items can be put in a class and hence the bids can be made by referring to the items in such classes. This model enables the bidder to express his requests by using less number of bids in case he does not discriminate between different items. Because of this, we call this problem multi-unit nondiscriminatory combinatorial auction (MUNCA) problem. An integer programming formulation is given for this problem. Since this problem is NP-hard, two fast heuristic algorithms have also been designed. The heuristics give quite good solutions when compared to the optimal solution.