Mobile application to conduct an auction based on physical presence

Information

  • Patent Grant
  • 10395307
  • Patent Number
    10,395,307
  • Date Filed
    Monday, August 28, 2017
    7 years ago
  • Date Issued
    Tuesday, August 27, 2019
    5 years ago
Abstract
A mobile application to conduct an auction based on physical presence is provided. The mobile application may be provided by a system comprising one or more modules. A notification module may identify an item to be sold at an auction. If a pre-auction window time period has arrived, the notification module may transmit auction notification messages to a plurality of client devices located within a predefined geographical area. A bidding module may conduct the auction by providing an auction interface to the client devices within the predefined geographical area. The auction interface includes an option to bid on the item. A completion module may transmit a confirmation to a winning auction participant.
Description
COPYRIGHT NOTICE

A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever. The following notice applies to the software and data as described below and in the drawings that form a part of this document: Copyright 2011 eBay, Inc., All Rights Reserved.


TECHNICAL FIELD

This patent document pertains generally to computer networking, and more particularly, but not by way of limitation, to a mobile application to conduct an auction based on physical presence.


BACKGROUND

For centuries, auctions have been conducted in the physical world, usually being led by a professional auctioneer who continuously announces a current highest bid for an item being sold at auction. Silent auctions may also be conducted where auction participants write down bids on pieces of paper that describe the item being sold. More recently, auctions can be conducted over the Internet where participants log into a website to bid on the item being sold.





BRIEF DESCRIPTION OF DRAWINGS

Some embodiments are illustrated by way of example and are not restricted to any limitation in the figures of the accompanying drawings.



FIG. 1 is a network diagram depicting a client-server system within which one example embodiment may be deployed.



FIG. 2 is a block diagram of an auction system, according to an example embodiment.



FIG. 3 is a flow chart illustrating a method to conduct an auction based on physical presence, according to an example embodiment.



FIG. 4 depicts a portion of a user interface including an example auction notification, according to an example embodiment.



FIG. 5 depicts a portion of a user interface including an example auction interface, according to an example embodiment.



FIG. 6 depicts a portion of a user interface including an example bid history interface, according to an example embodiment.



FIG. 7 depicts a portion of a user interface including an example confirmation, according to an example embodiment.



FIG. 8 is a block diagram of machine in the example form of a computer system within which a set instructions, for causing the machine to perform any one or more of the methodologies discussed herein, may be executed.





DETAILED DESCRIPTION

In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of some example embodiments. It will be evident, however, to one skilled in the art that the present invention may be practiced without these specific details.


To boost sales, merchants in bricks-and-mortar stores may desire to increase a level of excitement within the store among the customers. One way to do so is to offer an item for sale at a substantially reduced price. However, a merchant may not desire to discount a price any more than necessary. Embodiments described herein allow a merchant to initiate an auction of an item for sale among the customers who are already at the store. Further, embodiments allow a merchant to conduct an auction without shifting employee resources from other job responsibilities.


While the systems and methods described herein discuss using in-store communications with customers to conduct an auction, it is understood that the systems and methods may be used more generally to distribute information to customers within the store. For example, the systems and methods described herein may be used to announce a special discount or other incentive available only to the customers presently within a predefined geographical area that includes the store.



FIG. 1 is a network diagram depicting a client-server system 100, within which one example embodiment may be deployed. A networked system 102, in the example forms of a network-based marketplace or publication system for a store, provides server-side functionality, via a network 104 (e.g., the Internet or Wide Area Network (WAN)) to one or more clients. FIG. 1 illustrates, for example, a web client 106 (e.g., a browser), and a programmatic client 108 executing on respective client machines 110 and 112.


An Application Program Interface (API) server 114 and a web server 116 are coupled to, and provide programmatic and web interfaces respectively to, one or more application servers 118. The application servers 118 host one or more in-store systems 120 and auction system 122. The application servers 118 are, in turn, shown to be coupled to one or more databases servers 124 that facilitate access to one or more databases 126.


The in-store system 120 may provide a number of functions and services to users that access the networked system 102. These functions may include, for example, inventory systems, accounting systems, and the like. The auction systems 122 may provide a number of auction-related services and functions to users. The auction systems 122 may allow users to identify items being auctioned, register for auctions, and bid in auctions. While the in-store system 120 and the auction system 122 are shown in FIG. 1 to both form part of the networked system 102, it will be appreciated that, in alternative embodiments, the auction systems 122 may form part of an auction service that is separate and distinct from the networked system 102.


Further, while the system 100 shown in FIG. 1 employs a client-server architecture, the present invention is of course not limited to such an architecture, and could equally well find application in a distributed, or peer-to-peer, architecture system, for example. The various in-store systems 120 and auction systems 122 could also be implemented as standalone software programs, which do not necessarily have networking capabilities.


The web client 106 accesses the various in-store systems 120 and auction systems 122 via the web interface supported by the web server 116. Similarly, the programmatic client 108 accesses the various services and functions provided by the in-store systems 120 and auction systems 122 via the programmatic interface provided by the API server 114. The programmatic client 108 may, for example, be a merchant application to enable merchants to author and manage auctions on the networked system 102 in an off-line manner, and to perform batch-mode communications between the programmatic client 108 and the networked system 102.



FIG. 1 also illustrates a third party application 128, executing on a third party server machine 130, as having programmatic access to the networked system 102 via the programmatic interface provided by the API server 114. For example, the third party application 128 may, utilizing information retrieved from the networked system 102, support one or more features or functions on a website hosted by the third party. The third party website may, for example, provide one or more promotional, marketplace or payment functions that are supported by the relevant applications of the networked system 102.



FIG. 2 is a block diagram of an auction system 200, according to an example embodiment. The auction system 200 may be one of the auction systems 122 of FIG. 1. The auction system 200 may be implemented in hardware, software, or a combination thereof. In some instances, the auction system 200 may reside, in part, in the auction systems 122 and, in part, on a client machine (e.g., client machine 110 or client machine 112).


A notification module 202 is configured to identify an item to be auctioned and an auction time. In some instances, an auction may be pre-scheduled by a merchant or initiated based on a pre-defined trigger which is implemented by the notification module 202. In one embodiment the notification module is a memory storage device storing flash auction specific information that is used by other modules within the system to implement auction timing and configuration according to the information stored in the notification module 202. In some embodiments the notification module 202 is a control module which receives the inputs of the merchant and configures the system to implement and enable an in-store or flash auction. To illustrate, a merchant may schedule an auction for a particular item to begin at a certain time or may specify that an auction be triggered if a specified number of items remain in inventory or if an item is discontinued or otherwise no longer considered a top selling item. The notification module 202 is responsible for notifying near-by shoppers of the flash auction. In some instances, an auction may be spontaneously initiated by the merchant by providing instruction to the notification module 202 to send notifications to near-by shoppers. Some merchants may initiate an auction in response to receiving a request from a customer requesting that the merchant auction a particular item.


The auction is defined by the merchant. For example, the merchant may dictate the item(s) being auctioned, how a winner is determined, duration of the auction, a maximum or minimum number of auction participants, a qualification to participate in the auction, or the like. In auctions for a single item, the highest bid may determine the winner of the auction. Some merchants may require, for example, that a customer belong to a loyalty program or other membership to participate in the auction. In some instances, an auction may be made available to only customers who have a store credit card, or a particular spending level of the store credit card. In some embodiments, shoppers register for flash auction notifications, which they then receive when proximate the physical location of the auction initiator. The notification may include a visual description of the item for auction, which may be a drawing, a photo, a video or other descriptor.


In some instances, the merchant may use the system to initiate multiple auction processes or multiple instances of items for auction. For example, the merchant may designate a number of substantially identical items for sale to be auctioned in a single auction. The merchant may use the system to auction five television sets in a single auction, for example. In auctions where a quantity of substantially identical items is auctioned, a top number of bids may determine the winners of the auction. In other instances, a top bid may determine a first winner of the auction and the price of the item for the other bidders to optionally purchase the item.


The notification module 202, upon identifying an auction, further determines a pre-auction window. The pre-auction window is a period of time before the beginning of the auction during which customers are notified about the auction and allowed to register to participate in the auction. The pre-auction window may be, for example, ten minutes before the start of the auction. The pre-auction window may close before the start of the auction, simultaneously with the start of the auction, or after the auction has already begun.


