US 7,249,085 B1Grant
Method and system for conducting electronic auctions with multi-parameter price equalization bidding
Issue Date:2007-07-24
•39 Claims
•8 Drawing Sheets
Abstract
A method and system for conducting electronic online auctions using multi-parameter price equalization bidding is disclosed. Bids defined in a context of a bidder are transformed into a comparative bid parameter that enables a common basis of comparison for the submitted bids. A transformed bid of a first bidder can also be detransformed into a context of a second bidder, thereby enabling each individual bidder to view a comparison of submitted bids in their own context.
Metadata
Assignee
- Ariba, Inc.
Inventors
- Sam E. Kinney, Jr.
- Vincent F. Rago
- Glen T. Meakem
- Robert G. Stevens
- David J. Becker
- Anthony F. Bernard
- William D. Rupp
- Daniel C. Heckmann
- Julia L. Rickert
- Shane M. Tulloch
- Jennifer L. Riddle
- Nikki A. Sikes
- John P. Levis, III
Application Information
Application Number:US 09/282,157
Filing Date:1999-03-31
Priority Date:1999-03-31
Art Unit:3624
Classifications
IPC:
G06Q40/00
Patent Drawings (8 sheets)
Description
Background of the Invention
[0001] The disclosed invention relates generally to conducting online electronic auctions, and in particular to business-to-business bidding auctions for industrial purchasers.
[0002] Traditional Procurement Models
[0003] Procurement of supplies has traditionally involved high transaction costs, especially information search costs. The introduction of electronic commerce has introduced new methods of procurement that lower costs associated with procurement. Online procurement, or business-to-business electronic commerce, matches buyers and suppliers so that transactions can take place electronically. There are three models for online procurement: catalog, buyer-bidding auction, and supplier-bidding auction.
[0004] The “catalog” model of online procurement was the first to be developed. The first electronic catalogs were developed by suppliers to help customers obtain information about products and order supplies electronically. These first electronic catalogs were single-source; i.e. they only allowed customers to obtain information and products from that supplier.
[0005] However, customers are not typically satisfied with being “locked in” to one supplier—they wanted to be able to compare a number of competing products to be sure of getting the product features they wanted, at the best price. So suppliers with single-source electronic catalogs started to include competitors' products on their systems. An example of this is American's SABRE system, which includes offerings from competing suppliers (airlines), thereby further reducing information search costs. By offering competing products, the electronic catalog that offers competitor's products becomes an “electronic market”.
[0006] Many of these systems are biased towards the supplier offering the electronic market. Procurement costs can be further lowered with an unbiased electronic market that promotes competition.
[0007] For standard products and services, the need to have an unbiased market has been met for many industries by third party “market makers.” For example, Inventory Locator Services has compiled a database that lists all airplane parts suppliers that have a certain item in stock. Buyers dial into the database to get information on the parts they need. Here, it is a third party, Inventory Locator Service, not a supplier, creating the unbiased electronic market.
[0008] The electronic catalog model of electronic commerce involves one buyer and one supplier at a time. When many buyers compete for the right to buy from one supplier, a buyer-bidding auction model is created. A noteworthy example of the buyer-bidding auction model is that operated by PriceLine.com and described in U.S. Pat. No. 5,794,207 issued to Walker et al. In this system, potential buyers compete for airline tickets by submitting a bid for an airline ticket on the PriceLine website, and airlines can choose to accept a bid, thereby committing the buyer to buy the ticket.
[0009] The catalog and buyer-bidding auction types of electronic markets do not work in some situations however. If the required product is custom made for the buyer, it is not possible for suppliers to publish a set price in advance for a catalog market. Likewise, it is not possible for buyers to specify all of the details of the product they want to purchase in a buyer-bidding auction. Traditionally, when a company requires a custom industrial product, procurement is made by a buyer for the company who searches for a potential supplier and acquires custom-tailored price quotes from a supplier for the needed custom product. The search is slow and somewhat random because it usually relies heavily on personal relationships. The costs associated with locating vendors, comparing their products, negotiating, and paperwork become big factors in a purchase decision. The cost of switching suppliers is very large, which means that the quoted price is probably not the lowest fair price and it is hard for a new supplier to enter the market.
[0010] As an alternative, buyers use auctions to save money. The assignee of the present application developed a system wherein suppliers downwardly bid against one another to achieve the lowest market price in a supplier-bidding auction.
[0011] In a supplier-bidding auction, bid prices typically start high and move downward in reverse-auction format as suppliers interact to establish a closing price. The auction marketplace is one-sided, i.e. one buyer and many potential suppliers. Typically, the products being purchased are components or materials. “Components” typically mean fabricated tangible pieces or parts that become part of assemblies of durable products. Example components include gears, bearings, appliance shelves, or door handles. “Materials” typically mean bulk quantities of raw materials that are further transformed into product. Example materials include corn syrup or sheet steel.
[0012] Industrial buyers do not typically purchase one component at a time. Rather, they purchase whole families of similar components. At times, components are strongly related to one another. As an example, a buyer might purchase a given plastic knob in two different colors, or might purchase a nameplate in four different languages. These parts are so similar that by definition they must be purchased from the same supplier—all of the knobs are made using the same mold. These items are therefore grouped into a single lot. Suppliers in industrial auctions must provide unit price quotes for all line items in a lot.
[0013] Auction Process
[0014] The process for a supplier-bidding auction is described below with reference to FIGS. 1 and 2 . FIG. 1 illustrates the functional elements and entities in a supplier-bidding auction, while FIG. 2 is a process diagram that identifies the tasks performed by each of the involved entities.
[0015] The supplier-bidding auction model requires that the bidding product or service be defined by the buyer 10. An auction coordinator 20 works with buyers 10 to prepare for and conduct an auction and to define the potentially new supply relationships resulting from the auction.
[0016] As shown in FIG. 2 , in the Initial Contact phase 102 of the auction process, the coordinator 20 contacts the buyer 10, and the buyer 10 provides data to the coordinator 20. The coordinator 20 prepares a specification 50 for each desired product or part 52. Once the product 52 is defined, potential suppliers 30 for the product are identified. The coordinator 20 and buyer 10 work together to compile this list of potential suppliers from suppliers already known to the buyer 10 as well as suppliers recommended by the coordinator 20.
[0017] The buyer 10 makes a decision regarding which potential suppliers 30 will receive invitations to the upcoming Auction. Suppliers 30 that accept Auction invitations are then sent notices regarding the upcoming Auction, as well as client software to install in preparation of participating in the Auction.
[0018] In the RFQ phase 104, the coordinator 20 works with the buyer 10 to prepare a Request for Quotation (“RFQ”) 54. The coordinator 20 collects and maintains the RFQ data provided by buyer 10, and then publishes the RFQ 54, and manages the published RFQ 54. The RFQ 54 includes specifications 50 for all of the parts 52 covered by the RFQ 54. In the RFQ 54, buyer 10 aggregates similar part or commodity line items into job “lots.” These lots allow suppliers 30 to bid on that portion of the business for which they are best suited.
[0019] During the auction 56, bids 58 will be taken against individual lots (and their constituent parts 52) within RFQ 54. While suppliers 30 must submit actual unit prices for all line items, the competition in an Auction is based on the aggregate value bid for lots. The aggregate value bid for a lot depends upon the level and mix of line item bids and the quantity for each line item. Therefore, suppliers 30 submit bids at the line item level, but compete on the lot level.
[0020] In the Auction Administration phase 106, coordinator 20 coordinates the Auction and administers the Auction setup and preparation. The coordinator 20 sends a RFQ 54 to each participating supplier 30, and assists participating suppliers 30 with preparation for the Auction.
[0021] In the Auction phase 108, suppliers 30 submit bids 58 on the lots and monitor the progress of the bidding by the participating suppliers 30. The coordinator 20 assists, observes, and administers the Auction.
[0022] When the bidding period is over, the auction enters the Auction Results Administration phase 110. In this phase, coordinator 20 analyzes and administers the Auction results, which are viewed by buyer 10. The buyer 10 begins to conduct final qualification of the low bidding supplier(s). The buyer 10 retains the right not to award business to a low bidding supplier 30 based on final qualification results or other business concerns.
[0023] In the ensuing Contract Administration phase 112, the coordinator 20 facilitates settlements 60 awarded by the buyer 10 to suppliers 30. Contracts 52 are then drawn up between buyer 10 and suppliers 30.
[0024] Communications and Software
[0025] The Auction is conducted electronically between potential suppliers 30 at their respective remote sites and the coordinator 20 at its site. As shown in FIGS. 3 and 4 , information is conveyed between the coordinator 20 and the suppliers 30 via a communications medium such as a network service provider 40 accessed by the participants through, for example, dial-up telephone connections using modems, or direct network connections. A computer software application is used to manage the Auction. The software application has two components: a client component 31 and a server component 23. The client component 31 operates on a computer at the site of each of the potential suppliers 30. The client component is used by suppliers 30 to make bids during the Auction. The bids are sent via the network service provider 40 to the site of the coordinator, where it is received by the server component 23 of the software application. The client component 31 includes software used to make a connection through telephone lines or the Internet to the server component 23. Bids 58 are submitted over this connection and updates are sent to connected suppliers.
[0026] Bids 58 can only be submitted using the client component 31 of the application—this ensures that buyers do not circumvent the bidding process, and that only invited suppliers participate in the bidding. Typically, bidders can see their bids and bids placed by other suppliers for each lot on the client component 31. When a bidder submits a bid, that bid is sent to the server component 23 and evaluated to determine whether the bid is from an authorized bidder, and whether the bid has exceeded a pre-determined maximum acceptable price. Bids placed by a supplier are broadcast to all connected bidders thereby enabling every participating bidder to see quickly the change in market conditions and begin planning their competitive responses.
Summary of the Invention
[0027] Traditional online auctions focus on price as the sole variable upon which the online competition is based. Price is the sole bidding parameter that is provided by the bidders and hence is the sole parameter upon which a selection process is made. Relative valuations between different bid prices is quick and intuitive.
[0028] In a typical business-to-business situation, however, a plurality of parameters are considered in combination with the bidder's price proposal. In these situations, the buyer traditionally negotiates with each bidder independently because multi-parameter bids cannot be readily compared. As a simplified example, consider coal. Coal varies in its thermal content (i.e., BTU content) as well as in its sulfur content. Buyers would be willing to pay more, all things being equal, for higher thermal content or lower sulfur content. Sellers cannot readily change the composition of their coal. Therefore, it has traditionally been difficult to conduct an auction for coal, because not all coal is equal.
[0029] The present invention creates a competitive auction for goods or services that traditionally could not take advantage of natural auction dynamics. Competition is fostered through the real-time transformation of multi-parameter bids into comparable units of measure. The transformation process is an expression of the relative impact (or weighting) of each of the individual bidding parameters. In this manner, the transformation process enables an apples-to-apples comparison of multi-parameter bids.
[0030] The present invention also enables bidders to view an ongoing auction in their own context. In other words, bidders see current market conditions in relation to their own product parameters. This context viewing feature is enabled through the de-transformation of bidder market feedback into individual bidder contexts. Through the de-transformation process, each bidder can simultaneously view a relative comparison of bids in their own context.
Brief Description of the Drawings
[0031] The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention that together with the description serve to explain the principles of the invention.
[0032] In the drawings:
[0033] FIG. 1 illustrates the elements and entities involved in an auction process;
[0034] FIG. 2 illustrates the tasks performed by the entities involved in an auction process;
[0035] FIG. 3 illustrates the communications links between the coordinator and the potential suppliers in an auction;
[0036] FIG. 4 illustrates the client and server components of the computer software application that conducts the auction and the hardware at the sites of the coordinator and the potential suppliers on which the client and server components operate;
[0037] FIG. 5 illustrates a bid transformation function;
[0038] FIG. 6A illustrates a bid history chart based upon buyer and supplier viewpoints;
[0039] FIG. 6B illustrates a bid history chart based upon buyer and supplier viewpoints; and
[0040] FIG. 6C illustrates a bid history chart based upon buyer and supplier viewpoints.
Detailed Description
[0041] Reference will now be made in detail to the preferred embodiments of the present invention, examples of which are illustrated in the accompanying drawings. The present invention described below extends the operation of the inventive auction system and method described in greater detail in co-pending U.S. patent application Ser. No. 09/252,790, entitled “Method and System for Controlling Closing Times of Electronic Auctions Involving Multiple Lots”, filed Feb. 19, 1999, now U.S. Pat. No. 6,230,146, issued May 8, 2001, the disclosure of which is hereby expressly incorporated in the present application.
[0042] Traditional online auctions focus on price as the sole variable upon which the online competition is based. Price is the sole bidding parameter that is provided by the bidders and hence is the sole parameter upon which a selection process is made. Relative valuations between different bid prices is quick and intuitive.
[0043] In many types of business transactions, price is not the sole parameter upon which a decision is made. For example, in the negotiations for a supply contract, a buyer will compare various proposals not only on the basis of price but also on the basis of the non-price characteristics of non-standard goods, the location of the supplier, the reputation of the supplier, etc. In a typical business-to-business situation, a plurality of parameters are considered in combination with the supplier's price proposal.
[0044] In these situations, purchasers traditionally negotiate with each supplier independently because multi-parameter bids cannot be readily compared. Actual comparisons by the purchaser are based on a combination of subjective and objective weighting functions. Bidders do not typically have access to information on the buyer-defined weighting functions. At most, bidders would be selectively informed (at their disadvantage) of aspects of other competing bids. The limited communication of information between bidders limits the potential of true competition between the bidders. The absence of competition lowers the likelihood that the bidders will approach their true walk-away bid. Further, the manual weighting process is time consuming and subject to inconsistency from one application to the next.
[0045] The present invention is designed to create a market of competition in business transactions that traditionally could not take advantage of natural auction dynamics. Competition is fostered through the transformation of multi-parameter bids into comparable units of measure. This transformation process enables an apples-to-apples comparison of disparate bids. The following description of the features of the present invention is presented in the context of downward-based online industrial auctions. As would be appreciated by one of ordinary skill in the relevant art, these inventive features could also be applied in the context of upward-based online auctions as well.
[0046] As noted, multi-parameter bids cannot be readily compared. Comparison of multi-parameter bids cannot be realized unless the relative impact (or weighting) of each of the individual bidding parameters is known. Intuition that is based on subjective assessments (or valuations) of multiple bid parameters cannot create an efficient market because subjective assessments are inconsistently applied and applied after lengthy delays. Multi-parameter bid transformation enables true auction competition because it forces a greater degree of objectivity into the valuation process and is accomplished in real-time, allowing an auction dynamic to occur. Comparison of bids can therefore be accomplished in accordance with one or more comparative bid parameters.
[0047] A generic transformation mechanism is illustrated in FIG. 5 . As illustrated, bid transformation 500 represents a function (f) that is operative on input variables (x) and (a1 . . . an). Input variables (a1 . . . an) represent non-comparative bid parameters, while input variable (x) represents a supplier comparative bid parameter (e.g., price). The output of bid transformation 500 is the buyer comparative bid parameter (y).
[0048] In one embodiment, the bid transformation function (f) is a linear or non-linear analytic function that is calculated in real-time. In another embodiment, the bid transformation function (f) is a linear or non-linear function that is implemented via lookup tables. In yet another embodiment, the transformation function is a combination of an analytic linear function, analytic non-linear function, and table lookup function. The combination can be nested more than one layer deep.
[0049] In the generic description of the transformation process in FIG. 5 , two types of comparative bid parameters exist. A buyer comparative bid parameter (y) refers to a parameter, resulting from the transformation process, upon which the buyer will compare competing bids. A supplier comparative bid parameter (x), on the other hand, refers to an input to the transformation function (f). As will be described in greater detail below, the supplier comparative bid parameter can be used by a supplier to compare competing bids in the supplier's context. In some applications, the supplier comparative bid parameter is not used because all parties may be allowed to view the auction in the buyer's context.
[0050] As noted, non-comparative bid parameters are also used as inputs to the transformation process. Unlike supplier comparative bid parameters, non-comparative bid parameters (e.g., non-price parameters) are not directly used to compare competing bids.
[0051] In this transformation framework, a supplier comparative bid parameter value can be modified by the transformation process based upon non-comparative bid parameter values to yield a buyer comparative bid parameter value. This scenario is discussed below in the context of the coal market.
[0052] Alternatively, the transformation process can use multiple non-comparative bid parameters to create a buyer comparative bid parameter. In this case, no supplier comparative bid parameters are used to create supplier specific views. All parties view the competition in the same context. An example of this scenario is net present value (NPV) bidding, where parameters specifying multi-year contracts are converted into a total NPV bid. The total NPV bid represents a sum of a series of payments over multiple contract years, which are discounted to a present value using a predefined discount rate structure. NPV bidding is described in co-pending U.S. patent application Ser. No. 09/282,156, entitled “Method and System for Conducting Electronic Auctions with Net Present Value Bidding,” filed Mar. 31, 1999, the disclosure of which is hereby expressly incorporated in the present application.
[0053] Where a single buyer comparative bid parameter (e.g., price) is output by the transformation process, competition between bids is based on the relative magnitude of the values of the buyer comparative bid parameter associated with each of the bidders. This relative magnitude of the comparative bid parameters can be illustrated on a one-dimensional plot. Where multiple buyer comparative bid parameters are output by the transformation process, competition between bids can be compared using a multiple dimensional plot. In most cases, the use of a single buyer comparative bid parameter is advantageous because it provides the simplest means for all parties to unambiguously determine a relative ranking of bids.
[0054] The concepts and features of the present invention are now illustrated in the context of a particular application within the coal market. Coal purchase decisions are based on a variety of factors relating to the characteristics of the coal as well as the characteristics of the buyer's needs and physical facilities. Characteristics of the coal include factors such as thermal content (BTU/lb), percentage sulfur, percentage ash, percentage water/moisture, hardness, etc. Relevant characteristics of the buyer include the time frame of required delivery, types of power generation units, etc.
[0055] During negotiations with multiple coal suppliers, each of the relevant factors are evaluated in combination to determine the relative attractiveness of each of the received bids. The evaluation process is often a combination of subjective judgment, based on instinct and experience, and hard quantitative analysis. As one can readily appreciate, this evaluation process, although typical, is time consuming and adds great uncertainty for the suppliers.
[0056] Time delays are inherent since each supplier is negotiated with independently. Suppliers face great uncertainty in this process because the internal subjective/quantitative metrics used by the buyer in the evaluation process are inconsistently applied. Negotiation tactics dictate that the subjective/quantitative metrics used by the buyer are not provided to the suppliers. This confidential information gives the buyer leverage in altering the supplier's perception of the relative attractiveness of the submitted bid. During the negotiation process, suppliers may be selectively informed (at their disadvantage) of aspects of the decision making process.
[0057] Limited communication of information to the suppliers limits the potential of true competition between the suppliers. The absence of competition lowers the likelihood that the suppliers will approach their best offer.
[0058] The present invention creates true competition between suppliers in an auction system that enables comparison of truly disparate bids. While traditional auctions focus on price as the sole variable of online competition, the present invention also factors in non-price variables into the bid evaluation and award process.
[0059] In the coal market example, the buyer may be ultimately interested in the price per unit energy produced when the coal is processed through their power generation unit. As noted, all coal is not created equal. The characteristics of the particular coal being offered by a supplier is unique to the supplier. Moreover, different power generation units will produce different quantities of energy from identical coal, due to engineering differences built into the power generation units.
[0060] Bids for coal are typically submitted on a price per physical measure of weight or volume (e.g., $/ton) basis. The raw $/ton bids of the participating suppliers cannot be readily compared to each other due to the underlying characteristics of the coal. A mechanism is therefore required to transform each of the bids into a context that enables an apples-to-apples comparison such that the buyer can choose the most competitive bid. In the coal market example, the transformation process is designed to transform the $/ton bids for unique lots of coal into standardized units of value to the buyer (e.g., price-per-unit-of-energy bids such as ¢/Million BTU). After all of the $/ton bids are transformed into ¢/Million BTU bids, the buyer can readily identify the market leading bids.
[0061] It should be noted that the standardized units of value to the buyer can include various forms such as a cost per unit of thermal content from the coal, a cost per unit of electrical energy output from a generation facility burning the coal, the revenue from selling electrical energy output of a generation facility burning the coal, a measure of profit contribution from selling electrical energy output of a generation facility burning the coal, a measure of the net present value of a decision to accept the coal, wherein the decision is modeled to take into account the overall improvement in the buyer's economic condition, including revenue generated, costs avoided, risks mitigated, or asset valuation improved.
[0062] The latter example is a function that implements the notion that accepting a certain coal bid might have a portfolio effect on the buyer's overall situation, or might change the economics of a certain project. For example, a buyer might be considering whether to build a new power plant, and since coal is a high percentage of the life cycle cost of the power plant, changes in the price of coal offered to the buyer might change the overall value of the plant.
[0063] The transformation function used in the coal market has been modeled as a linear transformation. In this linear transformation, a suppliers raw $/ton bid is modified using multiplicative and additive adjustments (or factors) to yield a ¢/Million BTU bid. Each of the multiplicative and additive factors are based upon characteristics (e.g., coal characteristics, delivery specifications, etc.) of a submitted bid.
[0064] It should be noted that the characteristics of a supplier's coal may have been identified prior to the start of the auction. In this case, multiplicative and additive factors are determined prior to the start of the auction and stored in memory by the server component. During the auction process, the multiplicative and additive factors are retrieved from memory and used to transform the raw $/ton bid into a ¢/Million BTU bid. In one embodiment, a multiplicative and/or additive factor is stored by the server component for each of the characteristics of the supplier's coal. In an alternative embodiment, a single multiplicative factor and a single additive factor, representative of the cumulative effect of the characteristics of the coal in the linear transformation, is stored.
[0065] In another scenario, the characteristics of a supplier's coal are provided as part of a supplier's first submitted bid along with the raw $/ton bid to the server component. In this case, the characteristics of the supplier's coal (i.e., BTU/lb, % sulfur, % ash, % water, etc.) would be fed by the server component into the transformation function to determine, in real-time, the buyer comparative bid parameter that is the result of the transformation function. The server component may store the net result of the transformation function factors in memory for retrieval in the transformation of future bids by that supplier.
[0066] The transformation process in the coal market example can be generically characterized by the transformation process illustrated in FIG. 5 . In the coal market example, the output of the transformation process is the ¢/Million BTU parameter. The ¢/Million BTU parameter represents the basis upon which a buyer will compare the bids submitted by the participating suppliers. Accordingly, the ¢/Million BTU parameter represents a buyer comparative bid parameter.
[0067] In the coal example, the transformation process takes as inputs both comparative and non-comparative bid parameters. The non-comparative bid parameters represent the characteristics of the coal (i.e., BTU/lb, % sulfur, % ash, % water, delivery time, etc.) and the characteristics of the buyer. The $/ton price parameter represents a supplier comparative bid parameter. In combination, the comparative and non-comparative bid parameters are operated upon by the transformation function (f) to yield the buyer comparative bid parameter value in ¢/Million BTU.
[0068] At this point, it should be noted that the supplier comparative bid parameter ($/ton) is significant because it enables the supplier to view a relative comparison of bids in the supplier's individual context. This feature of the present invention will be described in greater detail below in the discussion of the detransformation and feedback parts of the auction process.
[0069] After each of the submitted bids have been transformed into the buyer comparative bid parameter ¢/Million BTU, an “apples-to-apples” comparison can be performed. The “apples-to-apples” comparison can be effected in any of a variety of ways including the bid history chart of FIG. 6A . The bid history chart of FIG. 6A illustrates a relative ranking of transformed received bids in ¢/Million BTU.
[0070] Having received a bid from a participating supplier, the auction server must then broadcast market feedback to the other participating suppliers. This broadcast function creates a real-time online competition between suppliers who are able to view the activities of their competitors and plan their corresponding response strategy.
[0071] In the coal market, the specific factors used in the transformation function are often confidential to the buyer. Accordingly, the buyer desires to prevent the suppliers from gaining insight into aspects of the transformation function that quantifies the buyer's weighting of various parameters associated with a supplier's bid. For this reason, the auction server does not feedback the transformed bids to the participating suppliers. Rather, the auction server broadcasts bids that have been detransformed from the buyer comparative bid parameter (i.e., ¢/Million BTU) into the context (i.e., $/ton) of the individual suppliers.
[0072] The $/ton bid for a supplier is referred to as the supplier comparative bid parameter. As illustrated in FIG. 5 , the supplier comparative bid parameter is one of the inputs into the transformation function (f). The supplier comparative bid parameter is significant because it enables the supplier to view the auction competition in his own context. In other words, a supplier can view all competing bids as if all suppliers were offering the same type of coal for sale. In this manner, a supplier can view the competitive auction landscape without receiving any information concerning the transformation function that has been defined by the buyer.
[0073] In the coal example, the transformation process is modeled as a linear function, having at least one multiplicative factor and/or at least one additive factor. This transformation can be represented by the well known algebraic function y=mx+b, where m is the multiplicative factor, b is the additive factor, x is the supplier comparative bid parameter, and y is the buyer comparative bid parameter.
[0074] Bids viewed in the buyer's context have been converted into the buyer comparative bid parameter (i.e., ¢/Million BTU). On the supplier side, each of the bids submitted from other participating suppliers are detransformed from the buyer comparative bid parameter into the supplier comparative bid parameter. This detransformation is accomplished by solving the formula for x to yield the formula x=(y−b)/m. In this detransformation process, ¢/Million BTU bid values that are to be broadcast to Supplier A are converted to $/ton bid values using the multiplicative and/or additive factors for Supplier A.
[0075] After the client component at Supplier A receives the detransformed bid values, Supplier A is then able to view a relative comparison of the bids in his own context. This relative comparison corresponds to the relative comparison of the bids in the buyer context. FIG. 6B illustrates a bid history chart in the context of Supplier A. In this example, it is assumed that Supplier A's multiplicative and additive factors are, m=0.87 and b=80, respectively.
[0076] As FIG. 6B demonstrates, Supplier A can view the competitive climate of the auction without having access to any of the details of the transformation function (f) implemented by the buyer. From Supplier A's perspective, all other suppliers are bidding the same type of coal. Competition is therefore perceived as being based on the $/ton price, not the ¢/Million BTU price. If Supplier A decides to beat the market leading bid, Supplier A would simply reduce his $/ton bid and submit the new bid (e.g., bid of $17.01/ton bid at 01:25:28) to the auction server. The new $17.01/ton bid would then be transformed into a 94.8 ¢/Million BTU bid, i.e., 0.87*17.01+80=94.8 ¢/Million BTU, using the multiplicative and additive adjustments for Supplier A.
[0077] In a similar manner, Supplier B can also view the competitive climate of the auction without having access to any of the details of the transformation function implemented by the buyer. Supplier B's view is illustrated in FIG. 6C . In this example, it is assumed that Supplier B's multiplicative and additive factors are, m=0.81 and b=82, respectively. In Supplier B's view, Supplier A's new bid of $17.01/ton (or 94.8 ¢/Million BTU) at 01:25:28 is fed back to Supplier B as a $15.80/ton bid, i.e., (94.8−82)/0.81=$15.80/ton, using Supplier B's multiplicative and additive parameters.
[0078] In combination, FIGS. 6A-6C illustrate a feature of the present invention that enables each supplier to view the auction in his own context. These buyer-specific and supplier-specific contexts enable the system to create a coal auction market without revealing confidential information to the suppliers. The creation of an online electronic auction greatly benefits the buyer by allowing the buyer to get true market prices. The online electronic auction can easily produce hundreds of bids in a span of a few hours. This is in sharp contrast to traditional coal market mechanisms that relied upon the simultaneous occurrence of independent negotiations over a course of weeks.
[0079] It should be noted that a supplier may simultaneously offer a plurality of products of differing technical specifications. In this case, the transformation function must treat these offerings separately. Each offering has its own context, and an array of detransformed bid values unique to that offering.
[0080] It should be noted that a supplier could also modify a bid by changing a non-price parameter. For example, instead of changing the $/ton bid, a supplier could choose to change a particular characteristic (e.g., % ash, % sulfur, etc.) of the coal that is being bid. This new type of coal can be based upon a mixture or blend of different types of coal within the supplier's control. By adjusting the characteristics of the coal, the supplier is effectively adjusting the multiplicative factor and/or additive factor that defines his transformation function. For this reason, the new blend of coal would define a new context for that supplier. The supplier would then have the option of amending an existing offering or creating a second offering. If the supplier creates a new offering, viewing that new blended bid within the context of the auction market would require a second bid history chart. In effect, the supplier has entered two horses into the race. This has the additional benefit to suppliers of allowing them to balance their own supply with market demand in the most beneficial manner.
[0081] Another example of transformation bidding is multi-currency bidding. Multi-currency bidding is an auction format wherein the buyer views all submitted bids in a base currency (e.g., U.S. dollars), while each of the suppliers view all submitted bids in a local currency (e.g., Japanese Yen, Swiss Francs, etc.). Multi-currency bidding is described in co-pending U.S. patent application Ser. No. 09/282,158, entitled “Method and System for Conducting Electronic Auctions with Multi-Currency Bidding,” filed Mar. 31, 1999, the disclosure of which is hereby expressly incorporated in the present application.
[0082] In the multi-currency bidding example, the local currency represents a supplier comparative bid parameter. The exchange rate between the local currency and the base currency represents a non-comparative bid parameter. It should be noted that in the multi-currency example, the non-comparative bid parameter is provided by the buyer or independent party instead of the supplier. In effect, the supplier's bid is a single parameter (i.e., local currency price) to be transformed into a buyer comparative bid parameter (i.e., base currency price).
[0083] In a similar fashion as the coal market example, each of the suppliers can view the auction in their own context (or local currency). Here, confidentiality of the transformation process is not the driver for separate supplier views. Rather, separate supplier views are desired because of user unfamiliarity of viewing prices in a foreign currency. Detransformation is represented by the conversion of base currency bids into the relevant local currency.
[0084] In the multi-currency bidding application, the exchange rates are not confidential. Accordingly, the transformation/detransformation process can be performed at the client component and/or the auction server component. For example, assume that Supplier A is bidding in Japanese Yen, Supplier B is bidding in Swiss Francs, and the buyer is viewing the auction in U.S. dollars. The client component of Supplier A can submit the bid in Yen or in U.S. dollars. If the bid is to be submitted in U.S. dollars, the client component is configured to convert the bid to dollars prior to submission to the auction server.
[0085] On the receiving end, the client component of Supplier B can receive a bid price submitted by Supplier A in Yen, U.S. dollars or Swiss Francs. If the auction server sends a bid submitted by Supplier A in yen to Supplier B, the auction server is performing the detransformation process (i.e., currency exchange to Yen). In this case, no currency conversion is required by the client component of Supplier B. Alternatively, the client component of Supplier B can be configured to perform the currency exchange of Supplier A's bid. This currency exchange can be based upon the receipt of a bid in the base currency (U.S. dollars) or Supplier A's local currency (Yen). In this case, the currency conversion is performed by the client component of Supplier B prior to the display of Supplier A's bid to Supplier B.
[0086] In other embodiments, multi-parameter price equalization bidding can be used to solve other problems when price alone cannot adequately discriminate between a plurality of offerings. One example concerns transportation costs. Because buyers often control inbound transportation and have favorable contract rates, the transformation function might be configured to translate bids of FOB supplier pricing into bids of FOB buyer. Another example concerns penalty factors buyers might apply. Some suppliers may be assessed penalties due to additional cost factors the buyer might have to assume. For example, an overseas supplier might be automatically penalized a given percent or fixed amount to cover the extra costs of travel, input/export duties, and international banking fees.
[0087] In other embodiments, the transformation function that converts the supplier comparative bid parameter into buyer comparative bid parameters might be non-linear. This non-linear transformation may be implemented in a variety of ways. In one embodiment, the algebraic transformation function (f) is defined as a non-linear function rather than a linear function. The form of this function might be a polynomial such as y=nx2+mx+b. It might also use logarithms or power functions.
[0088] In another embodiment, the transformation function (f) uses lookup tables. A lookup table is a form of transformation function whereby a given input value or range of input values is translated into a given output value. The lookup table is constructed in advance in such a way that all possible values of input are translated into an acceptable value of output.
[0089] Non-linear transformation functions can serve to provide additional emphasis to certain parameters. For example, a product's value may rise at a faster rate as a certain quality factor approaches perfection. The value of a perfect diamond, for example, can be many times higher than the value of a slightly imperfect diamond. However, as the level of imperfection rises, the drop off in value slows. This is a non-linear transformation from an engineering attribute into value.
[0090] Lookup tables can be used to simplify preparation. For example, consider the problem of translating FOB supplier prices into FOB buyer prices, including transportation costs between a supplier and a buyer. In theory, a linear transportation function might be used to apply an additive factor such as “cents per unit per mile shipped.” In practice, it can be far simpler to prepare an auction using a rule such as “within 100 miles shipping is $0.01 per unit, between 101-250 miles shipping is $0.03 per unit, and above 250 miles shipping is $0.05 per unit.” In this case, a lookup table provides an easier implementation. In this framework, supplier A located 60 miles from the buyer would be assessed $0.01 per unit for shipping, while supplier B located 105 miles from the buyer and supplier C located 230 miles away would both be assessed $0.03 per unit.
[0091] It should be noted that a combination of linear, non-linear, and lookup table transformations might apply to any given auction. For example, a linear transformation function might be used, where various additive transformation factors are themselves the output values from a lookup table, another linear function, or a non-linear function. In other words, the transformation functions may be nested to include more than one type of calculation in any given embodiment.
[0092] Generally, where the transformation function is non-confidential, the transformation process can be implemented individually or jointly by the auction server component and the individual client components. The joint implementation can be designed in various ways to achieve the same goal, the support of individual buyer and supplier views.
[0093] As noted above, the transformation process can also be used in a context where only a single view of the auction is available. Here, the buyer and each of the participating suppliers each view the auction based on the buyer comparative bid parameter (e.g., NPV bidding).
[0094] While the invention has been described in detail and with reference to specific embodiments thereof, it will be apparent to one skilled in the art that various changes and modifications can be made therein without departing from the spirit and scope thereof. In particular, it should be noted that while the auction functions described above have been described in the context of downward pricing auctions the auction functions can be equally applied to upward pricing auctions. Thus, it is intended that the present invention cover the modifications and variations of this invention provided they come within the scope of the appended claims and their equivalents.
Claims
What is claimed is:
1. A computer implemented method of conducting an electronic online auction on behalf of a buyer, wherein the auction is between a plurality of potential bidders, competing to supply a lot having at least one product to the buyer, the method comprising:
receiving electronically at a server first bid information for a lot from a first bidder of a first remote site over a network, said received first bid information representing a first bid that is originally defined in a context of said first bidder;
generating a transformed bid according to one or more first non-comparative bid parameters associated with the first bidder using a first transform function associated with the first bidder, the first transform function operative on the first bid information and the first non-comparative bid parameters, wherein one or more of the first non-comparative parameters and the first transform function being known only to the buyer;
storing information reflective of said submitted first bid, said stored information enabling a relative comparison of submitted bids, including said first bid, on a common competitive basis;
converting within the server the transformed bid into a second bid information defined in a context of a second bidder according to one or more second non-comparative bid parameters associated with the second bidder, using a second transform function associated with the second bidder, the second transform function operative on the transformed bid and the second non-comparative bid parameters, wherein one or more of the second non-comparative parameters and the second transform function being known only to the buyer, wherein the second non-comparative parameters being different than the first non-comparative parameters, and wherein the second transform function being different than the first transform function; and
transmitting electronically the second bid information to the second bidder over the network, said transmitted second bid information enabling said second bidder to view said first bid originally defined in said context of said first bidder in said context of said second bidder, such that the second bidder is able to view other bid information from other bidders including the first bidder in view of a specific format desired by the second bidder, wherein the first bidder and the second bidder are different seller parties, and the buyer is different from the first bidder and the second bidder.
2. The method of claim 1, wherein generating a transformed bid comprises performing a linear transformation having at least one of a multiplicative adjustment and an additive adjustment.
3. The method of claim 2, wherein generating a transformed bid comprises multiplying a received bid price specified in a local currency of said first bidder with a pre-defined exchange rate to yield a base currency bid price.
4. The method of claim 2, wherein generating a transformed bid comprises transforming a received price per physical measure of weight or volume of coal into a standardized unit of value to the buyer of coal using multiplicative adjustments and additive adjustments based upon one or more of the thermal content, percentage sulfur, percentage ash, percentage water, and hardness of coal of said first bidder, wherein the multiplicative adjustments and additive adjustments are performed according to the predetermined algorithm defined by the buyer, and wherein the predetermined algorithm is not exposed to the first and second bidders.
5. The method of claim 1, wherein generating a transformed bid comprises performing a non-linear transformation.
6. The method of claim 1, wherein generating a transformed bid comprises transforming received bid information using a lookup table.
7. The method of claim 1, wherein generating a transformed bid comprises performing a combination of linear, non-linear, and lookup table transformations simultaneously.
8. The method of claim 1, wherein receiving first bid information for a lot from a first bidder comprises receiving transformed bid information.
9. The method of claim 8, wherein receiving first bid information for a lot from a first bidder comprises receiving a bid price in a base currency, wherein said bid price is originally defined in a local currency of said first bidder.
10. The method of claim 8, wherein storing information reflective of said submitted first bid further comprises generating detransformed bid information, and wherein transmitting second bid information further comprises transmitting said detransformed bid information to said second bidder.
11. The method of claim 10, wherein generating a transformed bid comprises performing a linear transformation having at least one of a multiplicative adjustment and an additive adjustment.
12. The method of claim 11, wherein generating a transformed bid comprises converting a base currency price into a bid price in a local currency of said second bidder using a pre-defined exchange rate.
13. The method of claim 10, wherein generating a transformed bid comprises converting a received bid price specified in a local currency of said first bidder into a local currency of said second bidder using a pre-defined exchange rate.
14. The method of claim 11, wherein generating a transformed bid comprises transforming a received price per physical measure of weight or volume of coal into a standardized unit of value to the buyer of coal using multiplicative adjustments and additive adjustments based upon one or more of the thermal content, percentage sulfur, percentage ash, percentage water, and hardness of coal of said first bidder.
15. The method of claim 10, wherein generating a transformed bid comprises performing a non-linear transformation.
16. The method of claim 10, wherein generating a transformed bid comprises performing a transformation using a lookup table.
17. The method of claim 10, wherein generating a transformed bid comprises performing a combination of linear, non-linear, and lookup table transformations simultaneously.
18. The method of claim 1, wherein transmitting second bid information comprises transmitting second bid information to be transformed by said second bidder.
19. The method of claim 18, wherein transmitting second bid information comprises transmitting a base currency price to be transformed by said second bidder into a local currency of said second bidder.
20. A system for conducting an electronic online auction on behalf of a buyer, wherein the auction is between a plurality of potential bidders competing to supply a lot having at least one product to the buyer, the system comprising:
means for receiving electronically at a server first bid information for a lot from a first bidder of a first remote site over a network, said received first bid information representing a first bid that is originally defined in a context of said first bidder;
means for generating a transformed bid according to one or more first non-comparative bid parameters associated with the first bidder using a first transform function associated with the first bidder, the first transform function operative on the first bid information and the first non-comparative bid parameters, wherein one or more of the first non-comparative parameters and the first transform function being known only to the buyer;
means for storing information reflective of said submitted first bid, said stored information enabling a relative comparison of submitted bids including said first bid on a common competitive basis;
means for converting within the server the transformed bid into a second bid information defined in a context of a second bidder according to one or more second non-comparative bid parameters associated with the second bidder, using a second transform function associated with the second bidder, the second transform function operative on the transformed bid and the second non-comparative bid parameters, wherein one or more of the second non-comparative parameters and the second transform function being known only to the buyer, wherein the second non-comparative parameters being different from than the first non-comparative parameters, and wherein the second transform function being different than the first transform function; and
means for transmitting electronically the second bid information to the second bidder over the network, said transmitted second bid information enabling said second bidder to view said first bid originally defined in said context of said first bidder in said context of said second bidder, such that the second bidder is able to view other bid information from other bidders including the first bidder in view of a specific format desired by the second bidder, wherein the first bidder and the second bidder are different seller parties, and the buyer is different from the first bidder and the second bidder.
21. The system of claim 20, wherein said means for generating performs a linear transformation using at least one of a multiplicative adjustment and an additive adjustment.
22. The system of claim 21, wherein said means for generating multiplies a received bid price, specified in a local currency of said first bidder, with a pre-defined exchange rate to yield a base currency bid price.
23. The system of claim 21, wherein said means for generating transforms a received price per physical measure of weight or volume of coal into a standardized unit of value to the buyer of coal using multiplicative adjustments and additive adjustments based upon one or more of the thermal content, percentage sulfur, percentage ash, percentage water, and hardness of coal of said first bidder, wherein the multiplicative adjustments and additive adjustments are performed according to the predetermined algorithm defined by the buyer, and wherein the predetermined algorithm is not exposed to the first and second bidders.
24. The system of claim 20, wherein said means for generating performs a non-linear transformation.
25. The system of claim 20, wherein said means for generating transforms received bid information using a lookup table.
26. The system of claim 20, wherein said means for generating performs a combination of linear, non-linear, and lookup table transformations simultaneously.
27. The system of claim 20, wherein said received first bid information is transformed bid information.
28. The system of claim 27, wherein said received first bid information is a bid price in a base currency, wherein said bid price is originally defined in a local currency of said first bidder.
29. The system of claim 27, further comprising means for generating detransformed bid information, wherein said transmitted second bid information comprises detransformed bid information.
30. The system of claim 29, wherein said means for generating performs a linear transformation using at least one of a multiplicative adjustment and an additive adjustment.
31. The system of claim 30, wherein said means for generating converts a base currency price into a bid price in a local currency of said second bidder using a pre-defined exchange rate.
32. The system of claim 29, wherein said means for generating converts a received bid price specified in a local currency of said first bidder into a local currency of said, second bidder using a pre-defined exchange rate.
33. The system of claim 30, wherein said means for generating transforms a received price per physical measure of weight or volume of coal into a standardized unit of value to the buyer of coal using multiplicative adjustments and additive adjustments based upon one or more of the thermal content, percentage sulfur, percentage ash, percentage water, and hardness of coal of said first bidder.
34. The system of claim 29, wherein said means for generating performs a non-linear transformation.
35. The system of claim 29, wherein said means for generating performs a transformation using a lookup table.
36. The system of claim 29, wherein said means for generating performs a combination of linear, non-linear, and lookup table transformations simultaneously.
37. The system of claim 20, wherein said transmitted second bid information is to be transformed by said second bidder.
38. The system of claim 37, wherein said transmitted second bid information is a base currency price to be transformed by said second bidder into a local currency of said second bidder.
39. A computer program product for enabling a processor in a computer system to process bidding information in an auction conducted on behalf of a buyer, wherein the auction is between a plurality of bidders competing to supply a lot having at least one product to the buyer, said computer program product comprising:
a computer readable medium having a computer readable program code embodied in said medium for causing an application program to execute on the computer system, said computer readable program code comprising
a first computer readable program code to receive electronically first bid information for the lot from a first bidder of a first remote site over a network, said received first bid information representing a first bid that is originally defined in a context of said first bidder;
a second computer readable program code to generate a transformed bid according to one or more first non-comparative bid parameters associated with the first bidder using a first transform function associated with the first bidder, the first transform function operative on the first bid information and the first non-comparative bid parameters, wherein one or more of the first non-comparative parameters and the first transform function being known only to the buyer;
a third computer readable program code to store information reflective of said submitted first bid, said stored information enabling a relative comparison of submitted bids including said first bid on a common competitive basis;
a fourth computer readable program code to convert the transformed bid information into a second bid information defined in a context of a second bidder according to one or more second non-comparative bid parameters associated with the second bidder, using a second transform function associated with the second bidder, the second transform function operative on the transformed bid and the second non-comparative bid parameters, wherein one or more of the second non-comparative parameters and the second transform function being known only to the buyer, wherein the second non-comparative parameters being different than the first non-comparative parameters, and wherein the second transform function being different than the first transform function; and
a fifth computer readable program code to electronically transmit second bid information to the second bidder, said transmitted second bid information enabling said second bidder to view said first bid originally defined in said context of said first bidder in said context of said second bidder, such that the second bidder is able to view other bid information from other bidders including the first bidder in view of a specific format desired by the second bidder, wherein the first bidder and the second bidder are different seller parties, and the buyer is different from the first bidder and the second bidder.
Patent Citations (81)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3581072(A) | 1971-05-01 | Nymeyer | Applicant |
| US3637464(A) | 1972-01-01 | Walsh et al. | Examiner |
| US3863060(A) | 1975-01-01 | Rode et al. | Applicant |
| US4597045(A) | 1986-06-01 | Kiuchi | Applicant |
| US4674044(A) | 1987-06-01 | Kalmus et al. | Applicant |
| US4789928(A) | 1988-12-01 | Fujisaki | Applicant |
| US4799156(A) | 1989-01-01 | Shavit et al. | Applicant |
| US4845625(A) | 1989-07-01 | Stannard | Applicant |
| US4992940(A) | 1991-02-01 | Dworkin | Applicant |
| US5136501(A) | 1992-08-01 | Silverman et al. | Applicant |
| US5193056(A) | 1993-03-01 | Boes | Applicant |
| US5243515(A) | 1993-09-01 | Lee | Applicant |
| US5297032(A) | 1994-03-01 | Trojan et al. | Applicant |
| US5375055(A) | 1994-12-01 | Togher et al. | Applicant |
| US5394324(A) | 1995-02-01 | Clearwater | Applicant |
| US5402336(A) | 1995-03-01 | Spiegelhoff et al. | Applicant |
| US5606602(A) | 1997-02-01 | Johnson et al. | Applicant |
| US5629982(A) | 1997-05-01 | Micali | Applicant |
| US5640569(A) | 1997-06-01 | Miller et al. | Examiner |
| US5664115(A) | 1997-09-01 | Fraser | Applicant |
| US5684963(A) | 1997-11-01 | Clement | Applicant |
| US5689652(A) | 1997-11-01 | Lupien et al. | Applicant |
| US5715402(A) | 1998-02-01 | Popolo | Applicant |
| US5727165(A) | 1998-03-01 | Ordish et al. | Applicant |
| US5758327(A) | 1998-05-01 | Gardner et al. | Applicant |
| US5758328(A) | 1998-05-01 | Giovannoli | Applicant |
| US5765138(A) | 1998-06-01 | Aycock et al. | Applicant |
| US5774873(A) | 1998-06-01 | Berent et al. | Applicant |
| US5794207(A) | 1998-08-01 | Walker et al. | Applicant |
| US5794219(A) | 1998-08-01 | Brown | Applicant |
| US5797127(A) | 1998-08-01 | Walker et al. | Applicant |
| US5799151(A) | 1998-08-01 | Hoffer | Applicant |
| US5799285(A) | 1998-08-01 | Klingman | Applicant |
| US5802502(A) | 1998-09-01 | Gell et al. | Applicant |
| US5803500(A) | 1998-09-01 | Mossberg | Applicant |
| US5809483(A) | 1998-09-01 | Broka et al. | Applicant |
| US5826244(A) | 1998-10-01 | Huberman | Applicant |
| US5832496(A) | 1998-11-01 | Anand et al. | Applicant |
| US5835896(A) | 1998-11-01 | Fisher et al. | Applicant |
| US5862223(A) | 1999-01-01 | Walker et al. | Applicant |
| US5890138(A) | 1999-03-01 | Godin et al. | Applicant |
| US5897621(A) | 1999-04-01 | Boesch et al. | Applicant |
| US5905974(A) | 1999-05-01 | Fraser et al. | Applicant |
| US5905975(A) | 1999-05-01 | Ausubel | Applicant |
| US5915209(A) | 1999-06-01 | Lawrence | Applicant |
| US5966699(A) | 1999-10-01 | Zandi | Applicant |
| US6014627(A) | 2000-01-01 | Togher et al. | Applicant |
| US6021398(A) | 2000-02-01 | Ausubel | Applicant |
| US6023685(A) | 2000-02-01 | Brett et al. | Applicant |
| US6026383(A) | 2000-02-01 | Ausubel | Examiner |
| US6035287(A) | 2000-03-01 | Stallaert et al. | Examiner |
| US6044363(A) | 2000-03-01 | Mori et al. | Applicant |
| US6047274(A) | 2000-04-01 | Johnson et al. | Examiner |
| US6052108(A) | 2000-04-01 | Gadd | Examiner |
| US6055518(A) | 2000-04-01 | Franklin et al. | Applicant |
| US6058379(A) | 2000-05-01 | Odom et al. | Applicant |
| US6061663(A) | 2000-05-01 | Bloom et al. | Applicant |
| US6078906(A) | 2000-06-01 | Huberman | Applicant |
| US6119229(A) | 2000-09-01 | Martinez et al. | Applicant |
| US6131087(A) | 2000-10-01 | Luke et al. | Examiner |
| US6134536(A) | 2000-10-01 | Shepherd | Examiner |
| US6151589(A) | 2000-11-01 | Aggarwal et al. | Applicant |
| US6161099(A) | 2000-12-01 | Harrington et al. | Examiner |
| US6178431(B1) | 2001-01-01 | Douglas | Examiner |
| US6199050(B1) | 2001-03-01 | Alaia et al. | Applicant |
| US6216108(B1) | 2001-04-01 | LeVander | Applicant |
| US6230146(B1) | 2001-05-01 | Alaia et al. | Examiner |
| US6236972(B1) | 2001-05-01 | Shkedy | Applicant |
| US6266652(B1) | 2001-07-01 | Godin et al. | Applicant |
| US6275807(B1) | 2001-08-01 | Schirripa | Examiner |
| US6343277(B1) | 2002-01-01 | Gaus et al. | Examiner |
| US6366891(B1) | 2002-04-01 | Feinberg | Applicant |
| US6778968(B1) | 2004-08-01 | Gulati | Applicant |
| US2001/0044769(A1) | 2001-11-01 | Chaves | Applicant |
| EP399850(A) | 1990-11-01 | Applicant | |
| JP410078992(A) | 1997-04-01 | Applicant | |
| JP409101994(A) | 1998-03-01 | Applicant | |
| WO92/15174 | 1992-09-01 | Applicant | |
| WO97/37315 | 1997-10-01 | Applicant | |
| WO98/34187 | 1998-08-01 | Applicant | |
| WO99/63461 | 1999-12-01 | Applicant |
Non-Patent Literature (35)
- Malone et al., “The Logic of Electronic Markets”, Harvard Business Review, No. 893II (May-Jun. 1989).Applicant
- Freemarkets™ Online, “Bidware Manual” (Jun. 9, 1988).Applicant
- Freemarkets Online™, “Online Industrial Market Making, An Overview of Purchasing Executives”.Applicant
- WebAuction.com, “How to Play” (1998).Applicant
- Auction Sales, “Live Auctions Online” (Sep. 1998).Applicant
- Auction Port, “Online Auction Community—New Auctions Since Sep. 2, 1998” (Jul. 1998).Applicant
- OnSale, “How to Play” (1998).Applicant
- U-Auction-It™ (1997).Applicant
- Freemarkets Online™, “Homepage” (1998).Applicant
- Andrews, “Auctions Catch the Interest of Hobbyists and Big Business”, Aug. 24, 1998.Applicant
- Associated Press, “Auction on Web is Buyer's Market”, Apr. 6, 1998.Applicant
- Steinert-Threlkeld, “New Watchwords: Let Sellers Beware”, Jun. 1, 1998.Applicant
- Woolley, “E-muscle”, Mar. 9, 1998.Applicant
- Associated Press, “FreeMarkets Takes Auction on Internet”, Feb. 23, 1998.Applicant
- Jahnke, “How Bazaar” (Aug. 27, 1998).Applicant
- Wilder, “What's Your Bid?—FreeMarkets' real-time online bidding technology lets clients drive down costs and improve product value”, Nov. 10, 1997, Information Week.Applicant
- Jean-Pierre Banatre, et al., “The Design and Building of Enchere, a Distributed Electronic Marketing System” Communications of the ACM, No. 1 (Jan. 29, 1986).Applicant
- Danny Cohen, “Computerized Commerce” Information Processing 89 (Aug. 28-Sep. 1, 1989).Applicant
- “BroadVision Developing First Interactive Commerce Management System To Support Online Sales & Marketing Process; New Software Category Necessary to Interactive Network Architecture”, Business Wire, p. 5150152, May 15, 1995.Applicant
- “FairMarket Launches New Self-Serve Auctions”, Business Wire, p. 6161495, Jun. 16, 1998.Applicant
- Lee, “Do electronic Marketplaces lower the price of goods?”, Communications of the PCM, v41n1 pp. 73-80, Jan. 1998.Applicant
- “Moai Technologies Introduces New categories of Business to Business Auction Software..”, Business Editors and Computer writers, Mar. 16, 1998.Applicant
- Kikuchi, et al., “Multi-Round Anonymous Auction Protocols”, IEICE Trans. Inf. & Syst., vol. E82-D, No. 4, Apr. 1999.Applicant
- “Online bidding software”, Electronic Buyers News, Issue 1072, p. 86, 1/6p, Aug. 25, 1997.Applicant
- Sairamesh, et al., “Economic Framework for Pricing and Charging Digital Libraries”, D-Lip Magazine, Feb. 1996.Applicant
- “Sold!. . . To the Lowest bidder”, Computer Finance, v6, n2, Jul. 1995.Applicant
- “Venture Capitalists Fund Two Massachusetts Internet Related Companies”, Boston Globe, Jan. 14, 1998.Applicant
- Vigoroso, “Buyers prepare for brave new world of e-commerce”, Purchasing, v126, n6 p. S4(1), Apr. 22, 1999.Applicant
- Vond der Fehr, et al., “Predatory bidding in sequential auctions”, Oxford Economics Papers, v46, n3, p. 345(12), Jul. 1994.Applicant
- “What you need to bid in FCC's narrowband auction”, Washington Telecom News, v2, n26, p. 6(2), Jun. 27, 1994.Applicant
- M. Reck, “Types of Electronic Auctions”, Hochschule St. Gallen.Applicant
- C. Wrigley, “Design Criteria For Electronic Market Servers”, Electronic Markets, vol. 7, No. 4, 1997.Applicant
- Wurman, et al., “The Michigan AuctionBot: A Configurable Auction Server for Human and Software Agents”, Artificial Intelligence Laboratory, University of Michigan, 1998.Applicant
- PCT Notification of Transmittal of International Preliminary Examination Report for PCT Counterpart Application No. PCT/US00/08522 Containing International Preliminary Examination Report (Nov. 19, 2001).Applicant
- “Virginia Power to Seek 1,750 MW More Through Competitive Bidding,” Electric Utility Week, p. 15 (Mar. 14, 1998).Applicant