Integer and combinatorial optimization
Integer and combinatorial optimization
Computationally Manageable Combinational Auctions
Management Science
Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Introduction to Linear Optimization
Introduction to Linear Optimization
BOB: improved winner determination in combinatorial auctions and generalizations
Artificial Intelligence
Iterative combinatorial auctions: achieving economic and computational efficiency
Iterative combinatorial auctions: achieving economic and computational efficiency
Combinatorial Auctions
Optimal buying from online retailers offering total value discounts
Proceedings of the 10th international conference on Electronic commerce
Branch on price: a fast winner determination algorithm for discount auctions
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Winner determination in discount auctions
WINE'05 Proceedings of the First international conference on Internet and Network Economics
| Hi-index | 0.00 |
e-Procurement is an Internet based business process for sourcing direct or indirect materials. In this paper we propose an auction mechanism called as discount auctions for procuring multiple items. The bid from a supplier consists of individual costs for each of the items and a discount function, which specifies the discount over the number of items. We show that such a bid is more meaningful and cost effective in terms of bid preparation and communication in common procurement scenarios. The bid evaluation problem is modeled as a mixed integer linear program and various structures in the problem that can be exploited for developing algorithms are explored. A heuristic based on linear programming relaxation is proposed to determine a feasible solution to the problem and its closeness to optimality is studied with computational experiments.