During the pre-auction window, the notification module 202 transmits auction notification messages to client machines (e.g., a mobile device such as a smart phone) located within a pre-defined geographical area including, and in the vicinity of, the merchant's brick and mortar store. The predefined geographical area may include, for example, a parking lot, a shopping center where the merchant is located, a street or neighborhood where the store is located, or the like. The auction notification message may be an application notification, as supported by mobile operating systems such as the iOS and Android operating systems. In some instances, the auction notification message may be an SMS (short message service) message, an MMS (multimedia message service) message, or an email message. The auction notification message may include information about the auction or the item being auctioned and an option for the user to open an auction application on the client machine to register for the auction. The notification may include a map or step-by-step directions from the recipient's current location to the merchant. The notification module 202 may be dynamically adjusted for ease of use by the merchant in setting up the auction and to the shoppers to participate in the auction. In some embodiments, the shopper may choose to participate remotely rather than enter the store until completion of the auction.


To register to participate in an auction, a user of the client machine may select the notification or an option within the notification to navigate to an application installed on the client machine. To allow the user to participate, the application may automatically, without human intervention, register the user upon receiving the selection of the notification. In other embodiments, the user may register for the auction by responding to prompts requesting a user identifier, password, mobile phone number, or other information. The application may facilitate the user's participation in the auction by providing a bidding interface to the user.


The bidding module 204 is configured to conduct the auction by providing an auction interface to the client machines belonging to users participating in the auction. The client machines are located within a predefined geographical area that may include the store and the vicinity of the store. The location of the client machines may be determined based on input received from a global positioning system (GPS) or a triangulation of cell signals. In some instances, the client machines may be tracked using sensors located within the stores or using wireless tracking systems. In some embodiments, a user may check-in to the store using a Bluetooth-enabled client machine or using a check in station where a user can tell the store that the user is in the store (via near field communications (NFC) or a barcode scan). Where a shopping application is available for smart phones or other client machines, all or part of the auction system 200 may be coincident with the shopping application. In some embodiments, the auction system 200 accesses the shopping application for information, such as location of the merchant.


The auction interface provided at the client machines includes an option to bid on the item being auctioned. The auction interface may include a description of the item to be auctioned, an indication of a current high bid for the item, and one or more options to bid on the item. The bidding module 204 receives bids from the client machines and tracks the auction participants. The bidding module 204 may further determine when an auction ends. An auction may end after a predefined period of time, after a reserve price is met, or some other trigger that operates to end the auction.


Upon the ending of an auction, a completion module 206 is configured to transmit a confirmation to at least one winning auction participant. The winning auction participant may be an auction participant who has submitted a highest bid for the item during the auction. In some embodiments, an auction participant may be disqualified from winning the auction by, for example, leaving the predefined geographical area during the auction. In instances where the winning auction participant is disqualified, a second auction participant may be selected to be the winning auction participant.


In some instances, the completion module 206 may identify more than one winning auction participant if, for example, a quantity of items is being auctioned. The completion module 206 may identify the winning participants based on the participants who bid on the item. The participants may be offered the auctioned item for the bid amount submitted by the participant or for the highest bid amount submitted during the auction.


The confirmation sent by the completion module 206 may include instructions for claiming the item. For example, the confirmation message may include directions to a location (e.g., a customer service counter) within the store, a time limit in which the item can be purchased, a secret code that can be used by the store employees to confirm that the person claiming the item has actually won the auction, or the like.


In some instances, the completion module 206 may further send messages to participants who have not won the auction. The sent messages may include a discount or coupon that can be used within the store. In some embodiments, the message may include a coupon that applies a dollar amount to the recipient's next auction with the merchant.



FIG. 3 is a flow chart illustrating a method 300 to conduct an auction based on physical presence, according to an example embodiment. The method 300 may be performed by the auction system 200.


In an operation 302, an auction is defined by identifying an item (or quantity of items) to be auctioned and an auction time. The auction definition may include further information about the auction such as a minimum number of participants, a predefined geographical area in which to identify the participants, a reserve price to be met, and the like. In some embodiments, a recipient of an auction notification may forward the message to a member(s) of a social network to let the social network member(s) participate.


In an operation 304, a pre-auction window is determined. The pre-auction window is a period of time occurring before the auction during which shoppers may register to participate in the auction. In some embodiments the shopper may automatically register for an auction by placing a bid. In an operation 306, a determination is made as to whether the pre-auction window has arrived. If the pre-auction window has not arrived, the method 300 pauses until the pre-auction window arrives. The pre-auction window arrival may be triggered on elapsed time, a target number of users registering to participate in the auction, a time of day, and so forth.


In an operation 308, if the pre-auction window has arrived, auction notification messages are transmitted to client machines within the pre-defined geographical area. The notification may be a text message, an email, chat, tweet or other means of communication. The notification messages may include an option selectable by the user of the client machine to register for the auction. The user may register using a telephone number, a username, or some other identifier associated with the user.


In an operation 310, a determination is made as to whether the auction time has arrived. If the auction time has not arrived, auction notification messages may continue to be transmitted to client machines within the pre-defined geographical area.


If the auction time has arrived, the auction is conducted in an operation 312. The auction is conducted by accepting bids from client machines. In some instances, the client machines need not be registered prior to the auction and may be able to register during the auction by, for example, accessing an auction interface from a notification sent to the client machine and submitting a bid using the client machine.


In an operation 314, when the auction is complete, the winner of the auction is determined. The auction may be complete after a period of time has elapsed, for example. In some instances, more than one winner is identified. The winner may have submitted a highest bid during the auction.


In an operation 316, a confirmation is transmitted to the winner of the auction. The confirmation may include directions for claiming the item.



FIG. 4 depicts a portion of a user interface 400 including an example auction notification 402, according to an example embodiment. The auction notification 402 may be a message that is displayed on the screen or a portion of the screen to the user. The auction notification 402 may be temporally displayed or may only be hidden or closed by the user of the client machine. The auction notification 402 may be a text message or other message sent to the client machine. In some instances, the auction notification 402 is an application notification accessible via a mobile application residing on the client machine.


As depicted, the auction notification 402 includes an indication of the auction time and the item to be auctioned. The auction notification 402 further includes an option 404 that allows the user to register for the auction. In some instances, the user may be automatically registered upon selecting the option 404. In other instances, the user, upon selecting the option 404, may navigate to another user interface to register to participate. The user may be prompted to provide a user identifier or telephone number.


In some embodiments, shoppers may send a request to a given merchant requesting initiation of a flash auction. In this example, the merchant may respond to initiate an auction by sending a notification.



FIG. 5 depicts a portion of a user interface including an example auction interface 500, according to an example embodiment. The auction interface 500 includes a description 502 of the item being auctioned. As depicted, the description 502 includes a name of the item, an image of the item, and an indication of an in-store location of the item. Additional information may be accessible or presented to the user as part of the description 502.


An auction information portion 504 of the auction interface 500 may include information about the auction being conducted. The auction information portion 504 may include an indication of a reserve price, a minimum bid increment, a current high bid, and an amount of time remaining in the auction.


In some embodiments, an auction interface 500 may be presented to registered participants before the auction begins. Before the auction begins, the auction interface 500 may include the description 502 and the auction information portion 504. The auction information panel 504 may be modified to indicate the reserve price, the minimum bid increment, a current number of registered participants, and an amount of time remaining before the auction begins.


A bidding portion 506 of the auction interface 500 presented during the auction includes options selectable by the user to view the bidding action or to submit a bid. The bidding portion 506 may include a plurality of bidding options, such as an option to bid a minimum bid increment, a different bid increment, or a user-specified bid increment. In some instances, a user may provide a total bid amount rather than a bid increment.



FIG. 6 depicts a portion of a user interface including an example bid history interface 600, according to an example embodiment. The bid history interface 600 may be accessible from the auction interface 500 by selecting an option to view bidding. The bid history interface 600 includes the auction information panel 504 and the bidding portion 506. The bid history interface 600 additionally includes a list 602 of the bids previously submitted by the auction participants. The list 602 identifies the bidders and the bid submitted by each bidder.



FIG. 7 depicts a portion of a user interface including an example confirmation 700, according to an example embodiment. As depicted, the confirmation 700 is a notification. The confirmation 700 may be another message sent to the client machine. The confirmation 700 includes an indication that the user of the client machine has won the auction and provides instructions for completing the auction transaction. The confirmation 700 may include additional information, such as a final price of the item, a secret code to allow the employees of the store to confirm the identity of the winner or winners, or the like. In some instance, the confirmation 700 may include a barcode encoded with info identifying customer as auction winner where the barcode is capable of being scanned from the display of the client machine.


