US 8,301,495 B2Grant
System and methods for discount retailing
Issue Date:2012-10-30
•30 Claims
•4 Drawing Sheets
Abstract
A system and methods to mutually satisfy a consumer with a discount and a vendor with a minimum number of sales by establishing a tipping point associated with an offer for a good or service. If the tipping point is met, the sale of the good or service is executed and the consumer is charged and receives an indication of the discounted sale, such as a certificate. If the tipping point is not met, the discount offer is abandoned and the consumer is not charged. Once the tipping point is established, the vendor receives a payment, even before the consumer uses the certificate.
Metadata
Assignee
- Groupon, Inc.
Inventor
- Andrew Mason
Application Information
Application Number:US 12/592,947
Filing Date:2009-12-04
Priority Date:2009-05-05
Art Unit:3688
Classifications
IPC:
G06Q30/00
Patent Drawings (4 sheets)
Description
[0001] This application claims the benefit of U.S. Provisional Application No. 61/215,453 filed May 5, 2009.
Field of the Invention
[0002] This invention relates generally to the offer and sale of goods and services, and more specifically to a system and methods for offering goods and services of others at a discount on a network such as the Internet, wherein the sale of the goods and services is contingent upon a certain number of actual sales, i.e., a tipping point, where the merchant ultimately providing the goods or services does not pay the out-of-pocket expenses for advertising and marketing the goods or services, and receives the revenue generated from the sales of the discounted goods or services before actually providing those goods or services.
Background of the Invention
[0003] Retailing is the exchange—sale and purchase—of goods and services between a vendor or merchant and a consumer or customer. Typically, negotiation is absent between the vendor and consumer with respect to the terms of a sale or purchase of a good or service. Retailing characteristically employs a vendor-controlled format whereby the vendor determines which goods or services to offer for sale, when the goods or services will be offered for sale, and the non-negotiable fixed price at which the good or service will be sold.
[0004] Discounts are an integral part of retail strategies for many goods and services. Vendors rely upon discounts for a variety of reasons, such as to promote new and existing goods and services and to increase the sales of that particular item or service, or to increase the sales of the merchant's other goods and services. Further, consumers rely upon discounts as a way to reduce their costs.
[0005] Discount techniques include providing coupons and rebates to potential customers, but these techniques have several disadvantages, such as an historically small percentage of consumer participation and fraud. Since the participation level is so small, merchants are forced to canvass an area to attract the correct demographic of potential customers for its products or services. Most of the coupons or rebates (or the advertisements containing the coupons or rebates) end up with consumers that do not need or want the goods or services.
[0006] Further, fraud is an increasing problem in that coupons may be copied, or rebates may be used to obtain cash back for goods and services that the fraudulent consumer never actually purchased.
[0007] Coupons and rebates are typically distributed using direct mail, newspaper print, and magazines and have associated with them a low percentage of users of those actually receiving the coupons. Besides not being environmentally friendly due to paper waste, coupons and rebates may not be cost effective.
[0008] Further, advertising and marketing associated with coupons and rebates can be expensive when done through radio or television medium, and extremely ineffective when done through print advertisements. Regardless of the advertising medium however, there is very little reason for the consumer to pass along the advertisement or coupon to others, so that a merchant must advertise or market the discount to each individual.
[0009] A vendor offers coupons or rebates in the hopes of securing future sales at full retail prices, repeat sales and ultimately an increase in overall sales. Ultimately, vendors cannot offer goods and services at a discount unless the vendor can ensure a minimum number of sales to justify the discount.
[0010] Discounting techniques also include pricing curve group discount models, but traditional pricing curve group discount models confuse consumers and leave them feeling like they did not get the best possible deal.
[0011] There is currently no system and methods to mutually satisfy the consumer with a discount and the vendor with a minimum number of sales, while at the same time providing the merchant with expense-free advertising and marketing for the goods or services. There is also no system or methods that utilize the strength of a social network to distribute information about the discounts, and create an incentive for the customer to distribute the information about the discount.
[0012] There is also no current system that pays the merchant for the sale of the discounted items sold up front, prior to the merchant having to provide the goods or services to the customer that has paid for those goods or services. The present invention satisfies these needs.
Summary of the Invention
[0013] The present invention is a system and methods to mutually satisfy the consumer with a discount for the purchase of goods or services on the one hand, and the vendor with a minimum number of sales at that discounted price. The minimum number of sales of the goods or services is also known as the tipping point.
[0014] The present invention also provides a merchant with inexpensive or free advertising and marketing of the particular goods or services being offered for sale, utilizing the strength of a social network, along with a guarantee that the sale price will only have to be honored if a minimum number of customers not only accept the offer, but also pay the discounted price in advance, for the goods or services. Accordingly, a merchant can provide a greater or deeper discount knowing that at least a certain number of sales will occur at that discount.
[0015] Since, in accordance with the present invention, the sales are made at the time that the consumer decides to accept the offer, even before taking possession of the goods or receiving the services, and only if the minimum number of sales are attained, the money from the sales can be immediately (or soon thereafter) provided to the merchant, thereby providing the merchant with the revenue from the sale of the goods or services in advance of the merchant providing the goods or services to the customer.
[0016] The sale price may remain available for a limited time, for example, twelve hours or one day, or until the number of sales equals or exceeds the minimum or tipping point by a given amount. For example, the tipping point may be reached when 100 individuals accept an offer to purchase a discounted sandwich, and the offer ends when 200 individuals accept the offer to purchase the discounted sandwich.
[0017] Further, the discount available may be modified as the number of actual customers increase. For example, the first 25 customers to purchase an item may receive a 50% discount, while the next 25 customers for that same item receive a 40% discount, and so on. By creating these limitations on the discounts as the number of deals are accepted (and purchased), there is incentive for consumers to watch the deals carefully to be able to react quickly.
[0018] According to the present invention, a merchant or vendor is selected for participation in discount retailing. The merchant may request to have its goods or services offered, or the company providing the services can solicit merchants to become part of the system. The vendor may be any individual or company that provides goods or services to a consumer, and may be local, national or global. The merchant's goods or services are identified for a discount offering and a minimum number of accepted deals, or the tipping point, is determined. The tipping point is defined as the minimum quantity of the particular goods or services to be accepted by the consumers, or the critical mass, in order to execute the sale of the goods or services. Typically, the vendor sets the tipping point.
[0019] Next, terms of the offer are determined and may include a discount or varying discounts to be provided, duration of the offer, maximum number, if any, of the goods or services the vendor is willing to offer for sale, expiration of the goods or services, or any other restrictions or limitation associated with the offer.
[0020] The discount offer is then exploited, either through a global communication network, such as the Internet, or through some other vehicle that will be accessible to consumers, such as an Intranet, email or another communication network. If the Internet is used, a website can be generated and updated with the offer such that consumers can accept the offer. Consumers can “sign up” for offers on the website and even to receive updates as they occur. “Signing up” may entail providing one or more of the following types of information: the name of the consumer, address of the consumer, email address, and a form of payment to purchase the discount offer, such as a credit card or debit card. Although signing up is not necessary to participate in the offers (one can accept an offer and provide payment information each time), by signing up, the consumer can more easily and more quickly take advantage of any offer.
[0021] Consumer participation is received in the way of accepted offers, and calculated in terms of the number of consumers that accepted the discount offer. If the number of consumers that participated by accepting the discount offer equals or exceeds the tipping point, then the offer of the sale of the good or service becomes valid or legitimate, and each customer that has accepted the offer is charged using their method of payment, i.e., credit card, debit card, Paypal®, or in other ways utilizing a method of payment. The customer is then provided with a receipt of purchase, such as an email, coupon, gift certificate, etc. that can be printed out for redemption (or used as a receipt on a cell phone, etc.)
[0022] At this time (or shortly thereafter), the merchant receives a payment based on the previous agreement for a portion of the sale of the discounted goods or services, after taking out the cost charged by the owner of the system or platform.
[0023] The consumer can then take the printed receipt of purchase (or other indication of purchase) to the merchant, who will provide the goods or services purchased at the reduced price. Alternatively, the list of customers that accepted the (now valid) offer and purchased the discounted goods or services can be forwarded to the merchant for providing the goods or services. These two methods for validate the purchase can also be used in combination.
[0024] Conversely, if the number of customers that participated by accepting the discount offer does not reach the tipping point in the allotted time, then the offer is rescinded or rejected, the consumer is not charged for the purchase, and the merchant does not receive a payment (or have to provide the goods or services).
[0025] Customers can also sign up to receive an email when the deal is announced, and can access the system through one of the many social networking website systems, such as Facebook or Twitter. Further, customers can set up an account for purchasing the deals and receive credits or money toward future deals by referring other customers to sign up and purchase a deal.
[0026] An object of the present invention is to provide consumers with a discount on goods and services, while providing the merchant inexpensive or free advertising and marketing for those goods or services.
[0027] Another object of the present invention is to provide a guaranteed minimum number of sales of a particular item or service, otherwise no sale at that discounted price occurs—the sale only occurs if a minimum number of customers accept the deal.
[0028] Another object of the present invention is for the vendor to gain exposure to a new audience and create an incentive for the customer to market the deal to other customers, and to provide a vehicle, such as a website on the Internet, in which large numbers of consumers return to that particular vehicle to find out about new deals.
[0029] Another object of the present invention is to provide the merchant with revenue from the sales (if the minimum is attained and the offer becomes valid) prior to delivering the goods or providing the services to the customer.
[0030] Another object of the present invention is to provide a system and methods for increasing sales, and advertising and marketing the merchant's goods or services.
[0031] These and other aspects, features, and advantages of the present invention will become more readily apparent from the attached drawings and the detailed description of the preferred embodiments, which follow.
Brief Description of the Drawings
[0032] The preferred embodiments of the invention will be described in conjunction with the appended drawings provided to illustrate and not to the limit the invention, where like designations denote like elements, and in which:
[0033] FIG. 1 illustrates a flow chart in accordance with one embodiment of the present invention; and
[0034] FIG. 2 illustrates an exemplary computer system according to the present invention; and
[0035] FIG. 3 illustrates a flow chart in accordance with an alternative embodiment of the present invention.
Detailed Description of the Preferred Embodiment
[0036] FIG. 1 illustrates a flow chart 100 in accordance with one embodiment of the present invention. As shown in FIG. 1 , a vendor is selected at step 110 for participation in the present invention. The vendor may be any individual or entity that provides goods or services to a consumer. The vendor may be local, national or global in terms of the geography the vendor provides products or services, and the vendor may be solicited for the system or may hear of the system and may approach the system's provider without being solicited. Additionally, a product or service provided by the vendor is identified for a discount offering at step 120. The good may be any product sold or distributed by the vendor, and the service likewise, can be any service provided by the vendor.
[0037] A tipping point is then determined at step 130. Again, the tipping point is defined as the minimum quantity of the good or service to be accepted by consumers in order to validate the deal and execute the sale of the good or service. Typically, the vendor sets the tipping point, for example, 300 or more hamburgers must be sold in order for the discount to be valid.
[0038] At step 140, terms of the discount offer are determined and may include some or all of the following (along with other terms as needed): discount to be provided, duration of the offer, for example 24 hours, and maximum number, if any, of the good or service the vendor is willing to offer, expiration of the good or service, or restrictions associated with the good or service.
[0039] At step 150 the discount offer is exploited, for example, through a website on the Internet. The offer on the website may include the discount rate and percentage of discount, and pictures of the goods and/or descriptions of the goods or services offered at the discounted rate. Further, the website may also include information about the deal and how close, or it, the tipping point has been attained. For example, if 100 discounted manicures must be accepted before the offer is valid, the website might show that 54 have been accepted, thereby creating an incentive for those that have accepted to contact others to take advantage of the offer.
[0040] Consumers participate by accepting the offer such as by “signing up” for the offer on the website. “Signing up” may entail providing the name of the consumer, address of the consumer, and form of payment to purchase the offer. Further, consumers can sign up in advance to make accepting offers easier and faster and to receive offers quicker.
[0041] At step 160, the consumer participation is received and calculated in terms of the number of consumers that participated by accepting the discount offer at step 170. As shown by step 180 in FIG. 1 , if the number of consumers that participated by accepting the discount offer equals the tipping point established at step 130, the sale of the good or service is executed at step 185. If the number of consumers that participated by accepting the discount offer does not equal the tipping point established at step 130, the offer is abandoned. The sale of the good or service is executed by providing the customer with a gift certificate.
[0042] The following is discussed with reference to a restaurant discount of 50%, but is merely exemplary, as the present invention is applicable to a variety of goods, services and various discounts.
[0043] Vendor XYZ Restaurant is selected to participate in discount retailing according to the present invention. XYZ Restaurant serves Chicago, Ill. and the Chicagoland area. The tipping point is established at 25, which is the critical mass or minimum quantity that must be accepted by consumers in order to validate the sale of the offer. So, if only 24 people accept the discount offer (in the allotted time) then the offer is rescinded and no customer receives the discount.
[0044] Next, terms of the discount offer are determined. The discount to be provided by XYZ Restaurant is $20 in food for the cost of $10, provided the tipping point of 25 is met. Another term is that the offer will run for 8 hours, although any duration can be contemplated. Another term may be that XYZ Restaurant will only provide a maximum of 100 discount offers, although any variation is contemplated, for example, terms of the discount offer could vary with respect to the number of consumers that accept the offer in excess of the tipping point. For example, the first 25 consumers that accept the discount offer receive the 50% discount. The subsequent consumers (number 26 through 50) to accept the offer receive a 40% discount, or $20 in food for the cost of $12. The next subsequent consumers (number 51 through 100) to accept the offer receive a 20% discount, or $20 in food for the cost of $16.
[0045] Another term may be that, provided the tipping point is met, the consumer must use the discount offer within two months otherwise it expires. Any expiration date is contemplated including no expiration. Yet another term may be that the discount is applicable to food only, not beverages, but again, any restriction is contemplated such as the discount only applies to alcoholic beverages.
[0046] Upon establishing the tipping point and determining the terms, the discount offer is exploited through a website on the Internet. Consumers accept the offer via the website and provide their name, address and credit card number (if they have not already registered). Upon or before the 8 hour duration ends, consumer participation is received by the system and the number of consumers that accepted the discount offer is calculated. In this example, 50 people accepted the offer, which meets and exceeds the tipping point of 25. Therefore, the discount offer is validated and the sale of the service to each of the 50 customers is executed. Each customer's credit card is charged $10 and the consumer receives a $20 gift certificate to XYZ Restaurant. Again, if the number of consumers that accepted the discount offer is calculated at any number less than 25, the discount offer is rescinded and the consumer's credit card is not charged.
[0047] FIG. 2 illustrates an exemplary computer system 200, or network architecture, that may be used to implement the methods according to the present invention. One or more computer systems 200 may carry out the methods presented herein as computer code. One or more processors, such as processor 220, which may be a special purpose or a general-purpose processor is connected to a bus 210. As shown in FIG. 2 , bus 210 connects the processor 220 to various other components of the computer system 200, but it is contemplated bus 210 may connect processor 220 to various components (not shown). It is also contemplated that bus 210 connects the processor 220 to other computer systems. Via the bus 210, the processor 220 can receive computer code. The term “computer code” includes, for example, programs, instructions, signals and/or data. The processor 220 executes computer code and may further send the computer code via the bus 210.
[0048] Computer system 200 may include one or more memories, such as first memory 230 and second memory 240. It is contemplated that the first memory 230, secondary memory 240, or a combination thereof function as a computer usable storage medium to store and/or access computer code. The first memory 230 and second memory 240 may be, for example, random access memory (RAM), read-only memory (ROM), a mass storage device, or any combination thereof.
[0049] As shown in FIG. 2 , one embodiment of second memory 240 is a mass storage device 243, although it is contemplated that first memory 230 may be the mass storage device. The mass storage device 243 comprises a storage drive 245 and a storage media 247. It is contemplated the storage media 247 may or may not be removable from the storage drive 245. Mass storage devices 243 with storage media 247 that are removable, otherwise referred to as removable storage media, allow computer code to be transferred to and/or from the computer system 200.
[0050] A mass storage device 243 may include, for example, a Compact Disc Read-Only Memory (“CDROM”), ZIP storage device, tape storage device, magnetic storage device, optical storage device, Micro-Electro-Mechanical Systems (“MEMS”), nanotechnological storage device, floppy storage device, hard disk device. Mass storage device 243 also includes program cartridges and cartridge interfaces (such as that found in video game devices), removable memory chips (such as an EPROM, or PROM) and associated sockets.
[0051] The computer system 200 may further or alternatively include other means for computer code to be loaded into or removed from the computer system 200, for example, input/output (“I/O”) interface 250 and/or communications interface 260. Both the I/O interface 250 and the communications interface 260 allow computer code to be transferred between the computer system 200 and external devices including other computer systems. This transfer may be bi-directional or omni-direction to or from the computer system 200.
[0052] Computer code transferred by the I/O interface 250 and the communications interface 260 are typically in the form of signals, which may be electronic, electromagnetic, optical, or other signals capable of being sent and/or received by the interfaces. These signals may be transmitted via a variety of modes including, but not limited to, wire or cable, fiber optics, a phone line, a cellular phone link, infrared (“IR”), and radio frequency (“RF”) link.
[0053] The I/O interface 250 may be any connection, wired or wireless, that allows the transfer of computer code. An I/O interface 250 includes, for example, an analog or digital audio connection, digital video interface (“DVI”), video graphics adapter (“VGA”), musical instrument digital interface (“MIDI”), parallel connection, PS/2 connection, serial connection, universal serial bus connection (“USB”), IEEE1394 connection, PCMCIA slot and card. In certain embodiments the I/O interface connects to an I/O unit 255 such as a user interface, monitor, speaker, printer, touch screen display, to name a few.
[0054] The communications interface 260 is also any connection that allows the transfer of computer code. Communication interfaces include, but are not limited to, a modem, network interface (such as an Ethernet card), wired or wireless systems (such as Wi-Fi, Bluetooth, IR), local area networks, wide area networks, intranets, etc.
[0055] The invention is also directed to computer products, otherwise referred to as computer program products, to provide software that includes computer code to the computer system 200. Processor 220 executes the computer code in order to implement the methods of the present invention. As an example, the methods according to the present invention may be implemented using software that includes the computer code, wherein the software is loaded into the computer system 200 using a memory 230, 240 such as the mass storage drive 243, or through an I/O interface 250, communications interface 260, or any other interface with the computer system 200. The computer code in conjunction with the computer system 200 described herein may perform any one of, or any combination of, the steps of any of the methods presented herein. It is also contemplated that the methods according to the present invention may be performed automatically, or may be invoked by some form of manual intervention.
[0056] The computer system 200, or network architecture, of FIG. 2 is provided only for purposes of illustration, such that the present invention is not limited to this specific embodiment. It is appreciated that a person skilled in the relevant art knows how to program and implement the invention using any computer system or network architecture.
[0057] A flow chart 300 representing an alternative embodiment of the present invention is illustrated in FIG. 3 . Similar to the flow chart in FIG. 1 , a vendor is selected or obtained at step 310 for participation in the present invention and a good or service is identified for the process in step 320.
[0058] In the alternative embodiment, no tipping point is established, however, in step 340, terms of the discount offer are determined and include the discount to be provided, duration of the offer, for example 24 hours, and an expiration date of the offer, or other restrictions associated with the offer.
[0059] At step 350 the discount offer is exploited through a website on the Internet or on some other global communication network. Consumers participate by accepting the offer such as by “signing up” for the offer on the website. “Signing up” may include providing the name of the consumer, address of the consumer, and form of payment to purchase the offer. The consumer may have already entered personal information that is stored thereby obviating the need to sign up each time to receive an offer. However, the system must be able to track the individual accepting the offer so that the consumer can be charged appropriately at the correct time, which may be when a deal reaches a tipping point (if a tipping point is used), or as soon as the consumer accepts the offer, if there is no tipping point.
[0060] At step 360, the consumer participation is received by the system and in step 370, the system calculates the number of consumers that have accepted the discount offer. This calculation can be done on a rolling basis, or at the end of the time limit, which was determined in step 340. Once the offer is accepted by the consumer and the consumer has been charged for the sale of the good or service, the consumer receives an indication that will allow him or her to receive the product or service. For example, the consumer may receive a gift certificate indicating the discount offer.
[0061] Once the number of consumers accepting the offer has been calculated and the consumers have been charged in step 385, a vendor payment can be made in step 390. The calculation and payment can occur at the end of the deal, based on a time limit, or the calculation can occur at a number of different time intervals, with numerous checks being sent to the vendor.
[0062] The described embodiments are to be considered in all respects only as illustrative and not restrictive, and the scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. Those of skill in the art will recognize changes, substitutions and other modifications that will nonetheless come within the scope of the invention and range of the claims.
Claims
What is claimed is:
1. A method of discount retailing in which an offer does not become valid until a minimum number of offers are purchased, comprising a network server, a microprocessor, a memory and computer software, said computer software being located in said memory and run by said microprocessor, said computer software comprising a discount retailing algorithm, wherein said discount retailing algorithm comprises the steps of:
(a) obtaining consent from a merchant to market and advertise an item normally provided by said merchant at a standard offer price;
(b) determining a discount offer price for said item, said discount offer price being a reduction in amount from the standard offer price of that item;
(c) deciding on a tipping point at which time the discount offer price becomes valid;
(d) generating an advertisement to present said discount offer price and said tipping point to potential consumers;
(e) displaying said advertisement over a network through said network server for a predetermined period of time for potential consumers to review;
(f) receiving acceptances of the discount offer price for the item over the network for the predetermined period of time;
(g) determining if the tipping point has been attained; and
(h) informing each consumer that accepted the discount offer whether or not the tipping point has been attained.
2. The method of discount retailing of claim 1, further comprising the step of sending a payment to said merchant if the tipping point has been attained.
3. The method of discount retailing of claim 1, wherein said item is a product distributed by said merchant.
4. The method of discount retailing of claim 1, wherein said item is a service provided by said merchant.
5. The method of discount retailing of claim 1, wherein said discount offer price is reduced from said standard offer price by an absolute amount.
6. The method of discount retailing of claim 1, wherein said discount offer price is reduced from said standard offer price by a percentage amount.
7. The method of discount retailing of claim 1, wherein said discount offer price varies depending on the number of consumers accepting the discount offer price.
8. The method of discount retailing of claim 7, wherein said discount offer price increases after a certain number of consumers accept the discount offer price.
9. The method of discount retailing of claim 1, wherein said tipping point comprises the number of items for which an offer must be accepted by a consumer in order for the discount offer price to become valid.
10. The method of discount retailing of claim 1, wherein said tipping point comprises a total amount of money to be paid by the consumers that accept the offer in order for the discount offer price to become valid.
11. The method of discount retailing of claim 1, wherein said merchant is not charged for said generating an advertisement.
12. The method of discount retailing of claim 1, wherein said advertisement includes the description of the item being offered at said discount offer price.
13. The method of discount retailing of claim 1, wherein said advertisement includes a picture of the item being offered at said discount offer price.
14. The method of discount retailing of claim 1, wherein said advertisement includes an indication of the amount saved based on the discount offer price.
15. The method of discount retailing of claim 1, wherein said advertisement includes an indication of the percentage saved based on the discount offer price.
16. The method of discount retailing of claim 1, wherein said predetermined period of time is one day.
17. The method of discount retailing of claim 1, wherein said predetermined period of time is less than one day.
18. The method of discount retailing of claim 1, wherein said predetermined period of time is greater than one day.
19. The method of discount retailing of claim 1, wherein said displaying said advertisement over a network through said network server comprises presenting the advertisement to said potential consumers through the display on the potential consumer's computer.
20. The method of discount retailing of claim 1, wherein said displaying said advertisement over a network through said network server comprises presenting the advertisement to said potential consumers through the display on the potential consumer's mobile device.
21. The method of discount retailing of claim 20, wherein said mobile device comprises a cellular telephone, personal digital assistant, or laptop computer.
22. The method of discount retailing of claim 1, wherein said receiving acceptances of the discount offer price for the item over the network comprises obtaining a response from a potential consumer that the consumer accepts the offer for the item.
23. The method of discount retailing of claim 22, wherein said obtaining a response from a potential consumer that the consumer accepts the offer for the item comprises obtaining a method of payment from said consumer for the item.
24. The method of discount retailing of claim 23, wherein said method of payment comprises credit or debit card information, checking or savings account information, or information about a Paypal® account.
25. The method of discount retailing of claim 1, wherein said determining if the tipping point has been attained comprises determining if the number of acceptances to the discount offer price exceeds the tipping point for that offer.
26. The method of discount retailing of claim 1, wherein said determining if the tipping point has been attained comprises determining if the amount of money generated from the accepted offers exceeds the tipping point for that offer.
27. The method of discount retailing of claim 1, wherein said informing each consumer that accepted the discount offer whether or not the tipping point has been attained comprises providing each consumer with a certificate to be redeemed at said merchant if said tipping point was attained.
28. The method of discount retailing of claim 1, wherein said informing each consumer that accepted the discount offer whether or not the tipping point has been attained comprises providing each consumer with a indication that the tipping point was not attained if said tipping point was not attained.
29. The method of discount retailing of claim 1, wherein only one offer is presented during the predetermined period of time.
30. The method of discount retailing of claim 1, wherein only one offer is presented during the predetermined period of time in a specified geographic location.
Patent Citations (175)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5715445(A) | 1998-02-01 | Wolfe | Applicant |
| US5870770(A) | 1999-02-01 | Wolfe | Applicant |
| US5946682(A) | 1999-08-01 | Wolfe | Applicant |
| US5970470(A) | 1999-10-01 | Walker et al. | Applicant |
| US6006252(A) | 1999-12-01 | Wolfe | Applicant |
| US6049778(A) | 2000-04-01 | Walker et al. | Applicant |
| US6101484(A) | 2000-08-01 | Halbert et al. | Applicant |
| US6128599(A) | 2000-10-01 | Walker et al. | Applicant |
| US6151603(A) | 2000-11-01 | Wolfe | Applicant |
| US6154172(A) | 2000-11-01 | Piccionelli et al. | Applicant |
| US6249772(B1) | 2001-06-01 | Walker et al. | Applicant |
| US6263351(B1) | 2001-07-01 | Wolfe | Applicant |
| US6269343(B1) | 2001-07-01 | Pallakoff | Applicant |
| US6292813(B1) | 2001-09-01 | Wolfe | Applicant |
| US6301576(B1) | 2001-10-01 | Wolfe | Applicant |
| US6327573(B1) | 2001-12-01 | Walker et al. | Applicant |
| US6336131(B1) | 2002-01-01 | Wolfe | Applicant |
| US6341305(B2) | 2002-01-01 | Wolfe | Applicant |
| US6415262(B1) | 2002-07-01 | Walker et al. | Applicant |
| US6463265(B1) | 2002-10-01 | Cohen et al. | Applicant |
| US6477581(B1) | 2002-11-01 | Carpenter et al. | Applicant |
| US6584451(B1) | 2003-06-01 | Shoham et al. | Applicant |
| US6604089(B1) | 2003-08-01 | Van Horn et al. | Applicant |
| US6604103(B1) | 2003-08-01 | Wolfe | Applicant |
| US6631356(B1) | 2003-10-01 | Van Horn et al. | Applicant |
| US6754636(B1) | 2004-06-01 | Walker et al. | Applicant |
| US6778837(B2) | 2004-08-01 | Bade et al. | Applicant |
| US6836476(B1) | 2004-12-01 | Dunn et al. | Applicant |
| US6876983(B1) | 2005-04-01 | Goddard | Applicant |
| US6918039(B1) | 2005-07-01 | Hind et al. | Applicant |
| US6928416(B1) | 2005-08-01 | Bertash | Applicant |
| US6931130(B1) | 2005-08-01 | Kraft, IV et al. | Applicant |
| US6934690(B1) | 2005-08-01 | Van Horn et al. | Applicant |
| US6937868(B2) | 2005-08-01 | Himmel et al. | Applicant |
| US6970837(B1) | 2005-11-01 | Walker et al. | Applicant |
| US6970922(B1) | 2005-11-01 | Spector | Applicant |
| US6985879(B2) | 2006-01-01 | Walker et al. | Applicant |
| US7000116(B2) | 2006-02-01 | Bates et al. | Applicant |
| US7007013(B2) | 2006-02-01 | Davis, II et al. | Applicant |
| US7039603(B2) | 2006-05-01 | Walker et al. | Applicant |
| US7043526(B1) | 2006-05-01 | Wolfe | Applicant |
| US7080029(B1) | 2006-07-01 | Fallside et al. | Applicant |
| US7103365(B2) | 2006-09-01 | Myllymaki | Applicant |
| US7103565(B1) | 2006-09-01 | Vaid | Applicant |
| US7103594(B1) | 2006-09-01 | Wolfe | Applicant |
| US7107228(B1) | 2006-09-01 | Walker et al. | Applicant |
| US7107230(B1) | 2006-09-01 | Halbert et al. | Applicant |
| US7113797(B2) | 2006-09-01 | Kelley et al. | Applicant |
| US7124099(B2) | 2006-10-01 | Mesaros | Applicant |
| US7124107(B1) | 2006-10-01 | Pishevar et al. | Applicant |
| US7124186(B2) | 2006-10-01 | Piccionelli | Applicant |
| US7146330(B1) | 2006-12-01 | Alon et al. | Applicant |
| US7181419(B1) | 2007-02-01 | Mesaros | Applicant |
| US7194427(B1) | 2007-03-01 | Van Horn et al. | Applicant |
| US7236944(B1) | 2007-06-01 | Schwartz et al. | Applicant |
| US7246310(B1) | 2007-07-01 | Wolfe | Applicant |
| US7251617(B1) | 2007-07-01 | Walker et al. | Applicant |
| US7257604(B1) | 2007-08-01 | Wolfe | Applicant |
| US7263498(B1) | 2007-08-01 | Van Horn et al. | Applicant |
| US7274941(B2) | 2007-09-01 | Cole et al. | Applicant |
| US7289815(B2) | 2007-10-01 | Gfeller et al. | Applicant |
| US7302638(B1) | 2007-11-01 | Wolfe | Applicant |
| US7318041(B2) | 2008-01-01 | Walker et al. | Applicant |
| US7340691(B2) | 2008-03-01 | Bassett et al. | Applicant |
| US7349879(B2) | 2008-03-01 | Alsberg et al. | Applicant |
| US7363246(B1) | 2008-04-01 | Van Horn et al. | Applicant |
| US7376580(B1) | 2008-05-01 | Walker et al. | Applicant |
| US7406322(B2) | 2008-07-01 | McMahan et al. | Applicant |
| US7409429(B2) | 2008-08-01 | Kaufman et al. | Applicant |
| US7428418(B2) | 2008-09-01 | Cole et al. | Applicant |
| US7430521(B2) | 2008-09-01 | Walker et al. | Applicant |
| US7433874(B1) | 2008-10-01 | Wolfe | Applicant |
| US7447642(B2) | 2008-11-01 | Bodin | Applicant |
| US7467137(B1) | 2008-12-01 | Wolfe | Applicant |
| US7469138(B2) | 2008-12-01 | Dayar et al. | Applicant |
| US7472109(B2) | 2008-12-01 | Katibah et al. | Applicant |
| US7480627(B1) | 2009-01-01 | Van Horn et al. | Applicant |
| US7529542(B1) | 2009-05-01 | Chevion et al. | Applicant |
| US7536385(B1) | 2009-05-01 | Wolfe | Applicant |
| US7539742(B2) | 2009-05-01 | Spector | Applicant |
| US7577581(B1) | 2009-08-01 | Schuyler | Applicant |
| US7589628(B1) | 2009-09-01 | Brady, Jr. | Applicant |
| US7613631(B2) | 2009-11-01 | Walker et al. | Applicant |
| US7627498(B1) | 2009-12-01 | Walker et al. | Applicant |
| US7643836(B2) | 2010-01-01 | McMahan et al. | Applicant |
| US7650307(B2) | 2010-01-01 | Stuart | Applicant |
| US7672897(B2) | 2010-03-01 | Chung et al. | Applicant |
| US7689468(B2) | 2010-03-01 | Walker et al. | Applicant |
| US7689469(B1) | 2010-03-01 | Mesaros | Applicant |
| US7693748(B1) | 2010-04-01 | Mesaros | Applicant |
| US7693752(B2) | 2010-04-01 | Jaramillo | Applicant |
| US7702560(B1) | 2010-04-01 | Wiesehuegel et al. | Applicant |
| US7711604(B1) | 2010-05-01 | Walker et al. | Applicant |
| US7720743(B1) | 2010-05-01 | Marks | Applicant |
| US7725480(B2) | 2010-05-01 | Bassett et al. | Applicant |
| US7734779(B1) | 2010-06-01 | Piccionelli | Applicant |
| US7760112(B2) | 2010-07-01 | Bauchot et al. | Applicant |
| US7774453(B2) | 2010-08-01 | Babu et al. | Applicant |
| US7783279(B2) | 2010-08-01 | Ramanathan et al. | Applicant |
| US7788281(B2) | 2010-08-01 | Cole et al. | Applicant |
| US7791487(B2) | 2010-09-01 | Meyer | Applicant |
| US7792297(B1) | 2010-09-01 | Piccionelli et al. | Applicant |
| US7797170(B2) | 2010-09-01 | Bodin | Applicant |
| US7848765(B2) | 2010-12-01 | Phillips et al. | Applicant |
| US7860753(B2) | 2010-12-01 | Walker et al. | Applicant |
| US7870229(B2) | 2011-01-01 | Spector | Applicant |
| US7890364(B2) | 2011-02-01 | Piccionelli | Applicant |
| US8010417(B2) | 2011-08-01 | Walker et al. | Applicant |
| US8150735(B2) | 2012-04-01 | Walker et al. | Applicant |
| US2002/0023010(A1) | 2002-02-01 | Rittmaster et al. | Applicant |
| US2002/0065713(A1) | 2002-05-01 | Awada et al. | Applicant |
| US2002/0103746(A1) | 2002-08-01 | Moffett, Jr. | Applicant |
| US2003/0004802(A1) | 2003-01-01 | Callegari | Applicant |
| US2003/0018559(A1) | 2003-01-01 | Chung et al. | Applicant |
| US2004/0117246(A1) | 2004-06-01 | Applebaum | Applicant |
| US2004/0148228(A1) | 2004-07-01 | Kwei | Applicant |
| US2004/0186789(A1) | 2004-09-01 | Nakashima | Applicant |
| US2004/0243478(A1) | 2004-12-01 | Walker et al. | Applicant |
| US2005/0075945(A1) | 2005-04-01 | Hodge et al. | Applicant |
| US2005/0102156(A1) | 2005-05-01 | Linduff | Applicant |
| US2005/0221841(A1) | 2005-10-01 | Piccionelli et al. | Applicant |
| US2005/0245241(A1) | 2005-11-01 | Durand et al. | Applicant |
| US2006/0069619(A1) | 2006-03-01 | Walker et al. | Applicant |
| US2006/0085259(A1) | 2006-04-01 | Nicholas et al. | Applicant |
| US2006/0089882(A1) | 2006-04-01 | Shimansky | Applicant |
| US2006/0106678(A1) | 2006-05-01 | Walker et al. | Applicant |
| US2006/0161599(A1) | 2006-07-01 | Rosen | Applicant |
| US2006/0178932(A1) | 2006-08-01 | Lang | Applicant |
| US2006/0195368(A1) | 2006-08-01 | Walker et al. | Applicant |
| US2006/0224465(A1) | 2006-10-01 | Walker et al. | Applicant |
| US2006/0224466(A1) | 2006-10-01 | Walker et al. | Applicant |
| US2006/0224467(A1) | 2006-10-01 | Walker et al. | Applicant |
| US2006/0235754(A1) | 2006-10-01 | Walker et al. | Applicant |
| US2006/0242028(A1) | 2006-10-01 | Walker et al. | Applicant |
| US2006/0242036(A1) | 2006-10-01 | Walker et al. | Applicant |
| US2006/0265289(A1) | 2006-11-01 | Bellissimo | Applicant |
| US2007/0061220(A1) | 2007-03-01 | Vaid | Applicant |
| US2007/0150354(A1) | 2007-06-01 | Walker et al. | Applicant |
| US2007/0156529(A1) | 2007-07-01 | Walker et al. | Applicant |
| US2007/0198360(A1) | 2007-08-01 | Rogers et al. | Applicant |
| US2007/0208625(A1) | 2007-09-01 | Walker et al. | Applicant |
| US2007/0225077(A1) | 2007-09-01 | Piccionelli | Applicant |
| US2007/0281692(A1) | 2007-12-01 | Bucher et al. | Applicant |
| US2007/0288330(A1) | 2007-12-01 | Vaid | Applicant |
| US2008/0004888(A1) | 2008-01-01 | Davis et al. | Applicant |
| US2008/0027810(A1) | 2008-01-01 | Lerner et al. | Applicant |
| US2008/0052186(A1) | 2008-02-01 | Walker et al. | Applicant |
| US2008/0052189(A1) | 2008-02-01 | Walker et al. | Applicant |
| US2008/0065565(A1) | 2008-03-01 | Walker et al. | Applicant |
| US2008/0071622(A1) | 2008-03-01 | Walker et al. | Applicant |
| US2008/0097857(A1) | 2008-04-01 | Walker et al. | Applicant |
| US2008/0133336(A1) | 2008-06-01 | Altman et al. | Applicant |
| US2008/0154714(A1) | 2008-06-01 | Liu et al. | Applicant |
| US2008/0167991(A1) | 2008-07-01 | Carlson et al. | Applicant |
| US2008/0201232(A1) | 2008-08-01 | Walker et al. | Applicant |
| US2008/0208663(A1) | 2008-08-01 | Walker et al. | Applicant |
| US2008/0242514(A1) | 2008-10-01 | Piccionelli et al. | Applicant |
| US2009/0024484(A1) | 2009-01-01 | Walker et al. | Applicant |
| US2009/0030776(A1) | 2009-01-01 | Walker et al. | Examiner |
| US2009/0125414(A1) | 2009-05-01 | Kleinrock et al. | Applicant |
| US2009/0307067(A1) | 2009-12-01 | Obermeyer | Applicant |
| US2009/0313109(A1) | 2009-12-01 | Bous et al. | Applicant |
| US2010/0049601(A1) | 2010-02-01 | Walker et al. | Applicant |
| US2010/0076832(A1) | 2010-03-01 | Cha | Applicant |
| US2010/0114132(A1) | 2010-05-01 | Piccionelli et al. | Applicant |
| US2010/0146604(A1) | 2010-06-01 | Piccionelli | Applicant |
| US2011/0054996(A1) | 2011-03-01 | Spector | Applicant |
| US2011/0099082(A1) | 2011-04-01 | Walker et al. | Applicant |
| US2012/0054031(A9) | 2012-01-01 | Walker et al. | Applicant |
| WO/79456(A2) | 2000-12-01 | Applicant | |
| WO/79495(A2) | 2000-12-01 | Applicant | |
| WO1/08024(A2) | 2001-02-01 | Applicant | |
| WO1/11483(A2) | 2001-02-01 | Applicant | |
| WO1/50301(A2) | 2001-07-01 | Applicant | |
| WO2009094385(A2) | 2009-07-01 | Applicant |
Non-Patent Literature (9)
- U.S. Appl. No. 06/047,266, filed Apr. 2000, Van Horn et al.Applicant
- Emily S. Rueb, “Group Buying, Better Together”; The New York Times City Room Blog, Feb. 16, 2010.Applicant
- Robert J. Kauffman and Bin Wang, “Bid Together, Buy Together: On the Efficacy of Group-Buying Business Models in Internet-Based Selling”; “The (R)evolution Goes Mobile”, 5th Annual University of Minnesota Electronic Commerce Conference, Mar. 27-28, 2001, Carlson School of Management, University of Minnesota, Minneapolis Minnesota.Applicant
- Krishnan S. Anand and Ravi Aron (OPIM Department, The Wharton School, University of Pennsylvania), “Group Buying on the Web: A Comparison of Price Discovery Mechanisms”, Management Science, vol. 49, No. 11, pp. 1546-1562, Nov. 2003.Applicant
- Editor, “Technology Drives ActBig ‘Next Generation’ GroupBuying Application”, Market Wire, Feb. 29, 2005.Applicant
- Staff, “ActBig.com muscles in on group buying power”, RedHerring.com, Oct. 13, 1999.Applicant
- Charles Bermant, “ActBig: Save Big”, Internetnews.com, Nov. 16, 1999.Applicant
- Alan S. Davis “Group Buying on the Internet”, Seminar Presentation Slides, University of Minnesota, MIS Research Center, Mar. 10, 2006.Applicant
- Office Action issued in corresponding U.S. Appl. No. 12/776,028 dated Mar. 20, 2012 (13 pgs).Applicant