Auction management with business-volume discount

• US 8,036,950 B1
• Filed: 02/20/2002
• Issued: 10/11/2011
• Est. Priority Date: 02/20/2002
• Status: Active Grant

• Current Assignee: Snap, Inc.
• Original Assignee: Emptoris Incorporated (International Business Machines Corporation)
• Inventors: Rosa, Charles H., Li, Ge, Schneur, Rina Rotshild, Schneur, Avner
• Primary Examiner(s): SHAAWAT, MUSSA A
• Application Number:
  US10/081,411
• Time in Patent Office: 3,520 Days
• Field of Search: None
• US Class Current: 705/26.4
• CPC Class Codes: G06Q 10/087 Inventory or stock management, e.g. order filling, procurement or balancing against orders
• CPC Class Codes: G06Q 30/0611 Request for offers or quotes
• CPC Class Codes: G06Q 30/08 Auctions
• CPC Class Codes: G06Q 40/04 Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Abstract

A computer-implemented method for satisfying a purchase requisition includes receiving, from each of a plurality of candidate suppliers, a corresponding plurality of bids. At least one candidate supplier includes, with its bids, an offer of a business-volume discount that is triggered when an aggregate purchase of at least one unit of a first item and at least one unit of a second item is within a defined volume interval. An optimal award schedule for satisfaction of the purchase requisition is then determined.

Claims

1. A computer-implemented method for determining an optimal award schedule for satisfying a purchase requisition, the method comprising:

receiving over a computer network, from each of a plurality of candidate suppliers, a corresponding plurality of bids;

receiving, from a candidate supplier over said computer network, an explicit offer of a business-volume discount that is triggered when a purchase from the candidate supplier of at least one unit of a first qualifying item and at least one unit of a second qualifying item has an aggregated volume within a defined volume interval; and

determining by a processor an optimal award schedule comprising an optimal combination of candidate suppliers and a list of items to be ordered from each supplier to at least partially satisfy the purchase requisition utilizing the explicit offer of a business volume discount.

2. The method of claim 1, wherein receiving a business-volume discount offer comprises receiving a business-volume discount offer in which a business-volume discount is triggered on the basis of purchases of items belonging a first category of items and no business-volume discount is triggered on the basis of purchases of items belonging to a second category of items.

3. The method of claim 2, wherein receiving a corresponding plurality of bids comprises receiving, from the at least one candidate supplier, a first bid in which each item recited in the first bid belongs to no more that one item-category.

4. The method of claim 2, wherein receiving a corresponding plurality of bids comprises receiving, from the at least one candidate supplier, a first bid in which at least one item recited in the first bid belongs to both a first item-category and a second item-category.

5. The method of claim 4, wherein determining an optimal award schedule comprises constraining the optimal award schedule such that a purchase of the at least one qualifying item contributes to a business volume discount associated with at most one of the first and second item-categories.

6. The method of claim 1, wherein receiving an offer of a business-volume discount comprises receiving a business-volume discount offer that defines a plurality of volume intervals, each of the volume intervals being associated with a corresponding discount to be offered when the volume of an aggregate purchase of at least two qualifying items from the at least one candidate supplier is within the volume interval.

7. The method of claim 1, wherein receiving an offer of a business-volume discount comprises receiving a business-volume discount offer in which the defined volume interval has a lower bound defined by a volume threshold and no upper bound.

15. The method of claim 1 further comprising imposing, by a party other than a candidate supplier, a private buyer constraint prior to determining the optimal award schedule.

16. The method of claim 15 further comprising changing an imposed private buyer constraint and redetermining the optimal award schedule using the changed private buyer constraint.

17. The method of claim 1 further comprising storing a supplier profile corresponding to a candidate supplier.

18. The method of claim 17 wherein determining an optimal award schedule considers a stored supplier profile corresponding to a candidate supplier.

8. A non-transitory computer-readable medium having encoded thereon software for satisfying a purchase requisition, the software comprising instructions for:

receiving, from each of a plurality of candidate suppliers, a corresponding plurality of bids;

receiving, from a candidate supplier, an explicit offer of a business-volume discount that is triggered when a purchase from the candidate supplier of at least one unit of a first qualifying item and at least one unit of a second qualifying item has an aggregated volume within a defined volume interval; and

determining by a processor an optimal award schedule comprising an optimal combination of candidate suppliers and a list of items to be ordered from each supplier to at least partially satisfy the purchase requisition utilizing the explicit offer of a business volume discount.

9. The computer-readable medium of claim 8, wherein the instructions for receiving a business-volume discount offer comprise instructions for receiving a business-volume discount offer in which a business-volume discount is triggered on the basis of purchases of items belonging a first category of items and no business-volume discount is triggered on the basis of purchases of items belonging to a second category of items.

10. The computer-readable medium of claim 9, wherein the instructions for receiving a corresponding plurality of bids comprise instructions for receiving, from the at least one candidate supplier, a first bid in which each item recited in the first bid belongs to no more than one item-category.

11. The computer-readable medium of claim 9, wherein the instructions for receiving a corresponding plurality of bids comprise instructions for receiving, from the at least one candidate supplier, a first bid in which at least one item recited in the first bid belongs to both a first item-category and a second item-category.

12. The computer-readable medium of claim 11, wherein the instructions for determining an optimal award schedule comprise instructions for constraining the optimal award schedule such.

13. The computer-readable medium of claim 8, wherein the instructions for receiving an offer of a business-volume discount comprise instructions for receiving a business-volume discount offer that defines a plurality of volume intervals, each of the volume intervals being associated with a corresponding discount to be offered when the volume of an aggregate purchase of at least qualifying two items from the at least one candidate supplier is within the volume interval.

14. The computer-readable medium of claim 8, wherein the instructions for receiving an offer of a business-volume discount comprise instructions for receiving a business-volume discount offer in which the defined volume interval has a lower bound defined by a volume threshold and no upper bound.

19. The computer-readable medium of claim 8 further comprising instructions for imposing, by a party other than a candidate supplier, a private buyer constraint prior to determining the optimal award schedule.

20. The computer-readable medium of claim 8 further comprising instructions for storing a supplier profile corresponding to a candidate supplier.