Modules, Components and Logic


Certain embodiments are described herein as including logic or a number of components, modules, or mechanisms. Modules may constitute either software modules (e.g., code embodied (1) on a non-transitory machine-readable medium or (2) in a transmission signal) or hardware-implemented modules. A hardware-implemented module is tangible unit capable of performing certain operations and may be configured or arranged in a certain manner. In example embodiments, one or more computer systems (e.g., a standalone, client or server computer system) or one or more processors may be configured by software (e.g., an application or application portion) as a hardware-implemented module that operates to perform certain operations as described herein.


In various embodiments, a hardware-implemented module may be implemented mechanically or electronically. For example, a hardware-implemented module may comprise dedicated circuitry or logic that is permanently configured (e.g., as a special-purpose processor, such as a field programmable gate array (FPGA) or an application-specific integrated circuit (ASIC)) to perform certain operations. A hardware-implemented module may also comprise programmable logic or circuitry (e.g., as encompassed within a general-purpose processor or other programmable processor) that is temporarily configured by software to perform certain operations. It will be appreciated that the decision to implement a hardware-implemented module mechanically, in dedicated and permanently configured circuitry, or in temporarily configured circuitry (e.g., configured by software) may be driven by cost and time considerations.


Accordingly, the term “hardware-implemented module” should be understood to encompass a tangible entity, be that an entity that is physically constructed, permanently configured (e.g., hardwired) or temporarily or transitorily configured (e.g., programmed) to operate in a certain manner and/or to perform certain operations described herein. Considering embodiments in which hardware-implemented modules are temporarily configured (e.g., programmed), each of the hardware-implemented modules need not be configured or instantiated at any one instance in time. For example, where the hardware-implemented modules comprise a general-purpose processor configured using software, the general-purpose processor may be configured as respective different hardware-implemented modules at different times. Software may accordingly configure a processor, for example, to constitute a particular hardware-implemented module at one instance of time and to constitute a different hardware-implemented module at a different instance of time.


Hardware-implemented modules can provide information to, and receive information from, other hardware-implemented modules. Accordingly, the described hardware-implemented modules may be regarded as being communicatively coupled. Where multiple of such hardware-implemented modules exist contemporaneously, communications may be achieved through signal transmission (e.g., over appropriate circuits and buses) that connect the hardware-implemented modules. In embodiments in which multiple hardware-implemented modules are configured or instantiated at different times, communications between such hardware-implemented modules may be achieved, for example, through the storage and retrieval of information in memory structures to which the multiple hardware-implemented modules have access. For example, one hardware-implemented module may perform an operation, and store the output of that operation in a memory device to which it is communicatively coupled. A further hardware-implemented module may then, at a later time, access the memory device to retrieve and process the stored output. Hardware-implemented modules may also initiate communications with input or output devices, and can operate on a resource (e.g., a collection of information).


The various operations of example methods described herein may be performed, at least partially, by one or more processors that are temporarily configured (e.g., by software) or permanently configured to perform the relevant operations. Whether temporarily or permanently configured, such processors may constitute processor-implemented modules that operate to perform one or more operations or functions. The modules referred to herein may, in some example embodiments, comprise processor-implemented modules.


Similarly, the methods described herein may be at least partially processor-implemented. For example, at least some of the operations of a method may be performed by one or processors or processor-implemented modules. The performance of certain of the operations may be distributed among the one or more processors, not only residing within a single machine, but deployed across a number of machines. In some example embodiments, the processor or processors may be located in a single location (e.g., within a home environment, an office environment or as a server farm), while in other embodiments the processors may be distributed across a number of locations.


The one or more processors may also operate to support performance of the relevant operations in a “cloud computing” environment or as a “software as a service” (SaaS). For example, at least some of the operations may be performed by a group of computers (as examples of machines including processors), these operations being accessible via a network (e.g., the Internet) and via one or more appropriate interfaces (e.g., Application Program Interfaces (APIs).)


Electronic Apparatus and System


Example embodiments may be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. Example embodiments may be implemented using a computer program product, e.g., a computer program tangibly embodied in an information carrier, e.g., in a machine-readable medium for execution by, or to control the operation of, data processing apparatus, e.g., a programmable processor, a computer, or multiple computers.


A computer program can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, subroutine, or other unit suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network.


In example embodiments, operations may be performed by one or more programmable processors executing a computer program to perform functions by operating on input data and generating output. Method operations can also be performed by, and apparatus of example embodiments may be implemented as, special purpose logic circuitry, e.g., a field programmable gate array (FPGA) or an application-specific integrated circuit (ASIC).


The computing system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. In embodiments deploying a programmable computing system, it will be appreciated that that both hardware and software architectures require consideration. Specifically, it will be appreciated that the choice of whether to implement certain functionality in permanently configured hardware (e.g., an ASIC), in temporarily configured hardware (e.g., a combination of software and a programmable processor), or a combination of permanently and temporarily configured hardware may be a design choice. Below are set out hardware (e.g., machine) and software architectures that may be deployed, in various example embodiments.


Example Machine Architecture and Machine-Readable Medium



FIG. 8 is a block diagram of machine in the example form of a computer system 800 within which instructions, for causing the machine to perform any one or more of the methodologies discussed herein, may be executed. In alternative embodiments, the machine operates as a standalone device or may be connected (e.g., networked) to other machines. In a networked deployment, the machine may operate in the capacity of a server or a client machine in server-client network environment, or as a peer machine in a peer-to-peer (or distributed) network environment. The machine may be a personal computer (PC), a tablet PC, a set-top box (STB), a Personal Digital Assistant (PDA), a cellular telephone, a web appliance, a network router, switch or bridge, or any machine capable of executing instructions (sequential or otherwise) that specify actions to be taken by that machine. Further, while only a single machine is illustrated, the term “machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein.


The example computer system 800 includes a processor 802 (e.g., a central processing unit (CPU), a graphics processing unit (GPU) or both), a main memory 804 and a static memory 806, which communicate with each other via a bus 808. The computer system 800 may further include a video display unit 810 (e.g., a liquid crystal display (LCD) or a cathode ray tube (CRT)). The computer system 800 also includes an alphanumeric input device 812 (e.g., a keyboard or touch-sensitive display screen), a user interface (UI) navigation device 814 (e.g., a mouse), a disk drive unit 816, a signal generation device 818 (e.g., a speaker) and a network interface device 820.


Machine-Readable Medium


The disk drive unit 816 includes a machine-readable medium 822 on which is stored one or more sets of instructions and data structures (e.g., software) 824 embodying or utilized by any one or more of the methodologies or functions described herein. The instructions 824 may also reside, completely or at least partially, within the main memory 804 and/or within the processor 802. during execution thereof by the computer system 800, the main memory 804 and the processor 802 also constituting machine-readable media.


While the machine-readable medium 822 is shown in an example embodiment to be a single medium, the term “machine-readable medium” may include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more instructions or data structures. The term “machine-readable medium” shall also be taken to include any tangible medium that is capable of storing, encoding or carrying instructions for execution by the machine and that cause the machine to perform any one or more of the methodologies of the present invention, or that is capable of storing, encoding or carrying data structures utilized by or associated with such instructions. The term “machine-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories, and optical and magnetic media. Specific examples of machine-readable media include non-volatile memory, including by way of example semiconductor memory devices, e.g., Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks.


Transmission Medium


The instructions 824 may further be transmitted or received over a communications network 826 using a transmission medium. The instructions 824 may be transmitted using the network interface device 820 and any one of a number of well-known transfer protocols (e.g., HTTP). Examples of communication networks include a local area network (“LAN”), a wide area network (“WAN”), the Internet, mobile telephone networks, Plain Old Telephone (POTS) networks, and wireless data networks (e.g., WiFi and WiMax networks). The term “transmission medium” shall be taken to include any intangible medium that is capable of storing, encoding or carrying instructions for execution by the machine, and includes digital or analog communications signals or other intangible media to facilitate communication of such software.


