US 8,438,075 B2Grant
Method and computer medium for facilitating a buyer-initiated feature within a business transaction
Issue Date:2013-05-07
•32 Claims
•21 Drawing Sheets
Abstract
A system and method for conducting electronic business between buyers and sellers is provided. The system and method disclose a means for at least one buyer to request and receive online bids from one or more sellers of a particular product according to a price curve or price schedule. A price schedule or curve for a product defining a product's unit price as a function of the volume of product ordered. Upon receipt of a plurality of bids from sellers, a buyer can then select a seller-supplier based at least in part on the price schedule.
Metadata
Assignee
- eWinWin, Inc.
Inventor
- Gregory J. Mesaros
Application Information
Application Number:US 13/492,659
Filing Date:2012-06-08
Priority Date:2002-08-28
Art Unit:3625
Classifications
IPC:
G06Q30/00
Patent Drawings (21 sheets)
Description
Cross-Reference to Related Applications
[0001] The present application is a continuation and claims the priority benefit of U.S. patent application Ser. No. 12/704,280 filed Feb. 11, 2010, which is a continuation and claims the priority benefit of U.S. patent application Ser. No. 10/650,635 filed Aug. 28, 2003, now U.S. Pat. No. 7,689,463, which claims the benefit of U.S. provisional application No. 60/406,475 filed Aug. 28, 2002, the disclosures of which are incorporated herein by reference.
Background of the Invention
[0002] 1. Technical Field
[0003] The present invention relates to demand aggregation and more particularly to a system and method for utilizing a volume pricing curve in conjunction with multiple suppliers.
[0004] 2. Background of the Invention
[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 which 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. 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 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.
Summary of the Invention
[0009] The following presents a simplified summary of the invention in order to provide a basic understanding of some aspects of the invention. This summary is not an extensive overview of the invention. It is intended neither to identify key or critical elements of the invention nor delineate the scope of the invention. Its sole purpose is to present some concepts of the invention in a simplified form as a prelude to the more detailed description that is presented later.
[0010] A system and method for demand aggregation with multiple suppliers is provided. At least one buyer can request a plurality of suppliers to respond to an online bid. The suppliers can review terms of the request and accept or submit changes for the buyer's review. Upon agreed terms, the suppliers submit bids based on the request. A price curve displays a lowest price bid for a respective price point on the curve, along with the corresponding supplier. A buyer can then select a supplier based on the curve.
[0011] 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 aspects of the invention. These aspects 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 aspects 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
[0012] FIG. 1 illustrates a diagrammatic view of a system for electronically conducting business in accordance with an aspect of the present invention.
[0013] FIG. 2 a illustrates a block diagram of a central server in accordance with an aspect of the present invention.
[0014] FIG. 2 b is a schematic illustration of a client computer operatively coupled to a server computer system in accordance with an aspect of the present invention.
[0015] FIG. 3 illustrates a web page providing options to buyers and sellers desiring to conduct business electronically in accordance with an aspect of the present invention.
[0016] FIG. 4 a illustrates a buyer's buying criteria input screen in accordance with an aspect of the present invention.
[0017] FIG. 4 b illustrates a buyer's product ordering criteria input screen in accordance with an aspect of the present invention.
[0018] FIG. 4 c illustrates a list of seller's deals matching the buyer's product ordering criteria in accordance with an aspect of the present invention.
[0019] FIG. 5 illustrates a flow chart for a buyer desiring to conduct business electronically in accordance with an aspect of the present invention.
[0020] FIG. 6 illustrates an on-line registration form for a buyer in accordance with an aspect of the present invention.
[0021] FIG. 7 illustrates a buyer database stored in a central server in accordance with an aspect of the present invention.
[0022] FIG. 8 a illustrates a web page for a buyer to create or modify a deal in accordance with an aspect of the present invention.
[0023] FIG. 8 b illustrates a seller's buying and selling criteria input screen in accordance with an aspect of the present invention.
[0024] FIG. 8 c illustrates a seller's product ordering criteria input screen in accordance with an aspect of the present invention.
[0025] FIG. 8 d illustrates a input screen for adding buying and selling criteria to the deal in accordance with an aspect of the present invention.
[0026] FIG. 9 illustrates a flow chart for a seller desiring to conduct business electronically in accordance with an aspect of the present invention.
[0027] FIG. 10 illustrates an on-line registration form for a seller in accordance with an aspect of the present invention.
[0028] FIG. 11 illustrates a seller database stored in the central server in accordance with an aspect of the present invention.
[0029] FIG. 12 is a schematic illustration of an electronic forum for conducting a buyer sponsored business transaction in accordance with an aspect of the present invention.
[0030] FIG. 13 is an exemplary bid form in accordance with an aspect of the present invention.
[0031] FIG. 14 is a schematic illustration of an electronic forum for conducting a buyer and seller co-sponsored business transaction in accordance with an aspect of the present invention.
Detailed Description of the Invention
[0032] The present invention will now be described with respect to the accompanying drawings in which like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It may be evident, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block form in order to facilitate describing the present invention.
[0033] As used in this application, the terms “component” and “system” are intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a server and the server can be a component. One or more components may reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers.
[0034] 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 pre-established 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 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.
[0035] 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 example: (1) volume of tickets; (2) buyer's versatility in time schedule; (3) buyer's method of payment, etc.
[0036] The present invention may also be applied in the context of purchasing and/or selling an automobile wherein buyer's 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. While, the seller's criteria may include, for example: (1) buyer's creditworthiness; (2) desired finance terms; (3) delivery requests of buyer; (4) delivery dates; etc.
[0037] 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 pre-selected 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.
[0038] 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 aspect, 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 aspect depicts the computer system 35 communicating with the central server 25 via hardwired network connections, in an alternative aspect 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.
[0039] 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.
[0040] 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 one aspect 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”), cable, 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.
[0041] 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 aspect 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.
[0042] Turning now to FIG. 4 a, in accordance with one aspect 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.
[0043] Turning now to FIG. 4 b, in accordance with one aspect 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.
[0044] Turning now to FIG. 4 c. in accordance with one aspect 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 aspect 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.
[0045] 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.
[0046] 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.
[0047] 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.
[0048] 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.
[0049] 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.
[0050] 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.
[0051] 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.
[0052] Turning now to FIG. 8 a, in accordance with one aspect 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.
[0053] 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 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.
[0054] Referring now to FIG. 8 c, once the criteria is/are 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.
[0055] 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.
[0056] 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.
[0057] 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.
[0058] 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.
[0059] 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.
[0060] 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.
[0061] 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 aspect 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.
[0062] 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.
[0063] 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 aspect of the invention, the seller 20 is limited to modify those deals 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.
[0064] Regarding FIG. 12 , although the present invention has been largely described within the context of a seller sponsored deal room, it is to be appreciated that a buyer or buyers may sponsor a deal room to aggregate purchasing goods/services from a plurality of sellers. For example, a buyer can license a DealRoom and requests that suppliers respond to an online offer. With a pre-approved name and password (e.g., from the registration page completed by the supplier), the supplier can see the offer with offer details and/or a specification. The supplier can choose to agree to accept terms of the specification; alternatively, the supplier can make a change to the offer and submit such changes for the buyer's review.
[0065] Referring briefly to FIG. 13 , an exemplary bid form 500 is illustrated. Exemplary bid form 500 contains price schedule 502 for specifying volume price points, details section 504 for indicating specific details of the offer, remarks section 506 for submitting changes to bid for a buyer to review, and buttons 508 for, inter alia, modifying prices, initiating display of the current low bids, and submitting a bid to the buyer. Thus, for example, a supplier can be asked to complete an online bid 500 for a set volume of widgets. Supplier A sees a form such as bid form 500 that includes details 504 of the offer (e.g. ship date, range, time period of offer, minimum volume quantity, total quantity available, volume reached on last offer, volume of last x number of offers, average for this product over the past x number of offers) and price points 502 for the supplier to complete. As an illustration of this example:
[0066] A buyer requests a supplier to complete an online bid for the following price schedule or curve (as shown in FIG. 13 ):
[0067] Up to 100,000 widgets
[0068] 100,001 to 300,000 widgets
[0069] 301,000 to 500,000 widgets
[0070] 500,001 to 1,000,000 widgets
[0071] Supplier A completes price information as follows:
[0072] Up to 100,000 widgets: $5.50 per widget
[0073] 100,001 to 300,000 widgets: $4.50 per widget
[0074] 301,000 to 500,000 widgets: $4.00 per widget
[0075] 500,001 to 1,000,000 widgets: $3.75 per widget
[0076] The supplier then submits the price information to the requesting buyer (e.g., by clicking a submit button). According to one aspect of the present invention, the supplier may be able to see other bids submitted by other companies. The bids can be shown in a variety of formats including: by supplier's name, by lowest price to highest price, by price curves (both individual and in comparison to one another), by the lowest priced supplier at each price point, etc. The curve can also be shown in “the lowest price at each price point” and indicate the supplier as well for each price level, as illustrated below:
[0077] Up to 100,000 widgets: $5.00 per widget—Supplier B
[0078] 100,001 to 300,000 widgets: $4.25 per widget—Supplier B
[0079] 301,000 to 500,000 widgets: $4.00 per widget—Supplier A
[0080] 500,001 to 1,000,000 widgets: $3.65 per widget—Supplier D
[0081] Furthermore, it should be noted that buyers can define a period of time for receiving all bids from suppliers.
[0082] A price curve can be displayed online such that information received from the suppliers can be viewed in real time. The supplier can quickly modify these prices by clicking on a “modify price” for each of the price tiers. Additionally, it should be noted that a bid can be marked as a “lowest price wins” bid or “price is but one component of the bid” as determined by the buyer. This type of bid marking facilitates a pricing strategy determination by the supplier.
[0083] Submitting bids can be performed in a variety of ways. For example, a period of time can be posted in which changes will be accepted. The price curve changes in real time; however, upon expiration of the time period the price curve can become fixed. The supplier can view the suppliers that have “won” at the end of the time period and/or have presented a lowest price for a corresponding price point. As another example, a buyer can define a time in which the suppliers must have their final bids submitted. Subsequently, when the bids are received by the buyer, the bids automatically populate according to a lowest price at each price point. Price curves can then be posted to a website for participating suppliers to view the final bids received.
[0084] Additionally, the system can include a resubmit price curve feature. The resubmit feature allows a supplier to automatically replenish a current price curve with a previously submitted price curve. The system can also include a matching feature. The matching feature allows a supplier to match a winning price curve from a previous bidding session.
[0085] A buyer, authorized to access an order (e.g., with a username and password), can view a current price curve and place an order for a volume of widgets listed. The buyer can view which supplier is associated with each price point. For example, the buyer can move a cursor over the price point and see the supplier with the lowest price at this point. Alternatively, the buyer can view a list all suppliers that have submitted price curves and can sort the list by the lowest price bids. Accordingly, the buyer does not have to select the supplier that submitted the lowest bid. Instead, the buyer can set parameters or rules within selection software based on a differential between a first supplier and a second supplier. For instance, if the first supplier is within 15% of lowest price, the first supplier should be given the “price slot” for that part of the curve and/or a supplier that won the last round for the price curve will be a default supplier if the next price given is not more than 5% more than the current supplier's price curve. The parameters/rules can be published for the supplier to review prior to accepting to bid.
[0086] The buyer can also determine a product ship date. For example, the offer can have the following selections:
[0087] Single date: October 5th
[0088] Multiple ship dates: October 5th, November 5th, December 5th
[0089] Range of dates: October 1 thru October 8th
[0090] Additionally, the buyer can review the offer and, after placing an order, make a change to the ship date and enter new volumes for each ship date. Although, changes can be limited to a defined time period established by the buyer and agreed to by the supplier.
[0091] Furthermore, as volume is ordered and the ship dates are selected, the price curve can be set to dynamically change to reflect a current state of the order. As more volume is ordered, the price continues to drop. As an example:
[0092] Each buyer is able to place his/her order and then select from the ship dates shown:
[0093] 20,000 widgets ordered
[0094] Current price point:
[0095] The ship dates are shown:
[0096] October 8th: 10,000 widgets
[0097] November 8th: 5,000 widgets
[0098] December 8th: 5,000 widgets
[0099] Flexibility can be built into the delivery schedule as well based on requirements of the buyer. Additionally, buyers can later add to the order (e.g., by selecting an icon). Any additional product ordered during this period falls under the last price point achieved. As an alternative, if the price point reached during an offer was supplier A, and the volume continues to increase after the order, the price can adjust in accordance with the original price curve.
[0100] The multiple supplier demand aggregation system can also include a “running” demand aggregation scenario. This scenario includes a predetermined time for an open order period (e.g., six months). If there is a supplier within a lowest price tier, then the supplier agrees to a predetermined number of ship dates (e.g., one per month) and is considered the current supplier for the order or the incumbent. As more products are ordered during the set time period, the price can continue to decrease. Then, at the end of the time period, a final price is determined, an average price paid is shown, and if the average price paid is higher than the final price shown on the curve, system software calculates an amount the supplier owes the buyer. For example, if 500,000 pieces are ordered with a price shown of $3.50 per piece and the average price paid during the period was $4.00 per piece, then the software calculates the amount per piece and the total number of pieces purchased and submits the rebate amount to the supplier as well as to the buyer.
[0101] Additionally, the rebate can be determined during the order based on a current price curve. For instance, if the first price was $5.00 per piece and the volume ordered decreases the price to the next tier or to $4.50, then the buyer would submit a request for a rebate for the amount paid at $5.00 and once received, begin paying the lower price moving forward.
[0102] The system can also include a real time rebate curve. For example, buyers purchase enough volume to reach a second price tier. If the first price tier is $5.00 per piece and the second price tier is $4.50 per piece after 50,000 were ordered, the buyer would be entitled to a difference of 50,000.times.0.50 or $25,000. The software would calculate this and either inform the supplier of the deficit of the rebate, or the software could calculate the next price tier to achieve.
[0103] A variety of options also exist to parcel out the rebate including but not limited to: Not charging product fees until the rebate amount, or amount owed, is recovered. The original companies that ordered would receive their commensurate rebate amount based on a percentage of products they ordered out of the total products ordered. This figure would also be saved on their online records. They could have a credit for future purchases or be refunded the rebate to their online accounts. A reduced fee with a predetermined price floor (e.g., $2.00 per piece) is established and agreed to by the buyer and/or supplier until the rebate amount is recouped from the volume. A period of time could be established to make up the difference. Then, the buyers and supplier would be notified and a second price ($4.50 in the example above) would be established at that new price point. This process of options may continue throughout the downward slope of the price curve as more volume is ordered.
[0104] Regarding FIG. 13 , although the present invention has been largely described within the context of a seller sponsored deal room/transaction, it is to be appreciated that buyers and sellers may concurrently sponsor a deal room/transaction to aggregate selling of and purchasing of goods/services by a plurality of sellers and buyers respectively. For example, a multiple sellers and buyers may employ the present invention to create a deal room/transaction forum where a plurality of sellers and buyers may assemble to aggregate selling and buying of specific goods and/or services that the sellers which to sell and the buyers desire to purchase. Such a transaction forum creates great efficiencies with respect to purchase price and/or selling quantity of particular goods/services. For example, in such a forum dedicated to the selling and purchasing of a specific product/service, sellers can assemble to compete for the sale of their respective product/service which leads to pricing efficiencies. Buyers can assemble in such a forum to aggregate buying power in order to negotiate good prices and close deals. Sellers on the other hand may also aggregate to meet the needs of a large buying block.
[0105] The subject specification describes exemplary systems and interfaces for implementing the subject invention, and therefore further discussion thereto is omitted for sake of brevity. However, it is to be appreciated that one skilled in the art based on the above discussion regarding seller sponsored deal rooms/transactions could apply such teachings to implement the aforementioned buyer sponsored deal room/transaction.
[0106] 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.
[0107] 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.
[0108] 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.
[0109] 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.
[0110] 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.
[0111] 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.
[0112] According to an exemplary aspect 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.
[0113] 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.
[0114] 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.
[0115] 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.
[0116] 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 aspect 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 or programming environment may be employed to carry out the present invention.
[0117] 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.
[0118] 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.
[0119] Furthermore, while the invention has been described supra in the general context of computer-executable instructions of a computer program that runs on a computer and/or computers, those skilled in the art will recognize that the invention also may be implemented in combination with other program modules. Generally, program modules include routines, programs, components, data structures, etc. that perform particular tasks and/or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the inventive methods may be practiced with other computer system configurations, including single-processor or multiprocessor computer systems, mini-computing devices, mainframe computers, as well as personal computers, hand-held computing devices, microprocessor-based or programmable consumer electronics, and the like.
[0120] What has been described above includes examples of the present invention. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the present invention, but one of ordinary skill in the art may recognize that many further combinations and permutations of the present invention are possible. Accordingly, the present invention is intended to embrace all such alterations, modifications and variations that fall within the spirit and scope of the appended claims. Furthermore, to the extent that the term “includes” is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term “comprising” as “comprising” is interpreted when employed as a transitional word in a claim.
Claims
What is claimed is:
1. A non-transitory computer readable storage medium stored on a hand-held computing device, the medium having embodied thereon instructions executable by a processor to:
receive through an input of the hand-held device a first request to receive a plurality of offers for purchase of a product or service, the request including a selection of pre-determined criteria associated with the good or service, the pre-determined criteria being established and presented by a third party;
receive information for a plurality of offers related to the first request, the plurality of offers including at least one discounted price with a price per unit for the product or service, a quantity associated with the discounted price, and a time period associated with the delivery of the good or service;
permit the buyer to alter the time period after the purchase;
provide a supplier of the good or service with an indication that the delivery time has been altered by the buyer; and
display a listing of the received plurality of offers.
2. The non-transitory computer readable storage medium of claim 1, the instructions further executable to transmit the first request to a server.
3. The non-transitory computer readable storage medium of claim 2, wherein the information is received from the server in response to the first request.
4. The non-transitory computer readable storage medium of claim 1, wherein the first request includes a search request.
5. The non-transitory computer readable storage medium of claim 1, wherein the information is associated with one or more updated offers.
6. The non-transitory computer readable storage medium of claim 5, wherein the information is updated in real-time.
7. The non-transitory computer readable storage medium of claim 2, the instructions further executable to transmit the second request to a server in communication with computing devices associated with the plurality of merchants.
8. The non-transitory computer readable storage medium of claim 1, wherein the altering of the time period associated with the delivery of the good or service includes the ability to select a different time period from a list of options.
9. The non-transitory computer readable storage medium of claim 8, wherein the ability to select a different time period includes an option to add a quantity to the initial order.
10. The non-transitory computer readable storage medium of claim 1, wherein the altering of the time period associated with the delivery of the good or service includes the ability to select an additional time period.
11. The non-transitory computer readable storage medium of claim 10, wherein an additional time period includes a quantity and a recurring delivery schedule.
12. The non-transitory computer readable storage medium of claim 11, wherein the delivery schedule is expressed in days, weeks, or months.
13. The non-transitory computer readable storage medium of claim 11, wherein at least one of the quantity or recurring delivery schedule can be changed by the buyer at a later time to alter future deliveries.
14. The non-transitory computer readable storage medium of claim 1, wherein the purchase is made by way of credit card information associated with the buyer and stored in an online account.
15. The non-transitory computer readable storage medium of claim 1, wherein the altering of the time period associated with the delivery of the good or service includes an option to select a quantity and a recurring delivery time period.
16. The non-transitory computer readable storage medium of claim 15, wherein the time period is expressed in days, weeks, or months.
17. The non-transitory computer readable storage medium of claim 15, wherein the option selected by a buyer is stored to an online account associated with the buyer and allows the buyer to receive at least one of a price discount, credit, or rebate.
18. The non-transitory computer readable storage medium of claim 1, wherein the selectable criteria includes a category and a feature associated with the category.
19. The non-transitory computer readable storage medium of claim 1, wherein the selectable criteria includes information related to the reputation of at least one seller.
20. A system for facilitating a buyer-initiated feature within a business transaction, the system comprising:
a processor;
a memory;
one or more software modules stored in the memory and executable by the processor to:
receive through an input of a hand-held device a first request to receive a plurality of offers for purchase of a product or service, the request including a selection of pre-determined criteria associated with the good or service, the pre-determined criteria being established and presented by a third party;
receive information for a plurality of offers related to the first request, the plurality of offers including at least one discounted price with a price per unit for the product or service, a quantity associated with the discounted price, and a time period associated with the delivery of the good or service;
permit the buyer to alter the time period after the purchase;
provide a supplier of the good or service with an indication that the delivery time has been altered by the buyer; and
display a listing of the received plurality of offers.
21. The system of claim 20, wherein the first request includes a search request.
22. The system of claim 20, the instructions further executable to transmit the second request to a server in communication with computing devices associated with the plurality of merchants.
23. The system of claim 20, wherein the altering of the time period associated with the delivery of the good or service includes the ability to select a different time period from a list of options.
24. The system of claim 23, wherein the ability to select a different time period includes an option to add a quantity to the initial order.
25. The system of claim 20, wherein the altering of the time period associated with the delivery of the good or service includes the ability to select an additional time period.
26. The system of claim 25, wherein an additional time period includes a quantity and a recurring delivery schedule.
27. The system of claim 26, wherein the delivery schedule is expressed in days, weeks, or months.
28. The system of claim 26, wherein at least one of the quantity or recurring delivery schedule can be changed by the buyer at a later time to alter future deliveries.
29. The system of claim 20, wherein the altering of the time period associated with the delivery of the good or service includes an option to select a quantity and a recurring delivery time period.
30. The system of claim 29, wherein the time period is expressed in days, weeks, or months.
31. The system of claim 29, wherein the option selected by a buyer is stored to an online account associated with the buyer and allows the buyer to receive at least one of a price discount, credit, or rebate.
32. The system of claim 20, wherein the selectable criteria includes a category and a feature associated with the category.
Patent Citations (396)
| 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. | Applicant |
| 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 | Andersson 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 |
| US5884271(A) | 1999-03-01 | Pitroda | 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 | Applicant |
| 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. | Applicant |
| 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 |
| US5999915(A) | 1999-12-01 | Nahan 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 |
| US6032136(A) | 2000-02-01 | Brake et al. | 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 |
| US6055573(A) | 2000-04-01 | Gardenswartz 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 | Richard 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. | Applicant |
| 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 | Pallakoff | Applicant |
| US6289348(B1) | 2001-09-01 | Richard et al. | Applicant |
| US6323894(B1) | 2001-11-01 | Katz | Applicant |
| US6327574(B1) | 2001-12-01 | Kramer et al. | 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. | Applicant |
| US6601043(B1) | 2003-07-01 | Purcell | Applicant |
| US6604089(B1) | 2003-08-01 | Van Horn et al. | Applicant |
| US6606603(B1) | 2003-08-01 | Joseph 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 |
| US6705520(B1) | 2004-03-01 | Pitroda et al. | Applicant |
| US6716101(B1) | 2004-04-01 | Meadows et al. | Applicant |
| US6754636(B1) | 2004-06-01 | Walker et al. | Applicant |
| US6769607(B1) | 2004-08-01 | Pitroda 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 | Applicant |
| US6876983(B1) | 2005-04-01 | Goddard | Applicant |
| US6877655(B1) | 2005-04-01 | Robertson et al. | Applicant |
| US6877665(B2) | 2005-04-01 | Gobburu et al. | Applicant |
| US6915275(B2) | 2005-07-01 | Banerjee et al. | Applicant |
| US6925446(B2) | 2005-08-01 | Watanabe | Applicant |
| US6928416(B1) | 2005-08-01 | Bertash | 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 |
| US7013286(B1) | 2006-03-01 | Aggarwal 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 |
| US7082408(B1) | 2006-07-01 | Baumann et al. | Examiner |
| 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 |
| US7240021(B1) | 2007-07-01 | Walker et al. | Applicant |
| US7243082(B1) | 2007-07-01 | Forlai | Applicant |
| US7254833(B1) | 2007-08-01 | Cornelius et al. | Applicant |
| US7263498(B1) | 2007-08-01 | Van Horn et al. | Applicant |
| US7263505(B1) | 2007-08-01 | Forlai | Applicant |
| 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 |
| US7376613(B1) | 2008-05-01 | Cofino et al. | Examiner |
| US7379899(B1) | 2008-05-01 | Junger | Applicant |
| US7415428(B2) | 2008-08-01 | Garwood | Applicant |
| US7415617(B2) | 2008-08-01 | Ginter et al. | Applicant |
| US7433832(B1) | 2008-10-01 | Bezos et al. | Applicant |
| US7464051(B1) | 2008-12-01 | Heggem | Applicant |
| US7475024(B1) | 2009-01-01 | Phan | Applicant |
| US7480627(B1) | 2009-01-01 | Van Horn et al. | Applicant |
| US7496543(B1) | 2009-02-01 | Bamford et al. | Applicant |
| US7523045(B1) | 2009-04-01 | Walker et al. | Applicant |
| US7539742(B2) | 2009-05-01 | Spector | Applicant |
| US7542927(B2) | 2009-06-01 | Mukai | Applicant |
| US7552069(B2) | 2009-06-01 | Kepecs | Applicant |
| US7577582(B1) | 2009-08-01 | Ojha et al. | Examiner |
| US7584146(B1) | 2009-09-01 | Duhon | Applicant |
| US7593871(B1) | 2009-09-01 | Mesaros | Applicant |
| US7596509(B1) | 2009-09-01 | Bryson | Applicant |
| US7599857(B2) | 2009-10-01 | Bishop et al. | Applicant |
| US7606731(B2) | 2009-10-01 | McClung, III | Applicant |
| US7624044(B2) | 2009-11-01 | Wren | 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 | Applicant |
| US7698173(B1) | 2010-04-01 | Burge et al. | Applicant |
| US7698208(B2) | 2010-04-01 | Hirani et al. | Applicant |
| US7698240(B1) | 2010-04-01 | Chatterjee et al. | Applicant |
| US7706838(B2) | 2010-04-01 | Atsmon et al. | Applicant |
| US7725350(B2) | 2010-05-01 | Schlee | Applicant |
| US7729977(B2) | 2010-06-01 | Xiao et al. | Applicant |
| US7747473(B1) | 2010-06-01 | Mesaros | Applicant |
| US7792699(B2) | 2010-09-01 | Kwei | Applicant |
| US7801803(B2) | 2010-09-01 | Forlai | Applicant |
| US7813955(B2) | 2010-10-01 | Ariff et al. | Applicant |
| US7814106(B2) | 2010-10-01 | Guido et al. | Applicant |
| US7814114(B2) | 2010-10-01 | Mi 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 | Applicant |
| US7912761(B2) | 2011-03-01 | Vaid | Applicant |
| US7917386(B2) | 2011-03-01 | Christensen | Applicant |
| US7917416(B2) | 2011-03-01 | Quinn et al. | Applicant |
| US7937288(B2) | 2011-05-01 | Blaser et al. | Applicant |
| US7942316(B2) | 2011-05-01 | Bennett et al. | Applicant |
| US7958007(B2) | 2011-06-01 | Urbanski et al. | Applicant |
| US8005747(B2) | 2011-08-01 | Forlai | Applicant |
| US8015583(B2) | 2011-09-01 | Bates et al. | Applicant |
| US8024226(B2) | 2011-09-01 | Fusz et al. | 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. | Applicant |
| US8073762(B2) | 2011-12-01 | Sheth et al. | Applicant |
| US8140402(B1) | 2012-03-01 | Mesaros | Applicant |
| US8140405(B2) | 2012-03-01 | Mesaros | Applicant |
| US8140442(B2) | 2012-03-01 | Heyer | Applicant |
| US8140615(B2) | 2012-03-01 | Miller et al. | Applicant |
| US8160931(B2) | 2012-04-01 | Mesaros | Applicant |
| US8196811(B2) | 2012-06-01 | Mesaros | Applicant |
| US8219460(B1) | 2012-07-01 | Mesaros | Applicant |
| US8249942(B2) | 2012-08-01 | Mesaros | Applicant |
| US8271332(B2) | 2012-09-01 | Mesaros | Applicant |
| US8285598(B2) | 2012-10-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 et al. | 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/0007324(A1) | 2002-01-01 | Centner et al. | Examiner |
| 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. | Examiner |
| US2002/0069079(A1) | 2002-06-01 | Vega | Applicant |
| US2002/0080950(A1) | 2002-06-01 | Koko et al. | Applicant |
| US2002/0082881(A1) | 2002-06-01 | Price 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/0004823(A1) | 2003-01-01 | Sagy | Examiner |
| 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/0088494(A1) | 2003-05-01 | Lee | Examiner |
| 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/0115100(A1) | 2003-06-01 | Teicher | 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/0200150(A1) | 2003-10-01 | Westcott et al. | Examiner |
| 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/0093276(A1) | 2004-05-01 | Nishio | Applicant |
| US2004/0128197(A1) | 2004-07-01 | Bam et al. | Applicant |
| US2004/0215467(A1) | 2004-10-01 | Coffman et al. | Examiner |
| 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/0036491(A1) | 2006-02-01 | Leung et al. | Applicant |
| US2006/0059062(A1) | 2006-03-01 | Wood et al. | Applicant |
| US2006/0069619(A1) | 2006-03-01 | Walker et al. | Applicant |
| US2006/0095327(A1) | 2006-05-01 | Vaughn et al. | Applicant |
| US2006/0095366(A1) | 2006-05-01 | Sheth et al. | Applicant |
| US2006/0106678(A1) | 2006-05-01 | Walker et al. | 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/0082418(A1) | 2008-04-01 | Fordyce et al. | Applicant |
| US2008/0126201(A1) | 2008-05-01 | Ullah | Applicant |
| US2008/0255886(A1) | 2008-10-01 | Unkefer et al. | 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/0089177(A1) | 2009-04-01 | Dayton et al. | Applicant |
| US2009/0187455(A1) | 2009-07-01 | Fernandes et al. | Applicant |
| US2009/0198622(A1) | 2009-08-01 | Temte et al. | Applicant |
| US2009/0276305(A1) | 2009-11-01 | Clopp | Applicant |
| US2009/0307073(A1) | 2009-12-01 | Mirroknibanadaki et al. | Applicant |
| US2009/0327034(A1) | 2009-12-01 | Petersen | Applicant |
| US2009/0327038(A1) | 2009-12-01 | Petersen | 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/0022970(A1) | 2012-01-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 |
| US2012/0158475(A1) | 2012-06-01 | Mesaros | Applicant |
| US2012/0179526(A1) | 2012-07-01 | Mesaros | Applicant |
| US2012/0179530(A1) | 2012-07-01 | Mesaros | Applicant |
| US2012/0197705(A1) | 2012-08-01 | Mesaros | Applicant |
| US2012/0197722(A1) | 2012-08-01 | Mesaros | Applicant |
| US2012/0203603(A1) | 2012-08-01 | Mesaros | Applicant |
| US2012/0203611(A1) | 2012-08-01 | Mesaros | Applicant |
| US2012/0203615(A1) | 2012-08-01 | Mesaros | Applicant |
| US2012/0209683(A1) | 2012-08-01 | Mesaros | Applicant |
| US2012/0209737(A1) | 2012-08-01 | Mesaros | Applicant |
| US2012/0209738(A1) | 2012-08-01 | Mesaros | Applicant |
| US2012/0209739(A1) | 2012-08-01 | Mesaros | Applicant |
| US2012/0209740(A1) | 2012-08-01 | Mesaros | Applicant |
| US2012/0209743(A1) | 2012-08-01 | Mesaros | Applicant |
| US2012/0226541(A1) | 2012-09-01 | Mesaros | Applicant |
| US2012/0245993(A1) | 2012-09-01 | Mesaros | Applicant |
| US2012/0253912(A1) | 2012-10-01 | Mesaros | Applicant |
| US2012/0253977(A1) | 2012-10-01 | Mesaros | Applicant |
| US2012/0265590(A1) | 2012-10-01 | Mesaros | Applicant |
| US2012/0265600(A1) | 2012-10-01 | Mesaros | Applicant |
| US2012/0278157(A1) | 2012-11-01 | Mesaros | Applicant |
| US2012/0290395(A1) | 2012-11-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 (143)
- U.S. Appl. No. 13/269,360 Final Office Action mailed Jul. 6, 2012.Applicant
- U.S. Appl. No. 12/710,095 Final Office Action mailed Jun. 28, 2012.Applicant
- U.S. Appl. No. 12/881,923 Office Action mailed Jun. 29, 2012.Applicant
- U.S. Appl. No. 13/345,681 Office Action mailed Jun. 20, 2012.Applicant
- “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
- 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
- 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/home/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., “Open Market Introduces New Software for Dynamic Web-Based Commerce” PR Newswire, Oct. 1, 1996.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.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-.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
- Docket No. EWIN-010COB, U.S. Appl. No. 13/271,464 Office Action mailed May 10, 2012.Applicant
- U.S. Appl. No. 09/922,884 Office Action mailed May 1, 2012.Applicant
- U.S. Appl. No. 09/922,884 Final Office Action mailed Jan. 4, 2012.Applicant
- U.S. Appl. No. 13/104,723 Final Office Action mailed Jun. 8, 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 Final Office Action mailed Jun. 12, 2012.Applicant
- U.S. Appl. No. 13/270,133 Office Action mailed Jan. 3, 2012.Applicant
- U.S. Appl. No. 13/292,971 Office Action mailed Jun. 14, 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/272,144 Office Action mailed May 16, 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. 11/618,412 Final Office Action mailed May 1, 2012.Applicant
- U.S. Appl. No. 13/105,387 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. 11/680,415 Final Office Action mailed May 2, 2012.Applicant
- eWinWin, Inc. v. Groupon, Inc. Appeal Per Curiam Decision dated Oct. 9, 2012.Applicant
- eWinWin, Inc. v. Groupon, Inc. Reply Brief of Appellant dated Jun. 4, 2012.Applicant
- eWinWin, Inc. v. Groupon, Inc. Brief of Appellee dated May 17, 2012.Applicant
- eWinWin, Inc. v. Groupon, Inc. Brief of Appellant dated Apr. 2, 2012.Applicant
- Order re Motion for Summary Judgment dated Nov. 23, 2011.Applicant
- eWinWin, Inc.'s Opposition to Groupon, Inc.'s Motion for Summary Judgment of Non-Infringement dated Nov. 8, 2011.Applicant
- Groupon, Inc.'s Motion for Summary Judgment of Non-Infringment dated Oct. 17, 2011.Applicant
- Order re eWinWin, Inc. Motion for Reconsideration dated Oct. 3, 2011.Applicant
- Order re Claim Construction dated Sep. 5, 2011.Applicant
- eWinWin, Inc. Supplemental Brief in Support of Claim Construction dated Aug. 24, 2011.Applicant
- Groupon, Inc.'s Supplemental Claim Construction Brief dated Aug. 24, 2011.Applicant
- eWinWin, Inc.'s Reply Brief in Support of Claim Construction dated Aug. 5, 2011.Applicant
- Groupon, Inc.'s Responsive Claim Construction Brief dated Aug. 5, 2011.Applicant
- Groupon, Inc.'s Opening Claim Constructin Brief dated Jul. 5, 2011.Applicant
- Opening Claim Construction Brief of eWinWin, Inc.dated Jul. 5, 2011.Applicant
- U.S. Appl. No. 13/275,054 Final Office Action mailed Nov. 5, 2012.Applicant
- U.S. Appl. No. 13/292,971 Office Action mailed Dec. 4, 2012.Applicant
- U.S. Appl. No. 13/292,971 Office Action mailed Sep. 14, 2012.Applicant
- U.S. Appl. No. 13/449,275 Office Action mailed Oct. 4, 2012.Applicant
- U.S. Appl. No. 13/449,276 Office Action mailed Sep. 26, 2012.Applicant
- U.S. Appl. No. 13/449,658 Office Action mailed Oct. 30, 2012.Applicant
- U.S. Appl. No. 13/452,647 Office Action mailed Dec. 7, 2012.Applicant
- U.S. Appl. No. 13/460,512 Office Action mailed Dec. 10, 2012.Applicant
- U.S. Appl. No. 13/523,820 Office Action mailed Nov. 8, 2012.Applicant
- U.S. Appl. No. 13/525,040 Office Action mailed Nov. 23, 2012.Applicant
- U.S. Appl. No. 13/407,622 Office Action mailed Dec. 3, 2012.Applicant
- U.S. Appl. No. 13/407,622 Office Action mailed Sep. 12, 2012.Applicant
- U.S. Appl. No. 12/881,923 Final Office Action mailed Oct. 5, 2012.Applicant
- U.S. Appl. No. 13/251,668 Office Action mailed Sep. 14, 2012.Applicant
- U.S. Appl. No. 13/345,681 Final Office Action mailed Sep. 20, 2012.Applicant
- U.S. Appl. No. 13/621,158 Office Action mailed Dec. 5, 2012.Applicant
- U.S. Appl. No. 13/274,213 Final Office Action mailed Aug. 1, 2012.Applicant
- U.S. Appl. No. 13/538,302 Office Action mailed Oct. 25, 2012.Applicant
- U.S. Appl. No. 13/105,387 Final Office Action mailed Aug. 15, 2012.Applicant
- U.S. Appl. No. 11/618,418 Final Office Action mailed Jul. 26, 2012.Applicant
- U.S. Appl. No. 11/680,415 Office Action mailed Aug. 31, 2012.Applicant
- U.S. Appl. No. 13/517,528 Office Action mailed Dec. 6, 2012.Applicant