US 8,341,035 B2Grant
Deal matching system
Issue Date:2012-12-25
•4 Claims
•18 Drawing Sheets
Abstract
A multiple criteria buying and selling system and method is provided. A seller initially establishes a deal structure for a product, which provides seller defined selling criteria information relating to the purchasing of the product, such as volume per unit price, quality, delivery time and warranty information. A buyer will be able to review a list of deals if the seller's selling criteria matches a buyer defined buying criteria. The deal structure is preferably set up so as to provide buyers with both price and non-price criteria information that the buyer's would consider important in a purchase of the type of product being offered by the seller. The deal structure is electronically made available to potential buyers of the product. For example, the deal structure may be displayed on an Internet site.
Metadata
Assignee
- eWinWin, Inc.
Inventor
- Gregory J. Mesaros
Application Information
Application Number:US 13/271,464
Filing Date:2011-10-12
Priority Date:1999-10-22
Art Unit:3687
Classifications
IPC:
G06Q30/00
Patent Drawings (18 sheets)
Description
Cross-Reference to Related Applications
[0001] The present application is a continuation of U.S. patent application Ser. No. 12/887,778 filed Sep. 22, 2010, which is a continuation and claims the priority benefit of U.S. patent application Ser. No. 09/426,063 filed Oct. 22, 1999, now U.S. Pat. No. 7,818,212, the disclosures of the aforementioned applications being incorporated herein by reference.
Background of the Invention
[0002] 1. Technical Field
[0003] The present invention relates to an e-commerce multiple criteria buying and selling methodology and more particularly to a method and apparatus of using the e-commerce multiple criteria buying and selling methodology to conduct business electronically.
[0004] 2. Description of the Related Art
[0005] The buying and selling of products and services has resulted in a vast array of buying schemes which are used to vary the price at which such products are sold.
[0006] One of the most common buying schemes which business encounter everyday is known as volume buying. According to this buying scheme, sellers set a fixed unit price for their products based on the volume of units that a buyer is willing to purchase. Buyers desiring to purchase products from the seller are each required to pay the same fixed price depending on the volume of units the buyer is purchasing. If a seller finds that the demand for a given product is greater or less than expected, the seller may later adjust the fixed price per unit of the product to account for such findings. Although the fixed price per unit system provides a simple way for a seller to conduct business with multiple buyers, one drawback of this buying scheme is that it fails to provide buyers with a choice between a variety of different buying criteria that may be just as important or more important to the buyer than price.
[0007] For example, a buyer that is in need of goods, such as raw materials to make products for an expedited order may be willing to pay a higher price for a faster delivery time. Another buyer may be concerned with the quality of the goods they are purchasing, such that the buyer would pay a higher price for goods having a minimum number of defects. Yet another buyer may be concerned with the warranty time allotted for the goods they are purchasing, and may want the warranty of the goods that they are purchasing to match or exceed the warranty the buyers are offering their own customers.
[0008] Yet another buying scheme that has been advanced in recent years is buyer-driven bidding. According to this buying scheme, a single buyer desiring to obtain a product communicates a price at which the buyer is willing to purchase the product to multiple sellers. Each of the sellers is provided an opportunity to review the buyer's price. A sale is complete when one of the sellers agrees to sell the product to the buyer at the price suggested by the buyer. A buyer-driven bidding scheme is described in U.S. Pat. No. 5,794,207 assigned to Walker Asset Management Limited Partnership of Stamford, Conn. Another buyer-driven bidding scheme is described in U.S. Pat. No. 5,897,620 assigned to priceline.com Inc. of Stamford, Conn. While the buyer-driven bidding scheme provides advantages for certain types of transactions when, for example, sellers may be willing to sell products at lower than normal prices, the uncertainties involved with whether a buyer's offer will be accepted is often problematic for high volume commercial transactions in which the reliability that a transaction will be complete is of paramount importance. Another problem with the present buying schemes is that the buyers have no control in determining the criteria of the product or services that they may receive, while the seller has no control of the type of purchase that the buyers request.
[0009] While the buying schemes described above have various advantages and disadvantages in different situations, a commonality among all of the buying schemes is that each buyer is not given the opportunity to choose amongst different buying criteria, which could be more important to the buyer than the price of the goods and/or services. Furthermore, each seller is not given a chance to offer their goods and/or services based on different selling criteria. In many instances sellers are not even aware of what buyers consider important buying criteria. Additionally, sellers are sometimes not aware of what other selling criteria that other sellers might offer buyers.
[0010] Accordingly, there is a strong need in the art for a multiple criteria buying and selling scheme that provides both buyers and sellers more control in a commercial purchasing transaction, and overcomes the above mentioned drawbacks.
Summary of the Claimed Invention
[0011] According to a preferred embodiment of the present invention, a multiple criteria buying and selling methodology is provided. The multiple criteria buying and selling methodology is structured to provide buyers and sellers with a variety of information relating to criteria in the purchasing of products to complete a business transaction. By providing the buyers and sellers with a variety of information, the buyers are able to make informed decisions in the buying process relating to each buyers' particular needs, and the sellers are able to control the type of purchases for their goods and services. To facilitate buying and selling products using the multiple criteria buying and selling methodology, an electronic forum is provided whereby buyers and sellers are able to conveniently exchange information and order products.
[0012] In the multiple criteria buying and selling methodology, a seller initially establishes a deal structure for a product, which provides selling criteria information relating to the purchasing of the product, such as volume per unit price, quality, delivery time and warranty information that a buyer will be able to review if the selling criteria matches a buyer inputted buying criteria. The deal structure is preferably set up so as to provide buyers with both price and non-price criteria information that the buyer's would consider important in a purchase of the type of product being offered by the seller. The deal structure is electronically made available to potential buyers of the product. For example, the deal structure may be displayed on an Internet site.
[0013] Accordingly, the multiple criteria buying and selling methodology provides more control for both buyers and sellers in the purchasing process. Buyers define the buying criteria they feel is important in purchasing a particular good or service. Sellers define the selling criteria they feel is important to both the buyer and the seller. The buyer is provided with a list of deals in which the buyer's buying criteria falls within the seller's selling criteria. Furthermore, the multiple criteria buying and selling methodology encourages the completion of deals. The multiple criteria buying and selling methodology allows a buyer to complete a deal in an expedited manner. The buyer can control the buying criteria and the seller can control the selling criteria, allowing a more efficient manner of conducting business.
[0014] Thus, according to one aspect of the present invention, a business transaction methodology is provided. The methodology includes the steps of offering a plurality of deals for at least one of a product and service offered by at least one seller inputting a plurality of buying criteria by a buyer for the at least one of a product and service, and outputting a list of deals from amongst the plurality of deals that match the buying criteria of the buyer.
[0015] In accordance with another aspect of the present invention an Internet business transaction system is provided. The Internet business transaction system, includes a computer adapted to be employed by a facilitator for hosting a commercial transaction over the Internet, the computer providing access to at least one buyer and at least one seller to carry out the commercial transaction, wherein at least one buyer makes a purchase from the at least one seller when a plurality of buying criteria defined by the buyer matches a plurality of selling criteria defined by the seller.
[0016] In accordance with yet another aspect of the present invention, a method of conducting a business transaction is provided. The method includes the steps of electronically offering a plurality of deals on at least one of a product and service for sale, each of said plurality of deals being based on different offering criteria than each other of said plurality of deals, electronically searching the deals on the product for sale based on a plurality of ordering criteria, outputting a list of deals of the plurality of deals which offering criteria matches the ordering criteria and selecting one of the deals of the list of deals which offering criteria matches the ordering criteria.
[0017] In accordance with another aspect of the present invention, an electronic signal is provided that is adapted to be transmitted between at least two computers. The electronic signal includes an algorithm for matching a buyer with at least one deal offered by at least one seller, the algorithm matches the buyer with the at least one deal based on a plurality of buying criteria defined by the buyer which matches a plurality of selling criteria defined by the at least one seller.
[0018] In accordance with yet another aspect of the present invention an Internet business transaction system is provided. The internet business transaction system includes means for hosting a commercial transaction over the Internet, the means for hosting provides access to at least one buyer and at least one seller to carry out the commercial transaction, wherein the at least one buyer makes a purchase from the at least one seller when a plurality of ordering criteria, fall within the outer limits of a plurality of offering criteria, each ordering criteria being based on a buyer defined buying criteria, and each offering criteria being defined by the seller.
[0019] In accordance with yet another aspect of the present invention an Internet business transaction system is provided. The Internet business transaction system includes a first computer adapted to be employed by a facilitator for hosting a commercial transaction over the Internet, a second computer adapted to be used by a buyer to link to the first computer to participate in the commercial transaction, a third computer adapted to be used by a seller to link to the first computer to participate in the commercial transaction, wherein the buyer makes a purchase from the seller when a plurality of buyer defined buying criteria matches a plurality of seller defined selling criteria.
[0020] In accordance with yet another aspect of the present invention a server is provided. The server includes a processor, a memory coupled to the processor, and a network interface coupled to the processor for transmitting and receiving data with at least one remote computer system, wherein a plurality of deals for a product offered for sale electronically is stored in the memory, each of the plurality of deals having different seller defined selling criteria, and wherein the server is configured to receive orders for the product from a plurality of different buyers via the at least one remote computer system, by providing the plurality of different buyers with at least one deal of the plurality of deals matching a plurality of buyer defined buying criteria.
[0021] In accordance with still yet another aspect of the present invention, a system for conducting business electronically is provided. The system includes a central server, at least one computer system coupled to the server via a network, wherein a plurality of deals for a product offered for sale electronically is stored in the central server, each of the plurality of deals having different seller defined selling criteria, and wherein the server is configured to receive orders for the product from a plurality of different buyers via the at least one remote computer system, by providing the plurality of buyers with at least one deal of the plurality of deals matching a plurality of buyers defined buying criteria.
[0022] To the accomplishment of the foregoing and related ends, the invention then, comprises the features hereinafter fully described and particularly pointed out in the claims. The following description and the annexed drawings set forth in detail certain illustrative embodiments of the invention. These embodiments are indicative, however, of but a few of the various ways in which the principles of the invention may be employed and the present invention is intended to include all such embodiments and their equivalents. Other objects, advantages and novel features of the invention will become apparent from the following detailed description of the invention when considered in conjunction with the drawings.
Brief Description of the Drawings
[0023] FIG. 1 illustrates a diagrammatic view of a system for electronically conducting business in accordance with one aspect of the present invention;
[0024] FIG. 2 a illustrates a block diagram of a central server in accordance with one aspect of the present invention;
[0025] FIG. 2 b is a schematic illustration of a client computer operatively coupled to a server computer system in accordance with one aspect of the present invention;
[0026] FIG. 3 illustrates a web page providing options to buyers and sellers desiring to conduct business electronically in accordance with one aspect of the present invention;
[0027] FIG. 4 a illustrates a buyer's buying criteria input screen in accordance with one aspect of the present invention;
[0028] FIG. 4 b illustrates a buyer's product ordering criteria input screen in accordance with one aspect of the present invention;
[0029] FIG. 4 c illustrates a list of seller's deals matching the buyer's product ordering criteria in accordance with one aspect of the present invention;
[0030] FIG. 5 illustrates a flow chart for a buyer desiring to conduct business electronically in accordance with one aspect of the present invention;
[0031] FIG. 6 illustrates an on-line registration form for a buyer in accordance with one aspect of the present invention;
[0032] FIG. 7 illustrates a buyer database stored in a central server in accordance with one aspect of the present invention;
[0033] FIG. 8 a illustrates a web page for a buyer to create or modify a deal in accordance with one aspect of the present invention;
[0034] FIG. 8 b illustrates a seller's buying and selling criteria input screen in accordance with one aspect of the present invention;
[0035] FIG. 8 c illustrates a seller's product ordering criteria input screen in accordance with one aspect of the present invention;
[0036] FIG. 8 d illustrates a input screen for adding buying and selling criteria to the deal in accordance with one aspect of the present invention;
[0037] FIG. 9 illustrates a flow chart for a seller desiring to conduct business electronically in accordance with one aspect of the present invention;
[0038] FIG. 10 illustrates an on-line registration form for a seller in accordance with one aspect of the present invention; and
[0039] FIG. 11 illustrates a seller database stored in the central server in accordance with one aspect of the present invention.
Detailed Description
[0040] The present invention will now be described with respect to the accompanying drawings in which like numbered elements represent like parts.
[0041] Referring initially to FIG. 1 , a system 10 is shown in which multiple buyers 15 and sellers 20 are electronically linked via a central server 25. As discussed in more detail below, the central server 25 is configured to provide the buyers 15 and sellers 20 with a convenient forum in which to buy and sell goods in accordance with a multiple criteria buying and selling methodology described herein. The forum may, for example, be a preestablished Internet web page where sellers 20 are able to post product information and the buyers 15 are able to order products. The multiple criteria buying scheme preferably calls for a seller 20 to post a number of deals for a given product, which vary according to different offering criteria defining the limits of a number of selling criteria, such as for example, price, volume, quality and delivery time. Each buyer 15 is able to enter a range of criteria that the buyer would require for a deal to be made. A list of sellers and prospective deals offered by these sellers is generated for the buyers to review. Each buyer 15 can then review the list of deals and choose a deal based on the buyers particular needs. In this manner, each of the buyers 15 can be certain that particular thresholds have been met and also be guaranteed of completing a deal.
[0042] It is to be appreciated that the present invention has wide applicability to the purchasing and/or selling of a variety of different products and/or services. For example, the present invention may be applied within the context of purchasing and/or selling airline tickets wherein buyers criteria may include, for example: (1) reputation of airline; (2) reliability; (3) timeliness; (4) price; (5) number of alternative flights; (6) comfort; (7) quality of service; and (8) quality of foods. The sellers' criteria may include, for =1 example: (1) volume of tickets; (2) buyer's versatility in time schedule; (3) buyer's method of payment, etc.
[0043] The invention may also be applied in the context of purchasing and/or selling an automobile wherein the buyers' criteria may include, for example: (1) reputation of automobile manufacturer, (2) reputation of dealer; (3) price of automobile; (4) delivery options; (5) automobile availability; (6) safety; and (7) financing terms; etc. The sellers' criteria may include, for example: (1) buyer's creditworthiness; (2) desired finance terms; (3) delivery requests of buyer; (4) delivery dates; etc.
[0044] Thus, the present invention intends to allow buyers and/or sellers of products and/or services to pre-select a plurality of criteria prior to negotiating a deal for the product and/or service. Of course the preselected criteria will vary depending on the particular product and/or service. The scope of the present invention as defined in the hereto appended claims intends to include any product and/or service (and plurality of pre-selected criteria associated therewith) suitable for deal-making in accordance with the present invention.
[0045] Each of the buyers 15 and sellers 20 may access the central server 25 in any of a variety of ways. For example, in the present embodiment, each buyer 15 and seller 20 is shown to be part of separate establishments 30 which include one or more respective computer systems 35 and local servers 40. The computer systems 35 may, for example, be a desktop or laptop computer with a local area network (LAN) interface for communicating over a network backbone 45 to the local server 40. The local servers 40, in turn, interface with the central server 25 via a network cable 50 or the like. It will be appreciated that while the present embodiment depicts the computer system 35 communicating with the central server 25 via hardwired network connections, in an alternative embodiment the computer system 35 may interface with the central server 25 using a modem, wireless local area and/or wide area networks, etc. Further, it will be appreciated, that while the buyers 15 and sellers 20 are shown to communicate with the central server 25 via different computer systems 35, it will be appreciated that the buyers 15 and/or sellers 20 may access the central server 25 from the same computer system 25.
[0046] Turning now to FIG. 2 a, a block diagram of the hardware components of the central server 25 is shown. In particular, the central server 25 includes a central processor 100 for performing the various functions described herein. A memory 105 is coupled to the processor 100 and stores operating code and other data associated with the operations of the central server 25. A user interface 110 is also coupled to the processor 100 and provides an interface through which the central server 25 may be directly programmed or accessed. The user interface 110 may, for example, be an alphanumeric keyboard and mouse. A network interface 115 coupled to the processor 100 provides multiple connections for transceiving information with buyers 15 and sellers 20 over the network cables 50.
[0047] As previously stated, the present invention could take advantage of the wide availability and versatility of the Internet. Referring to FIG. 2 b, a schematic block diagram that depicts an environment of interest to a preferred embodiment of the present invention. The client computer system 35 is shown connected to the central server computer system 25 that is part of the Internet 60. The client computer system 35 and server 25 are connected via an Internet connection 55 using a public switched phone network, for example, such as those provided by a local or regional telephone operating company. The Internet connection 55 may also be provided by dedicated data lines, Personal Communication Systems (“PCS”), microwave, or satellite networks, for example, or any suitable means. It is to be understood that the terms client and server are to be construed in the broadest sense, and that all such constructions of the terms are intended to fall within the scope of the hereto appended claims.
[0048] Turning now to FIG. 3 , an exemplary Internet web page 120 which provides buyers 15 and sellers 20 with access to a forum for conducting business using the multiple criteria buying methodology described in detail below, is shown. The web page 120 is shown to include hyperlinks for handling both registered and un-registered buyers and sellers of products. For example, as shown in FIG. 3 , registered buyers may select a hyperlink to a registered buyer login screen via hyperlink 125 while non-registered buyers may select a hyperlink to a non-registered buyer registration screen via hyperlink 135. Similarly, registered sellers may select a hyperlink to a registered seller login screen via hyperlink 130, while non-registered sellers may select a hyperlink to a non-registered seller registration screen via hyperlink 140. While the present embodiment illustrates separate hyperlinks for buyers and sellers, it will be appreciated that such hyperlinks could alternatively be combined and the status of buyer or seller could be determined during a later stage in the login procedure.
[0049] Turning now to FIG. 4 a, in accordance with one embodiment of the present invention, registered buyers 15 enter several product buying criteria into a “Buyer's Buying Criteria” input page 150. The buyer 15 selects a product or service from a list in a scroll down menu 152. It should be appreciated that the list on the scroll down menu 152 could include any number of related or non-related goods and services only limited by the size of a database used in accordance with the present invention. Upon selecting a product or service (e.g., glass) from the scroll down menu 152, a list of seller criteria automatically appears in a window 160. The list of seller criteria appearing in the window 160 is the minimum inputs to be provided by the buyer to obtain a deal listing. These minimum inputs are decided by the class of sellers selling the individual product or service and/or decided by the system administrator of the system. The buyer 15 can then begin adding buyer buying criteria by selecting the criteria from a scroll down list 154, and clicking on an “Add to List” button 156 with a computer mouse (not shown), for example. If the buyer 15 desires to remove a buyer buying criteria, it is only necessary to highlight the criteria in the window 160 and click on a “Remove from List” button 158. Once the list is completed, the buyer 15 may add additional criteria thought to be important to the buyer not in the selection of choices. These additional criteria will not be used by the buyer in this particular deal search, but will be provided to the sellers, so that they can be alerted of these additional criteria important to the buyer. The seller may opt to add to the selectable choices these additional buyer's buying criteria at a later time. Once the complete custom buyer buying criteria list is completed, the buyer can click on the “Submit Criteria” button 162 for submission of the buyer's buying criteria to build a “Buyer's Product Ordering Criteria” input screen 165, as illustrated in FIG. 4 b.
[0050] Turning now to FIG. 4 b, in accordance with one embodiment of the present invention, registered buyers 15 enter several product ordering criteria that would be acceptable to the buyer 15 on the “Buyer's Product Ordering Criteria” input screen 165. In this particular example, the buyer 15 is looking to purchase raw glass by the pound, however, many different types of products and services could be purchased/sold using the present invention. The buyer's ordering criteria of this example includes: price range 166 in dollars per pound; volume range 168 in number of pounds; delivery range 170 in days; the acceptable % of defects 172 in percent; and the minimum required warranty 174 in months. The buyer 15 can then list the names of the sellers 20 in the window 176 that the buyer 15 has bought products from previously, so that the buyer 15 can be entitled to any good customer or multi-purchase discounts offered by the sellers 20. Once the buying ordering criteria is entered, the buyer can search for deals by clicking on the “Search for Deal” button 178 on the computer screen using the computer's mouse. The present invention then utilizes a search engine to search through a database of deals offered by various sellers of the product, and provides an output of those deals to the buyer that matches the buyer's ordering criteria by outputting a list of these deals on a “Deal Matching Ordering Criteria” output page 180, as shown in FIG. 4 c.
[0051] Turning now to FIG. 4 c. in accordance with one embodiment of the present invention, registered sellers 20 set up a variety of deals 182 by which registered buyers 15 are able to order products. As will be discussed in more detail below, the deals 182 of the present embodiment are set up to display the following information which is input from the seller 20 and/or calculated by the processor 100 of the central processor 25 according to the deal 182, which includes: a seller name 184; a deal number 186; a volume ordering range required 188 to obtain a current price/pound level 190; an expected delivery time 192; a warranty period 196; and a percentage of defects 198 of the product the buyer 15 can expect to receive in a given order. Based on such information, buyers 15 can make an informed decision as to whether they desire to commit to an order on a particular deal based on the criteria that is important to that particular buyer. If a buyer 15 desires to place an order, the buyer 15 inputs a seller 183, a deal number 185 and a volume order 187. The buyer 15 then clicks on the “Submit Deal” button 189 with a mouse pointer, for example, on the computer display and the deal is finalized.
[0052] Turning now to FIG. 5 , the general steps taken by a buyer 15 entering the web page 150 is shown. More particularly, in step 200 it is initially determined whether a buyer 15 is registered or not. If the buyer 15 is not registered, the buyer 15 selects hyperlink 135 (FIG. 3 ) and proceeds to step 205. In step 205 the processor 100 of the central server 25 requests that the buyer 15 fill out a registration form. For example, the buyer 15 is requested to fill out a registration form 208 such as that shown in FIG. 6 . In the present example, the registration form 208 requests that the buyer 15 enter the following information: buyer name; address; primary contact person; phone; fax; e-mail; short description of company; preferred login user name; and preferred password. With respect to the user name and password, the processor 100 is configured to determine whether the selected user name and password combination are available and, if not, to prompt the buyer 15 to enter a new user name and password until an available combination is selected.
[0053] In step 210 (FIG. 5 ), the buyer is requested to fill out a credit card application so that purchases made on the web site may be immediately approved. The credit card registration and approval process may be accomplished via a hyperlink to one of various electronic credit card approval agencies which check the buyer's credit rating and set up a merchant account with a line of credit. For example, an electronic credit card approval agency which may be used in conjunction with the present invention can be found on the Internet at http://www.interent-ecommerce.com. Next, in step 215, the processor 100 determines if the credit card application has been approved by the electronic credit card approval agency. If the credit card application has not been approved, the processor 100 proceeds to step 220 where a message is sent back to the buyer 15 indicating regret that they have not been approved for a line of credit and therefore have not successfully completed the registration process. In step 220, a customer service telephone number also is provided to the buyer 15 in case the buyer has questions and/or desires to pursue registration further.
[0054] If in step 215, the processor 100 is informed that the buyer 15 has been provided a line of credit and a credit card number has been issued, the processor 100 proceeds to step 225. In step 225 the buyer information from the registration form 208 and the newly issued credit card number are stored in a buyer database 270 (FIG. 7 ) in the memory 105 of the processor 25 (FIG. 2 a). Next, in step 230, the processor 100 is configured to provide the buyer 15 with the newly issued credit card number so that the buyer 15 is able to purchase products and/or services. Furthermore, the processor 100 is configured to provide a report to the system administrator who then mails a confirmation copy of the buyer's information stored in the buyer's database to the buyer 15. This completes the buyer's registration process.
[0055] Continuing to refer to FIG. 5 , if in step 200, a buyer has already registered, the buyer 15 may login as a registered user by selecting the registered user hyperlink 125 (FIG. 3 ). Once selected, the processor 100, in step 240 prompts the buyer 15 to enter a user ID and password. Upon entry of such information, the processor 100 in step 240 verifies the user ID and password with those stored in the buyer database 270 (FIG. 7 ). If the user ID and password entered by the buyer 15 does not match any entry in the buyer database 270, the processor 100 in step 240 returns to step 235 for re-entry of such information. If, however, in step 240, a valid user ID and password are entered, the processor 100 proceeds to step 245.
[0056] In step 245, the processor 100 provides the buyer 15 with a buyer's buying criteria input screen where the buyer 15 is able to enter a variety of buying criteria that is important to that particular buyer 15. The buyer 15 selects a plurality of buying criteria and submits the criteria, so that the system can build an input ordering criteria form. In step 250, the buyer 15 enters the range of ordering criteria that is acceptable to the buyer in the input ordering criteria form, and then submits this criteria causing the system search engine to match the ordering criteria with a list of seller deals in a seller deal database. The search engine then lists the seller deals matching the buyer's buying and ordering criteria. As discussed above, the deals 182 provided to the buyer 15 provide the buyer 15 with information regarding the sale of a particular product such as, for example, the volume range to get a particular price per pound, the delivery time, the warranty period and the percentage of defects in each order that a buyer can expect. In order to allow a buyer to quickly find deals 182 of interest, the processor 100 in step 245 provides the buyer 15 with the input “Buyer's Buying Criteria” input screen 150, so that active deals 182 of interest may be found.
[0057] Once a search is completed, the buyer 15 in step 250 is able to select a desired deal 182 from the results obtained. For example, the buyer 15 may choose a desired deal because it has a faster delivery time than the other deals. The buyer 15 may choose a deal because it has a low percentage of defects in the goods, or has a longer warranty than other goods. Regardless of the deal, the buyer 15 may choose, the buyer 15 can make an informed decision based on a variety of buying criteria. If the buyer 15 is unsatisfied with the search results or simply desires to re-perform the search, the buyer 15 at any time is able to return back to a previous screen selecting the “back” function available using an Internet browser such as, for example, Microsoft Internet Explorer, Netscape, etc. Additionally, a hyperlink to various screens, such as the search screen, preferably is provided on each web page.
[0058] Upon selecting a deal 182, the processor 100 in step 255 displays a page of standard terms and conditions which the buyer 15 must agree to prior to completing the deal. The terms and conditions relate to the terms governing the sale of the product or service according to which both the buyer and seller are willing to conduct business. If the terms and conditions are not accepted, the processor 100 returns the buyer 15 to step 245, so that another deal 182 may be selected and/or another search may be performed. If, however, in step 260 the terms and conditions are accepted, the processor 100 proceeds to allow the buyer 15 to complete the deal in step 265.
[0059] Turning now to FIG. 8 a, in accordance with one embodiment of the present invention, registered sellers 20 enter into a “Create or Modify Deal” screen 275. The seller 20 can choose a product or service from the product/service scroll down menu 276 and choose to either click on an “Open New Deal” button 278, a “Modify Existing Deal” button 280 or a “Review Buyer Inputted Criteria” button 282. If the buyer selects the “Review Buyer Inputted Criteria” button 282, the seller will be provided with a list of buyer buying criteria that the buyers 15 manually inputted into the window 160 of FIG. 4 a. This allows the sellers 20 to review criteria that is important to their buyers, which the seller were not aware. If a seller 20 chooses to click on the “Open New Deal” button 278, the seller 20 will enter into a “Seller's Product Selling Criteria” input screen 300, as illustrated in FIG. 8 b. If the seller 20 chooses to click on the “Modify Existing Deal” button 280, the seller 20 will enter into a “Seller's Product Offering Criteria” input screen 330, as illustrated in FIG. 8 c with the seller being prompted to enter a deal number, which causes the ordering criteria of the chosen deal number to be editable in the input screen.
[0060] Referring to FIG. 8 b illustrating the “Seller's Selling Criteria” input screen 300, the seller 20 can begin building a new deal by first selecting a number of seller additional criteria, and seller criteria from a list in a scroll down menu 302 and a list in scroll down menu 306, respectively. The seller can click on the “Add Seller Additional Criteria” button 304 for adding seller additional criteria from the scroll down menu 302 into a window 310 containing a deal criteria list 303. The deal criteria list 303 includes a first portion listing the “Product Agreed upon Seller Criteria” 305, decided by the group of sellers for a particular product/service and/or the system administrator, a second portion which is the seller criteria list 307 and a third portion which is the seller additional criteria list 309. It should be noted that the criteria in the seller additional criteria list is not a mandatory criteria for the buyer when the buyer is inputting the buyer's buying criteria in step 245 of FIG. 5 , but is listed in the terms and condition step 265 after a deal is chosen by the buyer. The seller can add seller criteria by selecting the criteria from the scroll down bar 306 and clicking on the “Add Seller Criteria” button 308. The seller can remove any of the criteria from the overall criteria list, except for the “Product Agreed upon Seller Criteria”, by highlighting the selection with the computer mouse and clicking on a “Remove from List” button 312. The seller 20 can add new selling criteria by clicking on a hyperlink 316 labeled “Add New Criteria” sending the seller 20 to an “Adding and Modifying Deal Criteria” screen 360, illustrated in FIG. 8 d. The seller can modify a current criteria by highlighting the criteria in window 310 and clicking on a hyperlink 318 labeled “Modify Existing Criteria” sending the seller to the “Adding and Modifying Deal Criteria” screen 360 with the criteria information defaulting to the highlighted criteria for modification therefrom.
[0061] Referring now to FIG. 8 c, once the criteria is selected and submitted, the system generates the “Seller's Product Offering Criteria” input screen 330. A seller number 331, a product type 332 and a current deal number 333 are automatically generated at the top of input screen 330. The seller 20 can enter offering limits relating to the selling criteria of the seller's product for a particular deal. The seller's offering criteria of this example includes: price 166 in dollars per pound; volume range 168 in the number of pounds; delivery time 170 in days; the % of defects 172 in percent; and the warranty 174 in months. The seller 20 can then list the names of the buyers 15 in a window 344 that the deal is being offered or type in the term “All” if the offer is open to any buyer. Once the seller offering criteria is entered, the seller 20 can submit the deal by clicking on a “Submit/Modify Deal” button 350 on the computer screen by using the computer's mouse. The present invention then creates a record of the deal in a database of deals offered by various sellers 20 of the product, so that deals which seller's offering criteria match the buyer's ordering criteria can be outputted to the buyer 15 in a list of deals on the “Deals Matching Ordering Criteria” output page 180, as shown in FIG. 4 c.
[0062] Referring now to FIG. 8 d, the “Adding Deal Criteria” input screen 360 will be described. The seller number 331, the product type 332 and the current deal number 333 are automatically generated at the top of input screen 360. The seller 20 can enter a criteria name in the “Enter Criteria Name” box 362. The seller can then choose whether the criteria is a seller type or a seller additional criteria type from a first scroll down menu 364. The seller 20 choose a criteria type from a second scroll down menu 366 and the criteria units in a third scroll down menu 368. The seller can submit this new criteria for the current deal by clicking on the “Submit New Criteria for Current Deal” button 370 or add the new criteria for all the product deals by clicking on the “Submit New Criteria for All Product Deals” button 372. The seller 20 may at any time review the buyer inputted criteria submitted by the buyer 15 that is not in any of the seller's deals by clicking on the “Review Buyer Inputted Criteria” button 376. The seller 20 can review this list to determine whether or not the seller 20 would like to add this criteria to the present deal or all deals to ensure that they are in accord with buyer needs. The seller 20 may also review the criteria that are offered by other sellers, but not the current seller, by clicking on a “Review Other Seller Criteria” button 378. This will help the seller keep current on what the other seller's selling criteria are being utilized for matching to the buyer's buying criteria to satisfy the current market demands.
[0063] If the seller would like to return to the “Create or Modify Deal” screen 275 the seller 20 can click on the “Cancel” button at any time. Furthermore, if the seller 20 simply desires to re-perform the search, the seller 20 at any time is able to return back to a previous screen selecting the “back” function available using an Internet browser such as, for example, Microsoft Internet Explorer, Netscape, etc. Additionally, a hyperlink to various screens, such as the search screen, preferably is provided on each web page.
[0064] Proceeding now to FIG. 9 , the operations of the processor 100 of the central server 25 in handling sellers 20 is depicted. In particular, the processor 100 in step 400 initially determines whether a seller 20 is registered or not based on which hyperlink 130, 140 (FIG. 3 ) the seller 20 selects. If the seller 20 selects hyperlink 140 indicating the seller is not registered, the processor 100 proceeds to step 405. In step 405, the processor 100 provides the seller 20 with a seller's registration form 408 (FIG. 10 ) to fill out. The registration form 408 is similar to the registration form 208 for the buyer 20 and allows the seller 20 to select a preferred user ID and password. Once completed, the processor 100 proceeds to step 410 where the seller 20 is requested to submit a credit card application so that all costs and fees associated with conducting business may be directly billed to the seller's credit card. As discussed above, the credit card approval process may occur by a third party vendor accessible via a hyperlink.
[0065] Once the credit card application is submitted by the seller 20, the processor 100 proceeds to step 415 where the processor 100 determines if the credit card application has been approved. If the credit card application has not been approved, the processor 100 proceeds to step 420 where the seller 20 is informed that their credit card application has not been approved and the seller 20 is provided with a customer service telephone number so that the seller 20 may optionally set up the account in a different fashion. If, however, in step 415 the credit card application is accepted, the processor 100 proceeds to step 425 where the seller information is stored in a seller database 427 (FIG. 11 ). Finally, in step 430, the processor 100 is configured to provide the seller 20 with the newly issued credit card number so that the seller 20 is able to open deals. Further, the processor 100 is configured to provide a report to a system administrator who then mails a confirmation copy of the seller's information stored in the seller's database to the seller 20. This completes the seller's registration process.
[0066] Continuing to refer to FIG. 9 , if in step 400 a seller has already registered, the seller 20 may login as a registered user by selecting the registered user hyperlink 130 (FIG. 3 ). Once selected, the processor 100, in step 435 prompts the seller 20 to enter their user ID and password. Upon input of the user ID and password, the processor 100 proceeds to step 440 where the processor 100 verifies a valid user ID and password have been entered by comparison with the information stored in the seller database 427 (FIG. 11 ). If the user ID and password entered by the seller 20 does not match any entry in the seller database 427, the processor 100 in step 440 returns to step 435 for re-entry of such information. If, however, in step 440, a valid user ID and password are entered, the processor 100 proceeds to step 445.
[0067] Upon successful entry of a user ID and password, the seller 20 is provided with a seller option screen 275 as shown in FIG. 8 a. For example, the seller 20 may decide to open a new deal 182 or the seller 20 may decide to view a current deal 182 for one of a number of goods or services offered by the seller 20 or review a list of buyer inputted criteria. Accordingly, if in step 445, the processor 100 determines that the seller 20 desires to open new deal 182 for a selected product, the processor 100 proceeds to step 460.
[0068] In step 460, the processor 100 requests that the seller 20 enter the seller's selling criteria, so that the system can build a seller's product offering criteria input screen, in step 465. For example, in the present embodiment the product agreed upon seller criteria is the volume range of the order and the price per pound of the order, the seller's selling criteria includes the delivery time and warranty with quality to be added next, and the seller additional criteria is that the buyer pay the cost of shipping the goods. As discussed above, the processor 100 utilizes the information input from the seller 20 to display a seller's product ordering input form 330.
[0069] In step 465, the processor 100 request that the seller enter the limits associated with the seller's selling criteria chosen in step 460, and the list of buyer's entitled to be offered the present deal. The information is entered and submitted to form a deal. The processor 100 uses this information to match buying and ordering criteria of the buyer with selling and offering criteria of the seller, so that deals can be completed in an expedited manner.
[0070] Continuing to refer to FIG. 9 , if in step 445, the seller 20 has not selected to open a new deal, the processor 100 determines in step 450 whether the seller 20 has decided to modify an existing deal 182. In the present embodiment of the invention, the seller 20 is limited to modify those deal which they have opened. Accordingly, if the processor 100 determines that the seller does desire to modify a deal 182, the processor 100 provides the seller 20 with a list of deals 180 which the seller has opened. Upon selection of one of the deals 182, the processor 100 proceeds to step 455 where the deal 182 is displayed to the seller 20. If a deal 182 is not entered in step 450, or following steps 455 and 460, the processor 100 returns to step 445.
[0071] The present invention may be implemented via object oriented programming techniques. In this case each component of the system, could be an object in a software routine or a component within an object. Object oriented programming shifts the emphasis of software development away from function decomposition and towards the recognition of units of software called “objects” which encapsulate both data and functions. Object Oriented Programming (OOP) objects are software entities comprising data structures and operations on data. Together, these elements enable objects to model virtually any real-world entity in terms of its characteristics, represented by its data elements, and its behavior represented by its data manipulation functions. In this way, objects can model concrete things like people and computers, and they can model abstract concepts like numbers or geometrical concepts.
[0072] The benefit of object technology arises out of three basic principles: encapsulation, polymorphism and inheritance. Objects hide or encapsulate the internal structure of their data and the algorithms by which their functions work. Instead of exposing these implementation details, objects present interfaces that represent their abstractions cleanly with no extraneous information. Polymorphism takes encapsulation one step further—the idea being many shapes, one interface. A software component can make a request of another component without knowing exactly what that component is. The component that receives the request interprets it and figures out according to its variables and data how to execute the request. The third principle is inheritance, which allows developers to reuse pre-existing design and code. This capability allows developers to avoid creating software from scratch. Rather, through inheritance, developers derive subclasses that inherit behaviors which the developer then customizes to meet particular needs.
[0073] In particular, an object includes, and is characterized by, a set of data (e.g., attributes) and a set of operations (e.g., methods), that can operate on the data. Generally, an object's data is ideally changed only through the operation of the object's methods. Methods in an object are invoked by passing a message to the object (e.g., message passing). The message specifies a method name and an argument list. When the object receives the message, code associated with the named method is executed with the formal parameters of the method bound to the corresponding values in the argument list. Methods and message passing in OOP are analogous to procedures and procedure calls in procedure-oriented software environments.
[0074] However, while procedures operate to modify and return passed parameters, methods operate to modify the internal state of the associated objects (by modifying the data contained therein). The combination of data and methods in objects is called encapsulation. Encapsulation provides for the state of an object to only be changed by well-defined methods associated with the object. When the behavior of an object is confined to such well-defined locations and interfaces, changes (e.g., code modifications) in the object will have minimal impact on the other objects and elements in the system.
[0075] Each object is an instance of some class. A class includes a set of data attributes plus a set of allowable operations (e.g., methods) on the data attributes. As mentioned above, OOP supports inheritance—a class (called a subclass) may be derived from another class (called a base class, parent class, etc.), where the subclass inherits the data attributes and methods of the base class. The subclass may specialize the base class by adding code which overrides the data and/or methods of the base class, or which adds new data attributes and methods. Thus, inheritance represents a mechanism by which abstractions are made increasingly concrete as subclasses are created for greater levels of specialization.
[0076] The present invention can employ abstract classes, which are designs of sets of objects that collaborate to carry out a set of responsibilities. Frameworks are essentially groups of interconnected objects and classes that provide a prefabricated structure for a working application. It should also be appreciated that the PCM and the shared memory components could be implemented utilizing hardware and/or software, and all such variations are intended to fall within the appended claims included herein.
[0077] According to an exemplary embodiment of the present invention, Java and CORBA (Common Object Request Broker Architecture) are employed to carry out the present invention. Java is an object-oriented, distributed, secure, architecture neutral language. Java provides for object-oriented design which facilitates the clean definition of interfaces and makes it possible to provide reusable “software ICs.” Java has an extensive library of routines for copying easily with TCP/IP protocols like HTTP and FTP. Java applications can open and access objects across a network via URLs with the same ease to which programmers are accustomed to accessing a local file system.
[0078] Furthermore, Java utilizes “references” in place of a pointer model and so eliminates the possibility of overwriting memory and corrupting data. Instead of pointer arithmetic that is employed in many conventional systems, the Java “virtual machine” mediates access to Java objects (attributes and methods) in a type-safe way. In addition, it is not possible to turn an arbitrary integer into a reference by casting (as would be the case in C and C++ programs). In so doing, Java enables the construction of virus-free, tamper-free systems. The changes to the semantics of references make it virtually impossible for applications to forge access to data structures or to access private data in objects that they do not have access to. As a result, most activities of viruses are precluded from corrupting a Java system.
[0079] Java affords for the support of applications on networks. Networks are composed of a variety of systems with a variety of CPU and operating system architectures. To enable a Java application to execute anywhere on the network, a compiler generates an architecture neutral object file format—the compiled code is executable on many processors, given the presence of the Java runtime system. Thus, Java is useful not only for networks but also for single system software distribution. In the present personal computer market, application writers have to produce versions of their applications that are compatible with the IBM PC and with the Apple Macintosh. However, with Java, the same version of the application runs on all platforms. The Java compiler accomplishes this by generating byte code instructions which have nothing to do with a particular computer architecture. Rather, they are designed to be both easy to interpret on any machine and easily translated into native machine code on the fly.
[0080] Being architecture neutral, the “implementation dependent” aspects of the system are reduced or eliminated. The Java virtual machine (VM) can execute Java byte codes directly on any machine to which the VM has been ported. Since linking is a more incremental and lightweight process, the development process can be much more rapid and exploratory. As part of the byte code stream, more compile-time information is carried over and available at runtime.
[0081] Thus, the use of Java in the present invention provides a server to send programs over the network as easily as traditional servers send data. These programs can display and manipulate data on a client computer. The present invention through the use of Java supports execution on multiple platforms. That is the same programs can be run on substantially all computers—the same Java program can work on a Macintosh, a Windows 95 machine, a Sun workstation, etc. To effect such multi-platform support, a network interface 105 and a network browser (not shown) such as Netscape Navigator or Microsoft Internet Explorer may be used in at least one embodiment of the present invention. It should be appreciated, however, that a Java stand-alone application may be constructed to achieve a substantially equivalent result. Although the present invention is described with respect to employing Java, it will be appreciated that any suitable programming language may be employed to carry out the present invention.
[0082] An Internet explorer (e.g., Netscape, Microsoft Internet Explorer) is held within the memory of the client computer. The Internet Explorer enables a user to explore the Internet and view documents from the Internet. The Internet Explorer may include client programs for protocol handlers for different Internet protocols (e.g., HTTP, FTP and Gopher) to facilitate browsing using different protocols.
[0083] It is to be appreciated that any programming methodology and/or computer architecture suitable for carrying out the present invention may be employed and are intended to fall within the scope of the hereto appended claims.
[0084] The invention has been described with reference to the preferred embodiments. Obviously, modifications and alterations will occur to others upon reading and understanding the preceding detailed description. It is intended that the invention be construed as including all such modifications alterations, and equivalents thereof and is limited only by the scope of the following claims.
Claims
What is claimed is:
1. A method for electronically conducting business, the method comprising:
storing in memory information regarding a plurality of sellers, each seller offering one or more deals, each deal having a plurality of selling criteria, wherein the selling criteria includes a seller-defined price, characterization of a product or service by type, and versatility in time schedule;
receiving information from a buyer over a communication network, the received buyer information including one or more buying criteria indicating buyer versatility in time schedule and a type of interest of the buyer;
registering the buyer prior to generating a display of the one or more deals to the buyer, wherein registration includes at least receiving buyer address information from the buyer;
generating information to display at least one deal from the plurality of deals, wherein the versatility in time schedule of the at least one deal matches the buyer versatility in time schedule and the at least one deal meets the one or more buying criteria; and
receiving an order for the at least one deal from the buyer over the communication network when the buyer accepts terms and conditions associated with the at least one deal and provides a valid form of payment for the seller-defined price.
2. The method of claim 1, wherein the time schedule includes a limited time frame for delivery of a product or service.
3. The method of claim 1 wherein the buyer address information is stored in a buyer database in memory and wherein the stored buyer address information is referenced in future deal matches.
4. A non-transitory computer-readable storage medium, having embodied thereon a program, the program executable by a processor to perform a method for electronically conducting business, the method comprising:
storing information regarding a plurality of sellers, each seller offering one or more deals, each deal having a plurality of selling criteria, wherein the selling criteria specifies a seller-defined price, characterization of a product or service by type, and a time schedule;
receiving information from a buyer, the received buyer information including one or more buying criteria indicating buyer versatility in time schedule and a type of interest of the buyer;
registering the buyer prior to generating a display of the one or more deals to the buyer, wherein registration includes at least receiving buyer address information from the buyer;
generating information to display at least one deal from the plurality of deals, wherein the versatility in time schedule of the at least one deal matches the buyer versatility in time schedule and the at least one deal meets the one or more buying criteria; and
receiving an order for the at least one deal from the buyer when the buyer accepts terms and conditions associated with the at least one deal and provides a valid form of payment for the seller-defined price.
Patent Citations (326)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4789928(A) | 1988-12-01 | Fujisaki | Applicant |
| US4799156(A) | 1989-01-01 | Shavit et al. | Applicant |
| US4887207(A) | 1989-12-01 | Natarajan | Applicant |
| US4947028(A) | 1990-08-01 | Gorog | Applicant |
| US4992940(A) | 1991-02-01 | Dworkin | Applicant |
| US5053956(A) | 1991-10-01 | Donald et al. | Examiner |
| US5053957(A) | 1991-10-01 | Suzuki | Applicant |
| US5063506(A) | 1991-11-01 | Brockwell et al. | Applicant |
| US5402336(A) | 1995-03-01 | Spiegelhoff et al. | Applicant |
| US5414838(A) | 1995-05-01 | Kolton et al. | Applicant |
| US5444630(A) | 1995-08-01 | Dlugos | Applicant |
| US5564115(A) | 1996-10-01 | Clarkson | Applicant |
| US5592375(A) | 1997-01-01 | Salmon et al. | Applicant |
| US5615109(A) | 1997-03-01 | Eder | Applicant |
| US5623660(A) | 1997-04-01 | Josephson | Applicant |
| US5664115(A) | 1997-09-01 | Fraser | Applicant |
| US5689652(A) | 1997-11-01 | Lupien et al. | Applicant |
| US5710887(A) | 1998-01-01 | Chelliah et al. | Applicant |
| US5717989(A) | 1998-02-01 | Tozzoli et al. | Applicant |
| US5732400(A) | 1998-03-01 | Mandler et al. | Applicant |
| US5734890(A) | 1998-03-01 | Case et al. | Applicant |
| US5794207(A) | 1998-08-01 | Walker et al. | Applicant |
| US5797127(A) | 1998-08-01 | Walker et al. | Applicant |
| US5822736(A) | 1998-10-01 | Hartman et al. | Applicant |
| US5826244(A) | 1998-10-01 | Huberman | Applicant |
| US5835896(A) | 1998-11-01 | Fisher et al. | Applicant |
| US5837071(A) | 1998-11-01 | Anderson et al. | Applicant |
| US5842178(A) | 1998-11-01 | Giovannoli | Applicant |
| US5845265(A) | 1998-12-01 | Woolston | Applicant |
| US5850442(A) | 1998-12-01 | Muftic | Applicant |
| US5870721(A) | 1999-02-01 | Norris | Applicant |
| US5878400(A) | 1999-03-01 | Carter, III | Applicant |
| US5890138(A) | 1999-03-01 | Godin et al. | Applicant |
| US5897620(A) | 1999-04-01 | Walker et al. | Applicant |
| US5903830(A) | 1999-05-01 | Joao et al. | Applicant |
| US5923741(A) | 1999-07-01 | Wright et al. | Applicant |
| US5933817(A) | 1999-08-01 | Hucal | Applicant |
| US5940807(A) | 1999-08-01 | Purcell | Examiner |
| US5945653(A) | 1999-08-01 | Walker et al. | Applicant |
| US5950172(A) | 1999-09-01 | Klingman | Applicant |
| US5960411(A) | 1999-09-01 | Hartman et al. | Applicant |
| US5966697(A) | 1999-10-01 | Fergerson et al. | Applicant |
| US5970478(A) | 1999-10-01 | Walker et al. | Applicant |
| US5974396(A) | 1999-10-01 | Anderson et al. | Examiner |
| US5974406(A) | 1999-10-01 | Bisdikian et al. | Applicant |
| US5987434(A) | 1999-11-01 | Libman | Applicant |
| US5995943(A) | 1999-11-01 | Bull et al. | Applicant |
| US6014638(A) | 2000-01-01 | Burge et al. | Applicant |
| US6016484(A) | 2000-01-01 | Williams et al. | Applicant |
| US6026383(A) | 2000-02-01 | Ausubel | Applicant |
| US6035289(A) | 2000-03-01 | Chou et al. | Applicant |
| US6052670(A) | 2000-04-01 | Johnson | Applicant |
| US6055519(A) | 2000-04-01 | Kennedy et al. | Applicant |
| US6064981(A) | 2000-05-01 | Barni et al. | Applicant |
| US6078906(A) | 2000-06-01 | Huberman | Applicant |
| US6101484(A) | 2000-08-01 | Halbert et al. | Applicant |
| US6108632(A) | 2000-08-01 | Reeder et al. | Applicant |
| US6108639(A) | 2000-08-01 | Walker et al. | Applicant |
| US6112185(A) | 2000-08-01 | Walker et al. | Applicant |
| US6112189(A) | 2000-08-01 | Rickard et al. | Applicant |
| US6131087(A) | 2000-10-01 | Luke et al. | Applicant |
| US6141653(A) | 2000-10-01 | Conklin et al. | Applicant |
| US6151588(A) | 2000-11-01 | Tozzoli et al. | Applicant |
| US6154738(A) | 2000-11-01 | Call | Applicant |
| US6167383(A) | 2000-12-01 | Henson | Applicant |
| US6195646(B1) | 2001-02-01 | Grosh et al. | Applicant |
| US6219653(B1) | 2001-04-01 | O'Neill et al. | Applicant |
| US6233566(B1) | 2001-05-01 | Levine et al. | Applicant |
| US6236972(B1) | 2001-05-01 | Shkedy | Applicant |
| US6236977(B1) | 2001-05-01 | Verba et al. | Examiner |
| US6236978(B1) | 2001-05-01 | Tuzhilin | Applicant |
| US6249772(B1) | 2001-06-01 | Walker et al. | Applicant |
| US6253189(B1) | 2001-06-01 | Feezell et al. | Applicant |
| US6260019(B1) | 2001-07-01 | Courts | Applicant |
| US6260024(B1) | 2001-07-01 | Shkedy | Applicant |
| US6266651(B1) | 2001-07-01 | Woolston | Applicant |
| US6269343(B1) | 2001-07-01 | Pallakof | Applicant |
| US6289348(B1) | 2001-09-01 | Richard et al. | Applicant |
| US6323894(B1) | 2001-11-01 | Katz | Applicant |
| US6332127(B1) | 2001-12-01 | Bandera et al. | Applicant |
| US6332135(B1) | 2001-12-01 | Conklin et al. | Applicant |
| US6336105(B1) | 2002-01-01 | Conklin et al. | Applicant |
| US6338050(B1) | 2002-01-01 | Conklin et al. | Applicant |
| US6360205(B1) | 2002-03-01 | Iyengar et al. | Applicant |
| US6397208(B1) | 2002-05-01 | Lee | Applicant |
| US6415270(B1) | 2002-07-01 | Rackson et al. | Applicant |
| US6418415(B1) | 2002-07-01 | Walker et al. | Applicant |
| US6418441(B1) | 2002-07-01 | Call | Applicant |
| US6449601(B1) | 2002-09-01 | Friedland et al. | Applicant |
| US6450407(B1) | 2002-09-01 | Freeman et al. | Applicant |
| US6456986(B1) | 2002-09-01 | Boardman et al. | Applicant |
| US6466919(B1) | 2002-10-01 | Walker et al. | Applicant |
| US6496568(B1) | 2002-12-01 | Nelson | Applicant |
| US6505046(B1) | 2003-01-01 | Baker | Applicant |
| US6507279(B2) | 2003-01-01 | Loof | Applicant |
| US6519571(B1) | 2003-02-01 | Guheen et al. | Applicant |
| US6553346(B1) | 2003-04-01 | Walker et al. | Applicant |
| US6553350(B2) | 2003-04-01 | Carter | Applicant |
| US6560501(B1) | 2003-05-01 | Walser et al. | Applicant |
| US6578014(B1) | 2003-06-01 | Murcko, Jr. | Applicant |
| US6584451(B1) | 2003-06-01 | Shoham et al. | Applicant |
| US6587835(B1) | 2003-07-01 | Treyz et al. | Applicant |
| US6598026(B1) | 2003-07-01 | Ojha et al. | Examiner |
| US6601043(B1) | 2003-07-01 | Purcell | Examiner |
| US6604089(B1) | 2003-08-01 | Van Horn et al. | Applicant |
| US6606607(B1) | 2003-08-01 | Martin et al. | Applicant |
| US6607136(B1) | 2003-08-01 | Atsmon et al. | Applicant |
| US6631356(B1) | 2003-10-01 | Van Horn et al. | Applicant |
| US6647257(B2) | 2003-11-01 | Owensby | Applicant |
| US6647373(B1) | 2003-11-01 | Carlton-Foss | Applicant |
| US6658093(B1) | 2003-12-01 | Langseth et al. | Applicant |
| US6662194(B1) | 2003-12-01 | Joao et al. | Applicant |
| US6716101(B1) | 2004-04-01 | Meadows et al. | Applicant |
| US6754636(B1) | 2004-06-01 | Walker et al. | Applicant |
| US6778968(B1) | 2004-08-01 | Gulati | Applicant |
| US6782370(B1) | 2004-08-01 | Stack | Applicant |
| US6785661(B1) | 2004-08-01 | Mandler et al. | Applicant |
| US6847938(B1) | 2005-01-01 | Moore | Applicant |
| US6847965(B2) | 2005-01-01 | Walker et al. | Applicant |
| US6850907(B2) | 2005-02-01 | Lutnick et al. | Applicant |
| US6868392(B1) | 2005-03-01 | Ogasawara | Applicant |
| US6871140(B1) | 2005-03-01 | Florance et al. | Applicant |
| US6871190(B1) | 2005-03-01 | Seymour et al. | Applicant |
| US6876977(B1) | 2005-04-01 | Marks | Applicant |
| US6876982(B1) | 2005-04-01 | Lancaster | Examiner |
| US6876983(B1) | 2005-04-01 | Goddard | Applicant |
| US6877655(B1) | 2005-04-01 | Robertson et al. | Applicant |
| US6877665(B2) | 2005-04-01 | Challa et al. | Applicant |
| US6915275(B2) | 2005-07-01 | Banerjee et al. | Applicant |
| US6925446(B2) | 2005-08-01 | Watanabe | Applicant |
| US6934690(B1) | 2005-08-01 | Van Horn et al. | Applicant |
| US6954734(B1) | 2005-10-01 | Kuelbs et al. | Applicant |
| US6990467(B1) | 2006-01-01 | Kwan | Applicant |
| US6992794(B2) | 2006-01-01 | Keane et al. | Applicant |
| US7039603(B2) | 2006-05-01 | Walker et al. | Applicant |
| US7047206(B1) | 2006-05-01 | Schultze | Applicant |
| US7062452(B1) | 2006-06-01 | Lotvin et al. | Applicant |
| US7065494(B1) | 2006-06-01 | Evans | Applicant |
| US7069228(B1) | 2006-06-01 | Rose et al. | Applicant |
| US7072849(B1) | 2006-07-01 | Filepp et al. | Applicant |
| US7072853(B2) | 2006-07-01 | Shkedi | Applicant |
| US7076447(B1) | 2006-07-01 | Peyser et al. | Applicant |
| US7080030(B2) | 2006-07-01 | Eglen et al. | Applicant |
| US7103565(B1) | 2006-09-01 | Vaid | Applicant |
| US7107225(B1) | 2006-09-01 | McClung, III | Applicant |
| US7107226(B1) | 2006-09-01 | Cassidy et al. | Applicant |
| US7120592(B1) | 2006-10-01 | Lewis | Applicant |
| US7124099(B2) | 2006-10-01 | Mesaros | Applicant |
| US7124107(B1) | 2006-10-01 | Pishevar et al. | Applicant |
| US7133835(B1) | 2006-11-01 | Fusz et al. | Applicant |
| US7143057(B2) | 2006-11-01 | Kuelbs et al. | Applicant |
| US7146330(B1) | 2006-12-01 | Aion et al. | Applicant |
| US7165045(B1) | 2007-01-01 | Kim-E | Applicant |
| US7181419(B1) | 2007-02-01 | Mesaros | Applicant |
| US7194427(B1) | 2007-03-01 | Van Horn et al. | Applicant |
| US7194442(B1) | 2007-03-01 | Flanagan et al. | Applicant |
| US7213754(B2) | 2007-05-01 | Eglen et al. | Applicant |
| US7243082(B1) | 2007-07-01 | Forlai | Examiner |
| US7254833(B1) | 2007-08-01 | Cornelius et al. | Applicant |
| US7263505(B1) | 2007-08-01 | Forlai | Examiner |
| US7296001(B1) | 2007-11-01 | Ephrati et al. | Applicant |
| US7330826(B1) | 2008-02-01 | Porat et al. | Applicant |
| US7343317(B2) | 2008-03-01 | Jokinen et al. | Applicant |
| US7349890(B1) | 2008-03-01 | Pathak et al. | Applicant |
| US7363246(B1) | 2008-04-01 | Van Horn et al. | Applicant |
| US7364086(B2) | 2008-04-01 | Mesaros | Applicant |
| US7379899(B1) | 2008-05-01 | Junger | Applicant |
| US7415428(B2) | 2008-08-01 | Garwood | Applicant |
| US7415617(B2) | 2008-08-01 | Ginter et al. | Examiner |
| US7464051(B1) | 2008-12-01 | Heggem | Applicant |
| US7475024(B1) | 2009-01-01 | Phan | Applicant |
| US7496543(B1) | 2009-02-01 | Bamford et al. | Applicant |
| US7539742(B2) | 2009-05-01 | Spector | Applicant |
| US7552069(B2) | 2009-06-01 | Kepecs | Applicant |
| US7584146(B1) | 2009-09-01 | Duhon | Examiner |
| US7593871(B1) | 2009-09-01 | Mesaros | Applicant |
| US7599857(B2) | 2009-10-01 | Bishop et al. | Applicant |
| US7630919(B1) | 2009-12-01 | Obrecht | Applicant |
| US7636672(B2) | 2009-12-01 | Angles et al. | Applicant |
| US7672870(B2) | 2010-03-01 | Haines et al. | Applicant |
| US7680696(B1) | 2010-03-01 | Murray | Applicant |
| US7689463(B1) | 2010-03-01 | Mesaros | Applicant |
| US7689468(B2) | 2010-03-01 | Walker et al. | Applicant |
| US7689469(B1) | 2010-03-01 | Mesaros | Applicant |
| US7693748(B1) | 2010-04-01 | Mesaros | Examiner |
| US7698173(B1) | 2010-04-01 | Burge et al. | Applicant |
| US7698240(B1) | 2010-04-01 | Chatterjee et al. | Examiner |
| US7706838(B2) | 2010-04-01 | Atsmon et al. | Applicant |
| US7725350(B2) | 2010-05-01 | Schlee | Applicant |
| US7729977(B2) | 2010-06-01 | Xiao et al. | Examiner |
| US7747473(B1) | 2010-06-01 | Mesaros | Applicant |
| US7801803(B2) | 2010-09-01 | Forlai | Examiner |
| US7813955(B2) | 2010-10-01 | Ariff et al. | Applicant |
| US7814106(B2) | 2010-10-01 | Guido et al. | Applicant |
| US7815114(B2) | 2010-10-01 | Mesaros | Applicant |
| US7818212(B1) | 2010-10-01 | Mesaros | Applicant |
| US7860776(B1) | 2010-12-01 | Chin et al. | Applicant |
| US7890373(B2) | 2011-02-01 | Junger | Applicant |
| US7899707(B1) | 2011-03-01 | Mesaros | Examiner |
| US7912761(B2) | 2011-03-01 | Vaid | Applicant |
| US7917386(B2) | 2011-03-01 | Christensen | Applicant |
| US7937288(B2) | 2011-05-01 | Blaser et al. | Applicant |
| US7942316(B2) | 2011-05-01 | Bennett et al. | Examiner |
| US7958007(B2) | 2011-06-01 | Urbanski et al. | Applicant |
| US8005747(B2) | 2011-08-01 | Forlai | Applicant |
| US8032409(B1) | 2011-10-01 | Mikurak | Applicant |
| US8032422(B2) | 2011-10-01 | Pickard et al. | Applicant |
| US8036941(B2) | 2011-10-01 | Bennett et al. | Examiner |
| US8073762(B2) | 2011-12-01 | Sheth et al. | Examiner |
| US8140402(B1) | 2012-03-01 | Mesaros | Applicant |
| US8140405(B2) | 2012-03-01 | Mesaros | Applicant |
| US8140442(B2) | 2012-03-01 | Heyer | Examiner |
| US8160931(B2) | 2012-04-01 | Mesaros | Applicant |
| US8196811(B2) | 2012-06-01 | Mesaros | Applicant |
| US2001/0011264(A1) | 2001-08-01 | Kawasaki | Applicant |
| US2001/0014868(A1) | 2001-08-01 | Herz et al. | Applicant |
| US2001/0018660(A1) | 2001-08-01 | Sehr | Applicant |
| US2001/0039514(A1) | 2001-11-01 | Barenbaum | Applicant |
| US2001/0044751(A1) | 2001-11-01 | Pugliese, III et al. | Applicant |
| US2001/0047296(A1) | 2001-11-01 | Wyker | Applicant |
| US2001/0047311(A1) | 2001-11-01 | Singh | Applicant |
| US2002/0026351(A1) | 2002-02-01 | Coleman | Applicant |
| US2002/0032573(A1) | 2002-03-01 | Williams et al. | Applicant |
| US2002/0035536(A1) | 2002-03-01 | Gellman | Applicant |
| US2002/0040352(A1) | 2002-04-01 | McCormick | Applicant |
| US2002/0046105(A1) | 2002-04-01 | Gardenswartz et al. | Applicant |
| US2002/0046147(A1) | 2002-04-01 | Livesay et al. | Applicant |
| US2002/0052782(A1) | 2002-05-01 | Landesmann | Applicant |
| US2002/0065762(A1) | 2002-05-01 | Lee et al. | Applicant |
| US2002/0065769(A1) | 2002-05-01 | Irribarren et al. | Applicant |
| US2002/0069079(A1) | 2002-06-01 | Vega | Applicant |
| US2002/0080950(A1) | 2002-06-01 | Koko et al. | Applicant |
| US2002/0091580(A1) | 2002-07-01 | Wang | Applicant |
| US2002/0099643(A1) | 2002-07-01 | Abeshouse et al. | Applicant |
| US2002/0103741(A1) | 2002-08-01 | Boies et al. | Applicant |
| US2002/0107773(A1) | 2002-08-01 | Abdou | Applicant |
| US2002/0116282(A1) | 2002-08-01 | Martin et al. | Applicant |
| US2002/0143692(A1) | 2002-10-01 | Heimermann et al. | Applicant |
| US2002/0147670(A1) | 2002-10-01 | Lange | Applicant |
| US2002/0165771(A1) | 2002-11-01 | Walker et al. | Applicant |
| US2002/0165821(A1) | 2002-11-01 | Tree | Applicant |
| US2002/0169703(A1) | 2002-11-01 | Lutnick et al. | Applicant |
| US2002/0169759(A1) | 2002-11-01 | Kraft et al. | Applicant |
| US2002/0174051(A1) | 2002-11-01 | Wise | Applicant |
| US2002/0188508(A1) | 2002-12-01 | Lee et al. | Applicant |
| US2003/0004802(A1) | 2003-01-01 | Callegari | Applicant |
| US2003/0004808(A1) | 2003-01-01 | Elhaoussine et al. | Applicant |
| US2003/0028473(A1) | 2003-02-01 | Eso et al. | Applicant |
| US2003/0041002(A1) | 2003-02-01 | Hao et al. | Applicant |
| US2003/0055774(A1) | 2003-03-01 | Ginsberg | Applicant |
| US2003/0093355(A1) | 2003-05-01 | Issa | Applicant |
| US2003/0109949(A1) | 2003-06-01 | Ikeda | Applicant |
| US2003/0111531(A1) | 2003-06-01 | Williams et al. | Applicant |
| US2003/0126040(A1) | 2003-07-01 | Mesaros | Applicant |
| US2003/0126250(A1) | 2003-07-01 | Jhanji | Applicant |
| US2003/0149619(A1) | 2003-08-01 | Stanley et al. | Applicant |
| US2003/0167222(A1) | 2003-09-01 | Mehrotra et al. | Applicant |
| US2003/0195832(A1) | 2003-10-01 | Cao et al. | Applicant |
| US2003/0208412(A1) | 2003-11-01 | Hillestad et al. | Applicant |
| US2003/0216960(A1) | 2003-11-01 | Postrel | Applicant |
| US2003/0233276(A1) | 2003-12-01 | Pearlman et al. | Applicant |
| US2003/0233557(A1) | 2003-12-01 | Zimmerman | Applicant |
| US2004/0015415(A1) | 2004-01-01 | Cofino et al. | Applicant |
| US2004/0039661(A1) | 2004-02-01 | Fuzell-Casey et al. | Applicant |
| US2004/0039677(A1) | 2004-02-01 | Mura et al. | Applicant |
| US2004/0128197(A1) | 2004-07-01 | Bam et al. | Applicant |
| US2004/0215500(A1) | 2004-10-01 | Monahan | Applicant |
| US2005/0021400(A1) | 2005-01-01 | Postrel | Applicant |
| US2005/0021401(A1) | 2005-01-01 | Postrel | Applicant |
| US2005/0038713(A1) | 2005-02-01 | Pickard et al. | Applicant |
| US2005/0149458(A1) | 2005-07-01 | Eglen et al. | Applicant |
| US2005/0171918(A1) | 2005-08-01 | Eden et al. | Applicant |
| US2005/0197857(A1) | 2005-09-01 | Avery | Applicant |
| US2005/0216337(A1) | 2005-09-01 | Roberts et al. | Applicant |
| US2005/0272442(A1) | 2005-12-01 | Miller et al. | Applicant |
| US2005/0273415(A1) | 2005-12-01 | Mathews et al. | Applicant |
| US2006/0059062(A1) | 2006-03-01 | Wood et al. | Applicant |
| US2006/0069619(A1) | 2006-03-01 | Walker et al. | Applicant |
| US2006/0095366(A1) | 2006-05-01 | Sheth et al. | Applicant |
| US2006/0106678(A1) | 2006-05-01 | Walker | Applicant |
| US2006/0129454(A1) | 2006-06-01 | Moon et al. | Applicant |
| US2006/0143080(A1) | 2006-06-01 | Garg et al. | Applicant |
| US2006/0178918(A1) | 2006-08-01 | Mikurak | Applicant |
| US2007/0150349(A1) | 2007-06-01 | Handel et al. | Applicant |
| US2007/0220169(A1) | 2007-09-01 | Silver et al. | Applicant |
| US2008/0015711(A1) | 2008-01-01 | Charland et al. | Applicant |
| US2008/0052189(A1) | 2008-02-01 | Walker et al. | Applicant |
| US2008/0126201(A1) | 2008-05-01 | Ullah | Applicant |
| US2009/0055328(A1) | 2009-02-01 | Bamford et al. | Applicant |
| US2009/0059856(A1) | 2009-03-01 | Kermoal et al. | Applicant |
| US2009/0083136(A1) | 2009-03-01 | Blackwood | Applicant |
| US2009/0187455(A1) | 2009-07-01 | Fernandes et al. | Applicant |
| US2009/0198622(A1) | 2009-08-01 | Temte et al. | Applicant |
| US2009/0307073(A1) | 2009-12-01 | MirrokniBanadaki et al. | Applicant |
| US2009/0327034(A1) | 2009-12-01 | Peterson | Applicant |
| US2009/0327038(A1) | 2009-12-01 | Peterson | Applicant |
| US2009/0327101(A1) | 2009-12-01 | Sayed | Applicant |
| US2009/0327140(A1) | 2009-12-01 | Kuo | Applicant |
| US2010/0088174(A1) | 2010-04-01 | Cohagan et al. | Applicant |
| US2010/0125525(A1) | 2010-05-01 | Inamdar | Applicant |
| US2011/0004515(A1) | 2011-01-01 | Mesaros | Applicant |
| US2011/0016010(A1) | 2011-01-01 | Mesaros | Applicant |
| US2011/0040624(A1) | 2011-02-01 | Jhanji | Applicant |
| US2011/0125592(A1) | 2011-05-01 | Mesaros | Applicant |
| US2011/0213648(A1) | 2011-09-01 | Mesaros | Applicant |
| US2011/0213649(A1) | 2011-09-01 | Mesaros | Applicant |
| US2011/0213650(A1) | 2011-09-01 | Mesaros | Applicant |
| US2011/0213653(A1) | 2011-09-01 | Mesaros | Applicant |
| US2011/0238476(A1) | 2011-09-01 | Carr et al. | Applicant |
| US2011/0246271(A1) | 2011-10-01 | Mesaros | Applicant |
| US2011/0246274(A1) | 2011-10-01 | Mesaros | Applicant |
| US2011/0264499(A1) | 2011-10-01 | Abendroth et al. | Applicant |
| US2011/0270699(A1) | 2011-11-01 | Mesaros | Applicant |
| US2011/0270700(A1) | 2011-11-01 | Mesaros | Applicant |
| US2012/0029993(A1) | 2012-02-01 | Mesaros | Applicant |
| US2012/0029995(A1) | 2012-02-01 | Mesaros | Applicant |
| US2012/0035999(A1) | 2012-02-01 | Mesaros | Applicant |
| US2012/0036000(A1) | 2012-02-01 | Mesaros | Applicant |
| US2012/0036031(A1) | 2012-02-01 | Mesaros | Applicant |
| US2012/0041811(A1) | 2012-02-01 | Mesaros | Applicant |
| US2012/0054012(A1) | 2012-03-01 | Mesaros | Applicant |
| JP11-184910 | 1999-07-01 | Applicant | |
| WO98/21713 | 1998-04-01 | Applicant | |
| WO/50970 | 2000-08-01 | Applicant | |
| WO/70424 | 2000-11-01 | Applicant | |
| WO2008/083371 | 2008-07-01 | Applicant |
Non-Patent Literature (99)
- “Magna Cash Cybersource Partner to Expand Online Payment Options,” PR Newswire, New York, Jan. 15, 2001.Applicant
- Abad, P.L. “Supplier pricing and lot sizing when demand is price sensitive”. Abad, P.L. Fac. of Bus., McMaster Univ., Hamilton, Ont., Canada. European Journal of Operational Research , vol. 78, No. 3, p. 334-54. Date: Nov. 10, 1994 [recovered from Dialog on Oct. 20, 2009].Applicant
- Accompany: How it Works: “Anatomy of a Buy-Cycle”, Jun. 15, 1999, pp. 1-3.Applicant
- Amazon.com, “Earths Biggest Selection,” Jun. 30, 2001, archived by Archive.org: http://web.archive.org/web/20010630130618/http://www.amazon.com/exec/obidos/subst/ome/home.html.Applicant
- Amazon.com, “Help/Shipping”, Archived on Feb. 2, 2003 by www.archive.org. Last accessed Mar. 19, 2008, 9 pages.Applicant
- Anon, “Global Real Estate Markets Spell Opportunity, Experts Tell Realtors,” PR Newswire, Nov. 21, 1991.Applicant
- Anon, “MobShop Selected by WHN(TM) (WhatsHotNow.com (R), Inc.) to Power Demand Aggregation Within Its Licensed Merchandise Marketplace; Demand Aggregation Technology Enables Marketplaces to Improve Liquidity by Generating Volume Transactions,” PR Newswire, San Francisco, Jan. 16, 2001.Applicant
- Anon., “China—Welcome to the Machine: New Machinery, Electronics b-to-b Web,” China Online, Jul. 24, 2000.Applicant
- Anon., “Domain TradeLIVE! Launched by solutionhome.com,” Business Wire, Oct. 20, 1999.Applicant
- Anon., “ELCOM: Virgin Trains Cuts Procurement Costs with elcom.com; New Electronic Ordering System Offers Personalised Pricing,” M2 Presswire, Jul. 18, 2000.Applicant
- Anon., “Excite@Home Standardizes on Siebel eBusiness; Leading Broadband Media Company Relies on Siebel Systems to Manage Customer Relationships Across Its Entire Family of Services,” Business Wire, Jan. 19, 2000.Applicant
- Anon., “Lucent Launches On-Line Catalog,” M2 Presswire, Jan. 22, 1999.Applicant
- Anon., “Screen Savers,” Lawyer, Feb. 19, 2001.Applicant
- Anon., “The Oil & Gas Asset Clearinghouse, a Petroleum Place Company, to Host Its Second Exclusively Online Auction of Oil & Gas Properties on Aug. 14-16, 2000,” PR Newswire, p. 5591, Aug. 3, 2000.Applicant
- Ashton Technology Group, Inc. Announces NASDAQ National Market System Listing; Enters into Clearing Arrangements with 8 National Brokerage Firms, Business Wire, Jan. 3, 2000. http://www.findarticles.com/p/articles/mi.sub.--m0EIN/is.sub.--2000.sub.-- -Jan.sub.--3/ai.sub.--58429780/print. Last accessed Apr. 8, 2009, 3 pages.Applicant
- Beaty. Mass Customisation. Manufacturing Engineer, vol. 75, issue 5, Oct. 1996, pp. 217-220.Applicant
- Blyth, et al. Merchandising System Collecting Data. Derwent Information Ltd. Last accessed Jan. 20, 2009, 2 pages.Applicant
- Boroshok, Jon, “Wireless, Location-Based, Shopping Portal being Tested in New York City and San Francisco by GeePS.com, Inc.,” published Apr. 3, 2000, New York, NY and San Francisco, CA; as downloaded from http://www.techmarcom.com/geeps.html on Jan. 6, 2012.Applicant
- Breyer. “Bargains in Cyberspace,” National Home Center News, vol. 26, No. 21, p. 21, Nov. 20, 2000.Applicant
- Business Editors and High Tech Writers, “eWinWin Announces the Release of DAS 3.0, the Next Generation of B2B Demand Aggregation Solutions” Dec. 28, 2000, Businee wire, p. 1 (4 pages).Applicant
- Business Editors. “Weatherchem Announces Major eCommerce Success with eWinWin”, Aug. 9, 2001, Business Wire, (p. 1) 2 pages.Applicant
- Business/High Tech Editors “Mercata Launches Compelling Alternative to Online Auctions,” Business Wire, Nov. 15, 2000.Applicant
- Chicago Board of Trade, “Knowledge Center,” as archived by Archive.org, on Feb. 13, 2003.Applicant
- Computer Geeks Discount Outlet, “Order Status,” Mar. 1, 2002.Applicant
- De Gheest, Computer Implemented Electronic Bidding for Electronic Sales Application. Derwent Acc No. 2001-006585, © Derwent Information Ltd. Last accessed Sep. 17, 2010, 2 pages.Applicant
- Deierlein. “Smart Fuel Buying,” Fleet Equipment, vol. 24, No. 8, pp. 42-44, Aug. 1998.Applicant
- Dibiase. The Inventory Simulator: A Micro Computer Based Inventory Model. Modeling and Simulation on Microcomputers, Paul F. Hogan, ed., Society for Computer Simulation (SCS), La Jolla, pp. 104-106, Jan. 1987.Applicant
- Easley, et al. Time and the Process of Security Price Adjustment, Journal of Finance, vol. 47, No. 2, Jun. 1992. http://ideas.repec.org/a/bla/jfinan/v47y1992i2p576-605.html. Last accessed Sep. 10, 2009, 30 pages.Applicant
- ebay.com “eBay Services: The Feedback Forum,” Aug. 1, 2001, archived by archive.org: “http://web.archive.org/web/20010801145144/http://pages.ebay.com/services/forum/feedback.html”.Applicant
- Edwards, L.M., “Increase Your Bottom Line: Automated Customer Service and Marketing,” E-Business Advisor, vol. 17, No. 7, p. 30, Jul. 1999.Applicant
- Enos. Vying to be the Top Dog. Upside vol. 12, No. 3, pp. 160-165, Mar. 2000.Applicant
- eWinWin, “eCommerce Redefined : The Positive Impact of eWinWin's Demand Aggregation System on the Manufacturing Supply Chain”, Oct. 2000. Last accessed Mar. 19, 2008, 11 pages.Applicant
- Gaonkar, et al. Strategic Sourcing and Collaborative Planning in Internet Enabled Supply Chain Networks Producing Multigeneration Products. IEEE Transactions on Automation Science and Engineering, vol. 2, issue 1, Jan. 2005, pp. 54-66.Applicant
- Garner, K., “Culture Vulture: Up from Under—Germaine Greer,” Off our Backs, Jun. 24, 1971, vol. 1, Iss. 23, p. 14.Applicant
- Gurley. Creating a Great E-Commerce Business. Fortune, Mar. 16, 1998.Applicant
- Ha, Sung Ho et al., “Matching Buyers and Suppliers: An Intelligent Dynamic-Exchange Model,” IEEE Intelligent Systems, 2001.Applicant
- Hinze, Annika et al., “Location- and Time-Based Information Delivery in Tourism,” as downloaded Apr. 20, 2012 from http://page.mi.fu-berlin.de/voisard/Papers/sstd03.pdf.Applicant
- IEEE Xplore Search Results, Aug. 12, 2007.Applicant
- International Search Report and Written Opinion for PCT Application No. PCT/US07/89195, mailed May 12, 2008, 8 pages.Applicant
- Jonsson et al., “Impact of Processing and Queueing Times on Order Quantities,” Material Flow, vol. 2, No. 4, pp. 221-230, Aug. 1985 [cited in related U.S. Appl. No. 09/922,884 on May 7, 2004].Applicant
- Kantrow, American Express Sets a Three-Tier Pricing on Optima, Dialog: File 148 #05812190 (The Gale Group), American Banker, v157, n25, p. 1(2), Feb. 6, 1992.Applicant
- Kauffman et al., “Bid Together Buy Together, On the Efficacy of Group-Buying Business models in Internet-based Selling,” May 16, 2001.Applicant
- Koenig, et al. Quantitative Industrial Ecology. IEEE Transactions on Systems, Man and Cybernetics, Part C, Issue 1, Feb. 1998, pp. 16-28.Applicant
- Lamparter, W.C., “Natural Selection,” American Printer, vol. 217, No. 3, pp. 54-64, Jun. 1996.Applicant
- Mack, Going Local. Adweek, Jul. 10, 2000, pp. 38-38.6, © 2006 ProQuest Info&Learning. Last accessed Sep. 17, 2010, 2 pages.Applicant
- Market Engineering Research for Structural Impacts of e-Business in the European Chemicals Industry (Ch. 3), Structural Impact of e-Business on the Chemicals Industry, Frost & Sullivan, Market Research Report, Jun. 2001.Applicant
- Maxwell, Pricing education in the United States of America: responding to the needs of business, the Journal of Product & Brand Management, Santa Barbara, Aug. 1998, vol. 7, Issue 4, p. 336-341.Applicant
- Medrano, et al. Strategic Behaviour and Price Discovery, RAND Journal of Economics, vol. 32, No. 2, Jun. 21, 2001 https://editorialexpress.com/cgi-bin/rje.sub.--online.cgi?action=view&year=2001&issue=sum&page=221&&tid=83197&sc=uogfbloa. Last accessed Sep. 3, 2009, 29 pages.Applicant
- Mercata.com “How to Ship an Order” Oct. 22, 2000, archived by archive.org: http://web.archive.org/web/20001022035135/http://www.mercata.com/cgi-bin/mercata/mercata/v1/pages/editorial.jsp?name=Ship+an+Order.Applicant
- Mercata.com, archived by archive.org on or before Jun. 19, 2000.Applicant
- Meridex Introduces Advanced Features to its B2B Network, PR Newswire, May 25, 2000. http://www.canadait.com/cfm/index.cfm?It=106&Id=3421&Se=355&Sv=- Company&Lo=441. Last accessed Apr. 30, 2009, 3 pages.Applicant
- Merriam-Webster's Collegiate Dictionary, Tenth Edition, 1997, p. 732.Applicant
- Mesaros. Innovation in Difficult Times : How US Manufacturers are Using Demand Aggregation to Increase Sales and Lower Costs. Jul. 26, 2001. Last accessed Mar. 19, 2008, 4 pages.Applicant
- Millman, H., “Legacy Data Links Shrinks Costs,” InfoWorld, vol. 20, No. 1, pp. 51, 56, Jan. 5, 1998.Applicant
- MobShop Launches New Rev of Selling App, Online Reporter, May 28, 2001. http://findarticles.com/p/articles/mi.sub.--hb5932/is.sub.--200105/ai.sub- .--n23884526/. Last accessed Apr. 30, 2009, 2 pages.Applicant
- Moody. From E-Commerce to We-Commerce. Computer Weekly, 42, Jun. 3, 1999. Last accessed Apr. 9, 2009, 2 pages.Applicant
- Mullich, J., “Altrade Serves as a Natural Resource—a Head Start and Big Trading Volume Give the Natural Gas Marketplace a Competitive Edge. Can It Last?” InformationWeek, p. 152, Jun. 12, 2000.Applicant
- Munson, Donald “Trading in Futures Can Provide Considerable Financial Rewards”, CBOT, Last accessed Mar. 19, 2008, 41 pages.Applicant
- Myers. “E-Solutions for Surplus Inventory,” Dsn Retailing Today, vol. 39, No. 21, p. 13, Nov. 6, 2000.Applicant
- Nellore, et al. Factors Influencing Success in Integrated Product Development (IPD) Projects. IEEE Transactions on Engineering Management, vol. 48, issue 2, May 2001, pp. 164-174.Applicant
- O'Gorman, et al. Considerations for Connecting Renewable Generation into Bulk Supply Networks. Sixth International Conference on Advances in Power System Control, Operation and Management, ASDCOM 2003, vol. 2, Nov. 11-14, pp. 674-680. Last accessed Sep. 10, 2009, 7 pages.Applicant
- Park, Sung Eun et al., “Efficient bid pricing based on costing methods for Internet bid systems,” Dept. of Comput. Eng., Dongguk Univ., South Korea. Book Title: Web Information Systems—WISE 2006. 7th International Conference on Web Information Systems Engineering. Proceedings (Lecture Notes in Computer Science vol. 42).Applicant
- Rahim, M.A., et al., “Optimal Decision Rules for Determining the Length of the Production Run” (Abstract only), Computers and Industrial Engineering, vol. 9, No. 2, pp. 195-202, 1985.Applicant
- Rahim, M.A., et al., “Optimal Production Run for a Process Having Multilevel Tool Wear” (Abstract only), International Journal of Systems Science, vol. 19, No. 1, pp. 139-149, 1988.Applicant
- Rahim, M.A., et al., “Optimal Production Run for a Process with Random Linear Drift” (Abstract only), Omega, vol. 16, No. 4, pp. 347-351, 1988.Applicant
- Rajaraman, Rajesh et al., “The Effect of Demand Elasticity on Security Prices for the Poolco and Multi-Lateral Contract Models,” IEEE Transactions on Power Systems, vol. 12, No. 3, Aug. 1997.Applicant
- Rozic, Jeff “Who's Watching While You Surf?” Inside Business 3, 5, 64, May 2001.Applicant
- Scott. Chains of Trust, Supply Chain Management, Manufacturing Engineer, vol. 75, issue 4, Aug. 1996, pp. 172-174.Applicant
- Scott. Supply Partnerships and the Effective Management of Low Cost Components. Transforming Your Material Flow: A Practical Insight Into World Class Logistics and Supply Chain Management IEE Colloquium on, Mar. 19, 1996, pp. 2/1-2/4.Applicant
- Scott. Supply Partnerships in the Aerospace Industry. Transforming Your Material Flow: A Practical Insight Into World Class Logistics and Supply Chain Management IEE Colloquium on, Oct. 24, 1996, pp. 3/1-3/3.Applicant
- Sivakumar, et al. Price Match Guarantees: Rationale, Implementation, and Consumer Response. Pricing Strategy and Practice, Bradford, 1996, vol. 4, issue 4, 11 pgs. Recovered from ProQuest Database Aug. 25, 2006.Applicant
- Sjostrom. Price Discrimination by Shipping Conferences. Logistics and Transportation Review, Jun. 1992, [from Dialog.RTM. File 15, Acc.No. 00727777 93-76998].Applicant
- Stacklin. “Bridgestone Printing Unit Teams with ewinwin”, Mar. 25, 2002, Crain's Cleveland Business, vol. 23, issue 12, 3 pages.Applicant
- Swartz, Wireless Ads: Loved/Loathed. Wireless Review, Oct. 1, 2000, © 2006 The Gale Gropu. Last accessed Sep. 17, 2010.Applicant
- Tanaka. “As Other Companies Crumble, Ecount Carves Out Niche in Online-Payment Services.” Knight Rider Tribune News Service, Washington, Feb. 27, 2002. (Recovered from ProQuest Database Dec. 4, 2006.).Applicant
- Thomas, et al. JIT: Strategies for Distant Suppliers (Abstract). Business, vol. 40, No. 4, pp. 36-39, Dec. 1990.Applicant
- Tippr http://www.tipper.com/ Internet Archive (Feb. 29, 2008)—http://web.archive.org/web/20080229121727/http://tippr.com/.Applicant
- Watson. The Effects of Demand Forecast Fluctuations on Customer Service and Inventory Cost When Demand is Lumpy. Journal of the Operational Research Society, vol. 38, No. 1, pp. 75-82, Jan. 1987. http://www.palgrave-journals.com/jors/journal/v38/n1/abs/jors19879a.html. Last accessed Sep. 10, 2009, 8 pages.Applicant
- Wayback Machine. “Searched for http://www.ewinwin.com/corp/ewinwinwhitepaper.pdf”, Oct. 2, 2008, Archive. org.Applicant
- WHN Selects MobShop to Power Aggregated Buying for WHN Exchange. Jan. 23, 2001. http://www.allbusiness.com/retail-trade/4291613-1.html. Last accessed Sep. 11, 2009, 2 pages.Applicant
- Yeh, R.H., et al., “Optimal Production Run Length for Products Sold with Warranty” (Abstract only), European Journal of Operational Research, vol. 120, No. 3, pp. 575-582, Feb. 1, 2000.Applicant
- Adam et al. “Strategic Directions in Electronic Commerce and Digital Libraries: Towards a Digital Agora”. ACM Computing Surveys [Online] 1996, vol. 28, Issue 4, pp. 818-835.Applicant
- U.S. Appl. No. 09/922,884 Final Office Action mailed Jan. 4, 2012.Applicant
- U.S. Appl. No. 13/104,723 Office Action mailed Mar. 22, 2012.Applicant
- U.S. Appl. No. 13/106,622 Final Office Action mailed Jan. 3, 2012.Applicant
- U.S. Appl. No. 13/270,133 Office Action mailed Jan. 3, 2012.Applicant
- U.S. Appl. No. 13/272,147 Office Action mailed Jan. 10, 2012.Applicant
- U.S. Appl. No. 12/710,095 Office Action mailed Apr. 6, 2012.Applicant
- U.S. Appl. No. 13/161,192 Office Action mailed Apr. 5, 2012.Applicant
- U.S. Appl. No. 13/251,668 Office Action mailed Feb. 9, 2012.Applicant
- U.S. Appl. No. 13/251,668 Final Office Action mailed Apr. 17, 2012.Applicant
- U.S. Appl. No. 13/160,128 Final Office Action mailed Feb. 22, 2012.Applicant
- U.S Appl. No. 13/105,387 Office Action mailed Jan. 3, 2012.Applicant
- U.S. Appl. No. 09/922,884 Office Action mailed May 1, 2012.Applicant
- U.S. Appl. No. 13/104,723 Final Office Action mailed Jun. 8, 2012.Applicant
- U.S. Appl. No. 13/270,133 Final Office Action mailed Jun. 12, 2012.Applicant
- U.S. Appl. No. 13/292,971 Office Action mailed Jun. 14, 2012.Applicant
- U.S. Appl. No. 13/272,144 Office Action mailed May 16, 2012.Applicant
- U.S. Appl. No. 11/680,415 Final Office Action mailed May 2, 2012.Applicant