Although an embodiment has been described with reference to specific example embodiments, it will be evident that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the invention. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense. The accompanying drawings that form a part hereof, show by way of illustration, and not of limitation, specific embodiments in which the subject matter may be practiced. The embodiments illustrated are described in sufficient detail to enable those skilled in the art to practice the teachings disclosed herein. Other embodiments may be utilized and derived therefrom, such that structural and logical substitutions and changes may be made without departing from the scope of this disclosure. This Detailed Description, therefore, is not to be taken in a limiting sense, and the scope of various embodiments is defined only by the appended claims, along with the full range of equivalents to which such claims are entitled.


Such embodiments of the inventive subject matter may be referred to herein, individually and/or collectively, by the term “invention” merely for convenience and without intending to voluntarily limit the scope of this application to any single invention or inventive concept if more than one is in fact disclosed. Thus, although specific embodiments have been illustrated and described herein, it should be appreciated that any arrangement calculated to achieve the same purpose may be substituted for the specific embodiments shown. This disclosure is intended to cover any and all adaptations or variations of various embodiments. Combinations of the above embodiments, and other embodiments not specifically described herein, will be apparent to those of skill in the art upon reviewing the above description.

Claims
  • 1. A method comprising: determining that one or more items have changed to a specified inventory status in an inventory database;responsive to the one or more items changing to the specified inventory status, storing the one or more items as items to be auctioned at a specified time;detecting a plurality of location-enabled client devices located within a predefined geographical area;transmitting electronic notifications to the plurality of location-enabled client devices located within a predefined geographical area, the electronic notifications indicating that an auction for the one or more items is to occur at the specified time; andin response to the specified time arriving, initiating the auction by transmitting instructions that cause a display of an auction user interface to the plurality of location-enabled client devices within the predefined geographical area, the auction user interface including an option to bid on the one or more items.
  • 2. The method of claim 1, wherein each of the plurality of location-enabled client devices comprises a location sensor, and wherein the plurality of location-enabled client devices are detected using the location sensor.
  • 3. The method of claim 1, wherein the specified inventory status is one or more of the following: low Quantity status or discontinued item status.
  • 4. The method of claim 1, further comprising: executing a predetermined trigger to schedule the auction for the one or more items at the specified time the predetermined trigger configured for execution upon the specified inventory status of the one or more items in the inventory database being met.
  • 5. The method of claim 1, wherein the auction user interface includes a display of a direction instruction that provides directions to a location of the one or more items with respect to a current location of respective devices of the plurality of location-enabled client devices.
  • 6. The method of claim 1, wherein the electronic notifications include an option to register for the auction.
  • 7. The method of claim 1, wherein the predefined geographical area is a physical place.
  • 8. The method of claim 7, wherein the predefined geographical area includes a vicinity surrounding the physical place.
  • 9. The method of claim 1, further comprising: providing a bid history interface that displays bids received to a user of a particular client device among the plurality of location-enabled client devices.
  • 10. The method of claim 1, wherein the electronic notifications is implemented as one of: a mobile application notification, a Short Message Service (SMS) message, or a Multimedia Messaging Service (MMS) message.
  • 11. The method of claim 1, further comprising: transmitting a confirmation to a client device of a winning auction participant, wherein the confirmation indicates a predetermined period of time during which the winning auction participant is to purchase the one or more items.
  • 12. The method of claim 1, wherein the one or more items to be auctioned is one of a quantity of substantially identical items in the inventory database.
  • 13. The method of claim 12, further comprising: determining a number of winning auction participants based on the quantity of substantially identical items to be auctioned and bids received.
  • 14. A system comprising: one or more processors of a machine; anda memory storing instructions that, when executed by the one or more processors, cause the machine to perform operations comprising:determining that one or more items have changed to a specified inventory status in an inventory database;responsive to the one or more items changing to the specified inventory status, storing the one or more items as items to be auctioned at a specified time;detecting a plurality of location-enabled client devices located within a predefined geographical area;transmitting electronic notifications to the plurality of location-enabled client devices located within a predefined geographical area, the electronic notifications indicating that an auction for the one or more items is to occur at the specified time; andin response to the specified time arriving, initiating the auction by transmitting instructions that cause a display of an auction user interface to the plurality of location-enabled client devices within the predefined geographical area, the auction user interface including an option to bid on the one or more items.
  • 15. The system of claim 14, wherein each of the plurality of location-enabled client devices comprises a location sensor, and wherein the plurality of location-enabled client devices are detected using the location sensor.
  • 16. The system of claim 14, wherein the specified inventory status is one or more of the following: low quantity status or discontinued item status.
  • 17. The system of claim 14, the operations further comprising: executing a predetermined trigger to schedule the auction for the one or more items at the specified time the predetermined trigger configured for execution upon the specified inventory status of the one or more items in the inventory database being met.
  • 18. The system of claim 14, wherein the auction user interface includes a display of a direction instruction that provides directions to a location of the one or more items with respect to a current location of respective devices of the plurality of location-enabled client devices.
  • 19. A non-transitory machine-readable storage medium embodying instructions that, when executed by a machine, cause the machine to perform operations comprising: determining that one or more items have changed to a specified inventory status in an inventory database;responsive to the one or more items changing to the specified inventory status, storing the one or more items as items to be auctioned at a specified time;detecting a plurality of location-enabled client devices located within a predefined geographical area;transmitting electronic notifications to the plurality of location-enabled client devices located within a predefined geographical area, the electronic notifications indicating that an auction for the one or more items is to occur at the specified time; andin response to the specified time arriving, initiating the auction by transmitting instructions that cause a display of an auction interface to the plurality of location-enabled client devices within the predefined geographical area, the auction interface including an option to bid on the one or more items.
  • 20. The machine-readable storage medium of claim 19, wherein each of the plurality of location-enabled client devices comprises a location sensor, and wherein the plurality of location-enabled client devices are detected using the location sensor.
CLAIM OF PRIORITY

This application is a continuation of U.S. application Ser. No. 13/324,834, filed on Dec. 13, 2011, which is incorporated herein by reference in its entirety.

US Referenced Citations (228)
Number Name Date Kind
5559707 Delorme et al. Sep 1996 A
5649114 Deaton et al. Jul 1997 A
5724521 Dedrick Mar 1998 A
5724660 Kauser et al. Mar 1998 A
5732354 Macdonald Mar 1998 A
5848373 DeLorme et al. Dec 1998 A
5890068 Fattouche et al. Mar 1999 A
5938721 Dussell et al. Aug 1999 A
5946687 Gehani et al. Aug 1999 A
5948040 DeLorme et al. Sep 1999 A
6014090 Rosen et al. Jan 2000 A
6069570 Herring et al. May 2000 A
6091956 Hollenberg Jul 2000 A
6097958 Bergen Aug 2000 A
6122520 Want et al. Sep 2000 A
6154172 Piccionelli et al. Nov 2000 A
6157841 Bolduc et al. Dec 2000 A
6167274 Smith Dec 2000 A
6198927 Wright et al. Mar 2001 B1
6204812 Fattouche Mar 2001 B1
6208297 Fattouche et al. Mar 2001 B1
6208857 Agre et al. Mar 2001 B1
6243588 Koorapaty et al. Jun 2001 B1
6246861 Messier et al. Jun 2001 B1
6246882 Lachance Jun 2001 B1
6259381 Small Jul 2001 B1
6259923 Lim et al. Jul 2001 B1
6266014 Fattouche et al. Jul 2001 B1
6269361 Davis et al. Jul 2001 B1
6314365 Smith Nov 2001 B1
6317684 Roeseler et al. Nov 2001 B1
6321158 Delorme et al. Nov 2001 B1
6330452 Fattouche et al. Dec 2001 B1
6341255 Lapidot Jan 2002 B1
6347230 Koshima et al. Feb 2002 B2
6356543 Hall et al. Mar 2002 B2
6357042 Srinivasan et al. Mar 2002 B2
6374176 Schmier et al. Apr 2002 B1
6374177 Lee et al. Apr 2002 B1
6404388 Sollenberger et al. Jun 2002 B1
6424840 Fitch et al. Jul 2002 B1
6442529 Krishan et al. Aug 2002 B1
6456852 Bar et al. Sep 2002 B2
6477363 Ayoub et al. Nov 2002 B1
6496857 Dustin et al. Dec 2002 B1
6519463 Tendler Feb 2003 B2
6529159 Fan et al. Mar 2003 B1
6552682 Fan Apr 2003 B1
6563459 Takenaga May 2003 B2
6577946 Myr Jun 2003 B2
6580914 Smith Jun 2003 B1
6590529 Schwoegler Jul 2003 B2
6590533 Sollenberger et al. Jul 2003 B2
6618593 Drutman et al. Sep 2003 B1
6664922 Fan Dec 2003 B1
6690322 Shamoto et al. Feb 2004 B2
6714797 Rautila Mar 2004 B1
6718551 Swix et al. Apr 2004 B1
6732120 Du May 2004 B1
6741188 Miller et al. May 2004 B1
6741969 Chen May 2004 B1
6757544 Rangarajan et al. Jun 2004 B2
6807479 Watanabe et al. Oct 2004 B2
6819919 Tanaka Nov 2004 B1
7082365 Sheha et al. Jul 2006 B2
7092702 Cronin et al. Aug 2006 B2
7130622 Vänskä et al. Oct 2006 B2
7138913 Mackenzie et al. Nov 2006 B2
7142858 Aoki et al. Nov 2006 B2
7164986 Humphries et al. Jan 2007 B2
7196639 Joyce et al. Mar 2007 B2
7197719 Doyle et al. Mar 2007 B2
7199815 Aoyama Apr 2007 B2
7203502 Wilson et al. Apr 2007 B2
7203598 Whitsell Apr 2007 B1
7213214 Baar et al. May 2007 B2
7216109 Donner May 2007 B1
7246109 Ramaswamy Jul 2007 B1
7254388 Nam et al. Aug 2007 B2
7273172 Olsen, III et al. Sep 2007 B2
7385499 Horton et al. Jun 2008 B2
7389919 Walker et al. Jun 2008 B2
7502133 Fukunaga et al. Mar 2009 B2
7532899 Wilson et al. May 2009 B2
7657436 Elmore et al. Feb 2010 B2
7668931 Parupudi et al. Feb 2010 B2
7669759 Zettner Mar 2010 B1
7706740 Collins et al. Apr 2010 B2
7715981 Bradley et al. May 2010 B2
7720436 Hamynen et al. May 2010 B2
7720844 Chu et al. May 2010 B2
7747259 Pande et al. Jun 2010 B2
7751971 Chang et al. Jul 2010 B2
7761340 Yee et al. Jul 2010 B2
7848765 Phillips et al. Dec 2010 B2
7909326 Walker et al. Mar 2011 B2
8041604 Glaser Oct 2011 B1
8095428 Penagulur et al. Jan 2012 B2
8098894 Soderstrom Jan 2012 B2
8099109 Altman et al. Jan 2012 B2
8249884 Turner et al. Aug 2012 B2
8326315 Phillips et al. Dec 2012 B2
8355948 Mason Jan 2013 B2
8371502 Galit et al. Feb 2013 B1
8442871 Veres et al. May 2013 B2
8463295 Caralis et al. Jun 2013 B1
8650072 Mason et al. Feb 2014 B2
8811957 Jovicic et al. Aug 2014 B2
8868443 Yankovich et al. Oct 2014 B2
8909248 Phillips et al. Dec 2014 B2
9779450 Godsey et al. Oct 2017 B2
20010055976 Couch et al. Dec 2001 A1
20020046259 Glorikian Apr 2002 A1
20020065689 Bingham et al. May 2002 A1
20020078444 Krewin et al. Jun 2002 A1
20020082941 Bird Jun 2002 A1
20020102967 Chang et al. Aug 2002 A1
20020111154 Eldering et al. Aug 2002 A1
20020115453 Poulin et al. Aug 2002 A1
20020143930 Babu et al. Oct 2002 A1
20020145984 Babu et al. Oct 2002 A1
20020155844 Rankin et al. Oct 2002 A1
20020160766 Portman et al. Oct 2002 A1
20020198003 Klapman Dec 2002 A1
20030004802 Callegari Jan 2003 A1
20030007006 Baar et al. Jan 2003 A1
20030037041 Hertz Feb 2003 A1
20030040324 Eldering et al. Feb 2003 A1
20030065805 Barnes, Jr. Apr 2003 A1
20030125043 Silvester et al. Jul 2003 A1
20030126150 Chan et al. Jul 2003 A1
20030130787 Clapper Jul 2003 A1
20030139190 Steelberg et al. Jul 2003 A1
20030216960 Postrel Nov 2003 A1
20030220835 Barnes, Jr. Nov 2003 A1
20040002359 Deas et al. Jan 2004 A1
20040021567 Dunn Feb 2004 A1
20040023666 Moon et al. Feb 2004 A1
20040039579 Chithambaram et al. Feb 2004 A1
20040043773 Lee et al. Mar 2004 A1
20040111332 Baar et al. Jun 2004 A1
20040139330 Baar Jul 2004 A1
20040192339 Wilson et al. Sep 2004 A1
20040192349 Reilly Sep 2004 A1
20040203901 Wilson et al. Oct 2004 A1
20040203931 Karaoguz Oct 2004 A1
20040220821 Ericsson Nov 2004 A1
20050015300 Smith et al. Jan 2005 A1
20050044032 Lee et al. Feb 2005 A1
20050064852 Baldursson Mar 2005 A1
20050065916 Ge et al. Mar 2005 A1
20050159883 Humphries Jul 2005 A1
20050240512 Quintero et al. Oct 2005 A1
20050250516 Shim Nov 2005 A1
20050278749 Ewer et al. Dec 2005 A1
20060004646 Schoen Jan 2006 A1
20060047825 Steenstra et al. Mar 2006 A1
20060064346 Steenstra et al. Mar 2006 A1
20060089792 Manber et al. Apr 2006 A1
20060098028 Baar May 2006 A1
20060099959 Staton et al. May 2006 A1
20060145837 Horton et al. Jul 2006 A1
20060148488 Syrbe Jul 2006 A1
20060218114 Weare et al. Sep 2006 A1
20060236257 Othmer et al. Oct 2006 A1
20060270421 Phillips et al. Nov 2006 A1
20060271281 Ahn et al. Nov 2006 A1
20070015517 Casey Jan 2007 A1
20070024469 Chou Feb 2007 A1
20070083437 Hamor Apr 2007 A1
20070100740 Penagulur et al. May 2007 A1
20070118430 Wiseman et al. May 2007 A1
20070124229 Ku et al. May 2007 A1
20070165050 Baar Jul 2007 A1
20070202844 Wilson et al. Aug 2007 A1
20070244633 Phillips et al. Oct 2007 A1
20080035725 Jambunathan et al. Feb 2008 A1
20080040216 Dellovo Feb 2008 A1
20080046415 Henkin et al. Feb 2008 A1
20080070588 Morin Mar 2008 A1
20080102947 Hays et al. May 2008 A1
20080109301 Yee May 2008 A1
20080126251 Wassingbo May 2008 A1
20080126515 Chambers et al. May 2008 A1
20080177749 Overton Jul 2008 A1
20080248815 Busch Oct 2008 A1
20080262958 Ku et al. Oct 2008 A1
20080290987 Li Nov 2008 A1
20080313078 Payne Dec 2008 A1
20090005077 Forstall et al. Jan 2009 A1
20090024476 Baar et al. Jan 2009 A1
20090037101 Koike et al. Feb 2009 A1
20090061884 Rajan et al. Mar 2009 A1
20090063229 Coladonato et al. Mar 2009 A1
20090076911 Vo et al. Mar 2009 A1
20090076925 Dewitt et al. Mar 2009 A1
20090099951 Pandurangan Apr 2009 A1
20090100037 Scheibe Apr 2009 A1
20090132961 Baar May 2009 A1
20090156234 Sako et al. Jun 2009 A1
20090198607 Badger et al. Aug 2009 A1
20090204672 Jetha et al. Aug 2009 A1
20100293068 Drakoulis Nov 2010 A1
20110047075 Fourez Feb 2011 A1
20110173062 Chen et al. Jul 2011 A1
20110212717 Rhoads et al. Sep 2011 A1
20110238472 Sunkada Sep 2011 A1
20110238476 Carr et al. Sep 2011 A1
20110307338 Carlson Dec 2011 A1
20120126974 Phillips et al. May 2012 A1
20120129553 Phillips et al. May 2012 A1
20120130796 Busch May 2012 A1
20120150619 Jacob Sushil et al. Jun 2012 A1
20120191551 Lutnick et al. Jul 2012 A1
20120239483 Yankovich et al. Sep 2012 A1
20120239501 Yankovich et al. Sep 2012 A1
20130006735 Koenigsberg et al. Jan 2013 A1
20130110624 Mitrovic May 2013 A1
20130150086 Caralis et al. Jun 2013 A1
20130151366 Godsey et al. Jun 2013 A1
20130173377 Keller et al. Jul 2013 A1
20130262231 Glasgow et al. Oct 2013 A1
20130346233 Caralis et al. Dec 2013 A1
20150006291 Yankovich et al. Jan 2015 A1
20150032531 Yankovich et al. Jan 2015 A1
20150065177 Phillips et al. Mar 2015 A1
20150148078 Phillips et al. May 2015 A1
20150163632 Phillips et al. Jun 2015 A1
Foreign Referenced Citations (2)
Number Date Country
WO-0122326 Mar 2001 WO
WO-03075193 Sep 2003 WO
Non-Patent Literature Citations (174)
Entry
Du Preez, A. G., Ellenport, J. S., & Comas, B. J. (1007). System and method for conducting online auctions Retrieved from https://search.proquest.com/docview/753696990?accountid=14753.
“U.S. Appl. No. 11/140,273, Final Office Action dated Jul. 15, 2009”, 11 pgs.
“U.S. Appl. No. 11/140,273, Final Office Action dated Dec. 13, 2007”, 11 pgs.
“U.S. Appl. No. 11/140,273, Non Final Office Action dated Feb. 26, 2010”, 11 pgs.
“U.S. Appl. No. 11/140,273, Non Final Office Action dated May 31, 2007”, 10 pgs.
“U.S. Appl. No. 11/140,273, Non Final Office Action dated Jul. 3, 2008”, 11 pgs.
“U.S. Appl. No. 11/140,273, Notice of Allowance dated Aug. 3, 2010”, 6 pgs.
“U.S. Appl. No. 11/140,273, Preliminary Amendment dated Aug. 30, 2005”, 32 pgs.
“U.S. Appl. No. 11/140,273, Response filed Mar. 20, 2007 to Restriction Requirement dated Feb. 21, 2007”, 10 pgs.
“U.S. Appl. No. 11/140,273, Response filed Apr. 14, 2008 to Final Office Action dated Dec. 13, 2007”, 13 pgs.
“U.S. Appl. No. 11/140,273, Response filed Apr. 21, 2009 to Restriction Requirement dated Jan. 21, 2009”, 10 pgs.
“U.S. Appl. No. 11/140,273, Response filed May 26, 2010 to Non Final Office Action dated Feb. 26, 2010”, 13 pgs.
“U.S. Appl. No. 11/140,273, Response filed May 27, 2007 to Final Office Action dated Dec. 13, 2007”, 18 pgs.
“U.S. Appl. No. 11/140,273, Response filed Oct. 7, 2008 to Non Final Office Action dated Jul. 3, 2008”, 17 pgs.
“U.S. Appl. No. 11/140,273, Response filed Nov. 16, 2009 to Non Final Office Action dated Jul. 15, 2009”, 19 pgs.
“U.S. Appl. No. 11/140,273, Response filed Nov. 27, 2007 to Non Final Office Action dated May 31, 2007”, 12 pgs.
“U.S. Appl. No. 11/140,273, Restriction Requirement dated Jan. 21, 2009”, 6 pgs.
“U.S. Appl. No. 11/140,273, Restriction Requirement dated Feb. 21, 2007”, 5 pgs.
“U.S. Appl. No. 11/593,047, Supplemental Amendment filed Mar. 18, 2010”, 12 pgs.
“U.S. Appl. No. 11/593,047, Advisory Action dated Jan. 29, 2010”, 4 pgs.
“U.S. Appl. No. 11/593,047, Applicant,s Summary of Examiner Interview filed Mar. 15, 2010”, 2 pgs.
“U.S. Appl. No. 11/593,047, Examiner Interview Summary dated Mar. 12, 2010”, 4 pgs.
“U.S. Appl. No. 11/593,047, Examiner Interview Summary dated Jul. 24, 2014”, 2 pgs.
“U.S. Appl. No. 11/593,047, Final Office Action dated Dec. 1, 2009”, 19 pgs.
“U.S. Appl. No. 11/593,047, Non Final Office Action dated Feb. 2, 2009”, 18 pgs.
“U.S. Appl. No. 11/593,047, Non Final Office Action dated Mar. 11, 2014”, 18 pgs.
“U.S. Appl. No. 11/593,047, Non Final Office Action dated Sep. 4, 2009”, 13 pgs.
“U.S. Appl. No. 11/593,047, Response filed Jan. 22, 2010 to Final Office Action dated Dec. 1, 2009”, 23 pgs.
“U.S. Appl. No. 11/593,047, Response filed Apr. 20, 2009 to Non Final Office Action dated Feb. 2, 2009”, 33 pgs.
“U.S. Appl. No. 11/593,047, Response filed Jul. 28, 2014 to Non Final Office Action dated Mar. 11, 2014”, 10 pgs.
“U.S. Appl. No. 11/593,047, Response filed Nov. 16, 2009 to Non Final Office Action dated Sep. 4, 2009”, 20 pgs.
“U.S. Appl. No. 11/690,720, Examiner Interview Summary dated Feb. 22, 2012”, 3 pgs.
“U.S. Appl. No. 11/690,720, Final Office Action dated Apr. 27, 2010”, 10 pgs.
“U.S. Appl. No. 11/690,720, Final Office Action dated Nov. 9, 2011”, 17 pgs.
“U.S. Appl. No. 11/690,720, Non Final Office Action dated Sep. 25, 2009”, 20 pgs.
“U.S. Appl. No. 11/690,720, Non-Final Office Action dated May 17, 2011”, 11 pgs.
“U.S. Appl. No. 11/690,720, Notice of Allowance dated May 15, 2012”, 7 pgs.
“U.S. Appl. No. 11/690,720, Notice of Allowance dated Aug. 2, 2012”, 7 pgs.
“U.S. Appl. No. 11/690,720, Preliminary Amendment filed Mar. 23, 2007”, 8 pgs.
“U.S. Appl. No. 11/690,720, Response filed Jan. 28, 2010 to Non Final Office Action dated Sep. 25, 2010”, 11 pgs.
“U.S. Appl. No. 11/690,720, Response filed Feb. 15, 2012 to Final Office Action dated Nov. 9, 2011”, 14 pgs.
“U.S. Appl. No. 11/690,720, Response filed Aug. 17, 2011 to Non Final Office Action dated May 17, 2011”, 13 pgs.
“U.S. Appl. No. 11/690,720, Response filed Aug. 25, 2010 to Final Office Action dated Apr. 27, 2010”, 11 pgs.
“U.S. Appl. No. 12/175,512, Final Office Action dated Dec. 7, 2011”, 13 pgs.
“U.S. Appl. No. 12/175,512, Non Final Office Action dated Jul. 26, 2011”, 12 pgs.
“U.S. Appl. No. 12/175,512, Response filed Mar. 7, 2012 to Final Office Action dated Dec. 7, 2011”, 10 pgs.
“U.S. Appl. No. 12/175,512, Response filed Nov. 28, 2011 to Non-Final Office Action dated Aug. 1, 2011”, 12 pgs.
“U.S. Appl. No. 12/268,693, Final Office Action dated Dec. 2, 2011”, 20 pgs.
“U.S. Appl. No. 12/268,693, Non Final Office Action dated Aug. 8, 2011”, 16 pgs.
“U.S. Appl. No. 12/268,693, Response filed Jun. 1, 2012 to Final Office Action dated Dec. 2, 2011”, 11 pgs.
“U.S. Appl. No. 12/268,693, Response filed Nov. 8, 2011 to Restriction Requirement dated Aug. 8, 2011”, 11 pgs.
“U.S. Appl. No. 12/369,068 , Response filed Nov. 21, 2011 to Final Office Action Aug. 19, 2011”, 12 pgs.
“U.S. Appl. No. 12/369,068, Final Office Action dated Aug. 19, 2011”, 17 pgs.
“U.S. Appl. No. 12/369,068, Non Final Office Action dated Oct. 8, 2013”, 19 pgs.
“U.S. Appl. No. 12/369,068, Non Final Office Action dated Dec. 8, 2010”, 19 pgs.
“U.S. Appl. No. 12/369,068, Response filed Feb. 10, 2014 to Non Final Office Action dated Oct. 8, 2013”, 14 pgs.
“U.S. Appl. No. 12/369,068, Response filed Jun. 8, 2011 to Non Final Office Action Dec. 8, 2010”, 19 pgs.
“U.S. Appl. No. 13/050,769, 312 Amendment filed Sep. 16, 2014”, 3 pgs.
“U.S. Appl. No. 13/050,769, Final Office Action dated Jun. 17, 2013”, 10 pgs.
“U.S. Appl. No. 13/050,769, Non Final Office Action dated Jan. 11, 2013”, 10 pgs.
“U.S. Appl. No. 13/050,769, Notice of Allowance dated Jun. 16, 2014”, 8 pgs.
“U.S. Appl. No. 13/050,769, PTO Response to 312 Amendment dated Sep. 25, 2014”, 2 pgs.
“U.S. Appl. No. 13/050,769, Response filed Apr. 9, 2013 to Non Final Office Action dated Jan. 11, 2013”, 15 pgs.
“U.S. Appl. No. 13/050,769, Response filed Sep. 5, 2013 to Final Office Action dated Jun. 17, 2013”, 14 pgs.
“U.S. Appl. No. 13/282,199, Examiner Interview Summary dated Jul. 22, 2014”, 3 pgs.
“U.S. Appl. No. 13/282,199, Final Office Action dated Sep. 26, 2013”, 25 pgs.
“U.S. Appl. No. 13/282,199, Non Final Office Action dated Apr. 9, 2014”, 28 pgs.
“U.S. Appl. No. 13/282,199, Non Final Office Action dated Apr. 29, 2013”, 20 pgs.
“U.S. Appl. No. 13/282,199, Response filed Jan. 27, 2014 to Non-Final Office Action dated Sep. 26, 2013”, 14 pgs.
“U.S. Appl. No. 13/282,199, Response filed Apr. 4, 2013 to Restriction Requirement dated Mar. 7, 2013”, 10 pgs.
“U.S. Appl. No. 13/282,199, Response filed Jul. 17, 2014 to Non Final Office Action dated Apr. 9, 2014”, 16 pgs.
“U.S. Appl. No. 13/282,199, Response filed Aug. 28, 2013 to Non Final Office Action dated Apr. 29, 2013”, 16 pgs.
“U.S. Appl. No. 13/282,199, Restriction Requirement dated Mar. 7, 2013”, 8 pgs.
“U.S. Appl. No. 13/313,681, Non Final Office Action dated Aug. 21, 2012”, 23 pgs.
“U.S. Appl. No. 13/313,681, Notice of Allowance dated Feb. 7, 2013”, 13 pgs.
“U.S. Appl. No. 13/313,681, Response filed Jan. 21, 2013 to Non Final Office Action dated Aug. 21, 2012”, 10 pgs.
“U.S. Appl. No. 13/324,834, 312 Amendment filed Jun. 13, 2017”, 8 pgs.
“U.S. Appl. No. 13/324,834, Examiner Interview Summary dated May 6, 2016”, 3 pgs.
“U.S. Appl. No. 13/324,834, Examiner Interview Summary dated Jul. 28, 2015”, 3 pgs.
“U.S. Appl. No. 13/324,834, Examiner Interview Summary dated Oct. 31, 2016”, 3 pgs.
“U.S. Appl. No. 13/324,834, Final Office Action dated Jan. 13, 2014”, 13 pgs.
“U.S. Appl. No. 13/324,834, Final Office Action dated Apr. 28, 2015”, 20 pgs.
“U.S. Appl. No. 13/324,834, Final Office Action dated Aug. 2, 2016”, 16 pgs.
“U.S. Appl. No. 13/324,834, Non Final Office Action dated Mar. 9, 2016”, 19 pgs.
“U.S. Appl. No. 13/324,834, Non Final Office Action dated Aug. 14, 2013”, 12 pgs.
“U.S. Appl. No. 13/324,834, Non Final Office Action dated Aug. 27, 2014”, 16 pgs.
“U.S. Appl. No. 13/324,834, Notice of Allowance dated May 30, 2017”, 10 pgs.
“U.S. Appl. No. 13/324,834, PTO Response to Rule 312 Communication dated Jun. 26, 2017”, 2 pgs.
“U.S. Appl. No. 13/324,834, Response filed Feb. 27, 2015 to Non Final Office Action dated Aug. 27, 2014”, 23 pgs.
“U.S. Appl. No. 13/324,834, Response filed Apr. 14, 2014 to Final Office Action dated Jan. 13, 2014”, 9 pgs.
“U.S. Appl. No. 13/324,834, Response filed Jun. 1, 2016 to Non Final Office Action dated Mar. 9, 2016”, 15 pgs.
“U.S. Appl. No. 13/324,834, Response filed Jul. 28, 2015 to Final Office Action dated Apr. 28, 2015”, 19 pgs.
“U.S. Appl. No. 13/324,834, Response filed Nov. 2, 2016 to Final Office Action dated Aug. 2, 2016”, 20 pgs.
“U.S. Appl. No. 13/324,834, Response filed Nov. 13, 2013 to Non Final Office Action dated Aug. 14, 2013”, 10 pgs.
“U.S. Appl. No. 13/339,235, Final Office Action dated Jan. 27, 2017”, 16 pgs.
“U.S. Appl. No. 13/339,235, Final Office Action dated Aug. 29, 2012”, 11 pgs.
“U.S. Appl. No. 13/339,235, Final Office Action Dec. 2, 2014”, 7 pgs.
“U.S. Appl. No. 13/339,235, Non Final Office Action dated Feb. 12, 2015”, 4 pgs.
“U.S. Appl. No. 13/339,235, Non Final Office Action dated Mar. 16, 2012”, 10 pgs.
“U.S. Appl. No. 13/339,235, Non Final Office Action dated May 16, 2016”, 15 pgs.
“U.S. Appl. No. 13/339,235, Non Final Office Action dated Aug. 18, 2014”, 4 pgs.
“U.S. Appl. No. 13/339,235, Non Final Office Action dated Sep. 18, 2015”, 14 pgs.
“U.S. Appl. No. 13/339,235, Notice of Allowance dated Apr. 25, 2014”, 8 pgs.
“U.S. Appl. No. 13/339,235, Response filed Jan. 19, 2016 to Non Final Office Action dated Sep. 18, 2015”, 21 pgs.
“U.S. Appl. No. 13/339,235, Response filed Feb. 2, 2015 to Final Office Action dated Dec. 2, 2014”, 12 pgs.
“U.S. Appl. No. 13/339,235, Response filed Apr. 27, 2017 to Final Office Action dated Jan. 27, 2017”, 23 pgs.
“U.S. Appl. No. 13/339,235, Response filed May 12, 2015 to Non Final Office Action dated Feb. 12, 2015”, 33 pgs.
“U.S. Appl. No. 13/339,235, Response filed Jun. 15, 2012 to Non Final Office Action dated Mar. 16, 2012”, 11 pgs.
“U.S. Appl. No. 13/339,235, Response filed Aug. 16, 2016 to Non Final Office Action dated May 16, 2016”, 23 pgs.
“U.S. Appl. No. 13/339,235, Response filed Nov. 18, 2014 to Non Final Office Action dated Aug. 18, 2014”, 20 pgs.
“U.S. Appl. No. 13/339,235, Response filed Nov. 29, 2012 to Final Office Action dated Aug. 29, 2012”, 11 pgs.
“U.S. Appl. No. 13/340,970, Advisory Action dated Feb. 13, 2014”, 3 pgs.
“U.S. Appl. No. 13/340,970, Final Office Action dated Sep. 26, 2013”, 18 pgs.
“U.S. Appl. No. 13/340,970, Non Final Office Action dated Apr. 12, 2013”, 17 pgs.
“U.S. Appl. No. 13/340,970, Response filed Feb. 25, 2014 to Advisory Action dated Feb. 13, 2014”, 10 pgs.
“U.S. Appl. No. 13/340,970, Response filed Jul. 12, 2013 to Non Final Office Action dated Apr. 12, 2013”, 10 pgs.
“U.S. Appl. No. 13/340,970; Response filed Jan. 27, 2014 to Final Office Action dated Sep. 26, 2013”, 10 pgs.
“U.S. Appl. No. 13/361,113, 312 Amendment filed Oct. 29, 2014”, 6 pgs.
“U.S. Appl. No. 13/361,113, Non Final Office Action dated Feb. 13, 2014”, 13 pgs.
“U.S. Appl. No. 13/361,113, Notice of Allowance dated Aug. 1, 2014”, 8 pgs.
“U.S. Appl. No. 13/361,113, PTO Response to 312 Amendment dated Nov. 6, 2014”, 2 pgs.
“U.S. Appl. No. 13/361,113, Response filed May 13, 2014 to Non Final Office Action dated Feb. 13, 2014”, 13 pgs.
“U.S. Appl. No. 13/361,113, Supplemental Notice of Allowability dated Sep. 17, 2014”, 2 pgs.
“U.S. Appl. No. 13/361,196, Examiner Interview Summary dated Apr. 22, 2013”, 3 pgs.
“U.S. Appl. No. 13/361,196, Final Office Action dated Jan. 22, 2013”, 15 pgs.
“U.S. Appl. No. 13/361,196, Non Final Office Action dated Jan. 3, 2014”, 11 pgs.
“U.S. Appl. No. 13/361,196, Non Final Office Action dated Mar. 29, 2012”, 12 pgs.
“U.S. Appl. No. 13/361,196, Non Final Office Action dated Aug. 23, 2012”, 13 pgs.
“U.S. Appl. No. 13/361,196, Notice of Allowance dated Jun. 10, 2014”, 8 pgs.
“U.S. Appl. No. 13/361,196, Response filed Apr. 2, 2014 to Non Final Office Action dated Jan. 3, 2014”, 7 pgs.
“U.S. Appl. No. 13/361,196, Response filed Apr. 18, 2013 to Final Office Action Jan. 22, 2013”, 10 pgs.
“U.S. Appl. No. 13/361,196, Response filed Jun. 21, 2012 to Non Final Office Action dated Mar. 29, 2012”, 9 pgs.
“U.S. Appl. No. 13/361,196, Response filed Nov. 21, 2012 to Non Final Office Action dated Aug. 23, 2012”, 13 pgs.
“U.S. Appl. No. 13/436,370, Examiner Interview Summary dated May 7, 2015”, 3 pgs.
“U.S. Appl. No. 13/436,370, Final Office Action dated Jun. 12, 2015”, 18 pgs.
“U.S. Appl. No. 13/436,370, Final Office Action dated Oct. 13, 2016”, 14 pgs.
“U.S. Appl. No. 13/436,370, Non Final Office Action dated Mar. 25, 2016”, 18 pgs.
“U.S. Appl. No. 13/436,370, Non Final Office Action dated Nov. 5, 2014”, 15 pgs.
“U.S. Appl. No. 13/436,370, Response filed May 4, 2015 to Non Final Office Action dated Nov. 5, 2014”, 30 pgs.
“U.S. Appl. No. 13/436,370, Response filed Aug. 25, 2016 to Non Final Office Action dated Mar. 25, 2016”, 15 pgs.
“U.S. Appl. No. 13/436,370, Response filed Oct. 6, 2015 to Final Office Action dated Jun. 12, 2015”, 20 pgs.
“U.S. Appl. No. 13/913,768, Preliminary Amendment dated Dec. 3, 2013”, 8 pgs.
“U.S. Appl. No. 14/486,518, Final Office Action dated Dec. 8, 2015”, 7 pgs.
“U.S. Appl. No. 14/486,518, Non Final Office Action dated May 21, 2015”, 9 pgs.
“U.S. Appl. No. 14/486,518, Non Final Office Action dated Nov. 30, 2016”, 13 pgs.
“U.S. Appl. No. 14/486,518, Preliminary Amendment filed Oct. 8, 2014”, 9 pgs.
“U.S. Appl. No. 14/486,518, Response Filed Apr. 8, 2016 to Final Office Action dated Dec. 8, 2015”, 10 pgs.
“U.S. Appl. No. 14/486,518, Response filed May 1, 2017 to Non Final Office Action dated Nov. 30, 2016”, 21 pgs.
“U.S. Appl. No. 14/486,518, Response filed Aug. 21, 2015 to Non Final Office Action dated May 21, 2015”, 17 pgs.
“U.S. Appl. No. 14/512,350, Final Office Action dated Nov. 30, 2015”, 7 pgs.
“U.S. Appl. No. 14/512,350, Non Final Office Action dated Mar. 11, 2016”, 7 pgs.
“U.S. Appl. No. 14/512,350, Non Final Office Action dated May 22, 2015”, 10 pgs.
“U.S. Appl. No. 14/512,350, Non Final Office Action dated Nov. 2, 2016”, 14 pgs.
“U.S. Appl. No. 14/512,350, Preliminary Amendment dated Nov. 26, 2014”, 10 pgs.
“U.S. Appl. No. 14/512,350, Response filed Feb. 29, 2016 to Final Office Action dated Nov. 30, 2015”, 10 pgs.
“U.S. Appl. No. 14/512,350, Response filed Apr. 3, 2017 to Non Final Office Action dated Nov. 2, 2016”, 25 pgs.
“U.S. Appl. No. 14/512,350, Response filed Jun. 13, 2016 to Non-Final Office Action filed Mar. 11, 2016”, 16 pgs.
“U.S. Appl. No. 14/512,350, Response filed Aug. 24, 2015 to Non Final Office Actio dated May 22, 2015”, 20 pgs.
“U.S. Appl. No. 14/534,797, Preliminary Amendment dated Nov. 14, 2014”, 8 pgs.
“U.S. Appl. No. 14/611,210, Preliminary Amendment filed Feb. 4, 2015”, 8 pgs.
“U.S. Appl. No. 14/624,083, Preliminary Amendment filed Mar. 6, 2015”, 9 pgs.
“Foursquare”, Wikipedia, [Online]. Retrieved from the Internet: <http://en.wikipedia.org/wiki/Foursquare>, (Accessed Apr. 16, 2013), 12 pgs.
“Halfbakery: Buddy Locator”, [Online]. Retrieved from the Internet: <URL: http://www.halfbakery.com/idea/Buddy_20Locator#1055455737>, (Jun. 11, 2003), 2 pgs.
“Halfbakery: Mobile phone utility”, [Online]. Retrieved from the Internet: <URL: http://www.halfbakery.com/idea/mobile_20phone_20utility#1073585857>, (Jan. 8, 2004), 2 pgs.
“Halfbakery: Mobile Proximity Link”, [Online]. Retrieved from the Internet: <URL: http://www.halfbakery.com/idea/Mobile_20Proximity_20Link#1001923289>, (Sep. 30, 2001), 2 pgs.
“Networks in Motion Named Semi-Finalist for Wireless LBS Challenge”, [Online]. Retrieved from the Internet: <URL: http://www.tmcnet.com/usubmiU2004/Mar/1025200.htm>, (Mar. 18, 2004), 1 pg.
“Proposal for free, open source cell phone location service”, 90% Crud, [Online]. Retrieved from the Internet: <URL: http://george.hotelling.net/90percent/geekery/proposal_for_free_open_source_cell_phone_location_service.php>, (Mar. 6, 2004), 1 pg.
“SignalSoft Corporation awarded location-based services patent”, [Online]. Retrieved from the Internet: <URL: http://www.cellular.co.za/news 2001/04282001-signalsoft-patent.htm>, (Apr. 27, 2001), 1 pg.
Carpendale, Marianne S.T, “A Framework for Elastic Presentation Space”, Burnaby, British Columbia, Simon Fraser University, (1999), 296 pgs.
Du, Preez, et al., “System and method for online auctions”, [Online] retrieved from the internet: <https://search.proquest.com/docview/753696990?accountid=14753>.
Keath, Jason, “21 Unique Location Examples from Foursquare”, Gowalla, Whrrl, and MyTown, Socialfresh.com, (Jun. 1, 2010), 9 pgs.
Klemperer, Paul, “Auctions: Theory and Practice”, Princeton University Press, (2004), 6 pgs.
Manninen, JP, ““Geofencing” enables new location-based apps, raises privacy concerns.”, VentureBeat, [Online]. Retrieved from the Internet: <URL: http:/ /venturebeat.com/2010/04/23/ geofencing -pushes-services-to-phones/ >, (Apr. 23, 2010), 4 pgs.
Yankovich, Steve, et al., “Targeted Incentive Actions Based on Location and Intent”, U.S. Appl. No. 13/050,769, filed Mar. 17, 2011, 47 pgs.
Related Publications (1)
Number Date Country
20170358026 A1 Dec 2017 US
Continuations (1)
Number Date Country
Parent 13324834 Dec 2011 US
Child 15688226 US