Abstract:
A system and method of enhancing shopping search engines and games of chance by permitting the user to search for and locate the prize the user seeks to win or buy, and then playing a game of chance to win the specified item, or going to the web site to buy. The system calculates a dynamic probability of winning the item based on several factors. The system randomly generates a trial outcome of an event trial and an outcome indicator, with the probability of the event trial generating a winning trial outcome corresponding to the calculated probability of winning. The outcome indicator represents either a winning trial outcome or a losing trial outcome. In response to a winning trial outcome, the system purchases the item for the user from the independent third-party retail vendor at no cost to the user.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
       [0001]    This continuation application claims the benefit of non-provisional application Ser. No. 09/759,103, filed Jan. 12, 2001, the entire content of which is herein incorporated by reference. 
     
    
     FIELD OF THE INVENTION 
       [0002]    This invention relates to the field of online shopping and gaming, and, more particularly, permitting the user to search for and locate the prize the user seeks to win or buy. 
       BACKGROUND OF THE INVENTION 
       [0003]    Shopping search engines accept descriptions of a desired product or service that a user wishes to purchase, and return indications of dealers in the product or service. The user may then purchase the product or service from a dealer indicated by the search engine. The most common such shopping search engines are price comparison search engines such as mysimon.com, which return indications of dealers together with associated prices. Such shopping search engines lack the excitement provided by games of chance. Other shopping search engines include shopnow.com, bottomdollar.com, dealtime.com, and anaconda.net. 
         [0004]    Conversely, games of chance do not permit the user to search for the prize to be won. The range of prizes to be won in any particular game of chance have generally been small, and determined by the sponsor of the game. Typically, only a single prize or a fixed range of prizes may be won. Such sites include Iwon.com, Iwin.com, Freelotto.com, Luckysurf.com, and Treeloot.com. Viewing advertisements typically is a prerequisite of play, and may increase a user&#39;s chance of winning at these sites. 
         [0005]    Some sites allow users to win or buy one of a small number of predetermined prizes. Such sites include Bigprizes.com and Winday.com. None of these sites permits a user to search for an arbitrary item or service and attempt to win the item or service. 
       SUMMARY OF THE INVENTION 
       [0006]    In one aspect, the system of the present invention enhances shopping search engines and games of chance by permitting the user to search for and locate the prize the user seeks to win or buy, and then playing a game of chance to win the specified item, or going to the web site to buy. 
         [0007]    In another aspect, the system of the present invention adjusts the probability of a user&#39;s winning a game of chance in accordance with the revenue that the system has received from the user. 
         [0008]    In one preferred embodiment, the invention comprises a method of providing a game of chance comprising the steps of: receiving electronic signals representing search parameters descriptive of a product or service; transmitting electronic signals representing dealers in the product or service and associated prices; electronically calculating a probability of winning the product or service if the user selects to play the game; electronically generating a pseudo-random outcome having a probability corresponding to the calculated probability; based on the pseudo-random outcome, purchasing the product or service for a user. 
         [0009]    In another preferred embodiment, the invention further comprises calculating the probability so as to increase with the value of derived from the user&#39;s interaction with the system. 
         [0010]    In another preferred embodiment, the invention further comprises indicating the outcome by displaying a user-chosen number and a comparison number, such that a winning outcome is indicated by displaying a comparison number that matches the user-chosen number, and a losing outcome is indicated by displaying a comparison number that does not match the user-chosen number. 
         [0011]    In another preferred embodiment, an increased probability of winning is indicated by displaying a comparison number having at least one digit matching the corresponding at least one digit of the user-selected number. 
         [0012]    In still another preferred embodiment, the probability of winning is different than one divided by ten raised to the power of the number of digits in the comparison number. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0013]    A further understanding of the invention can be obtained by reference to a preferred embodiment set forth in the illustrations of the accompanying drawings. Although the illustrated embodiment is merely exemplary of systems and methods for carrying out the invention, both the organization and method of operation of the invention, in general, together with further objectives and advantages thereof, may be more easily understood by reference to the drawings and the following description. The drawings are not intended to limit the scope of this invention, which is set forth with particularity in the claims as appended or as subsequently amended, but merely to clarify and exemplify the invention. 
           [0014]    For a more complete understanding of the invention, reference is now made to the following drawings in which: 
           [0015]      FIG. 1  schematically illustrates the architecture of an example preferred embodiment; 
           [0016]      FIG. 2   a  is a flow chart that schematically illustrates the use of an example preferred embodiment; 
           [0017]      FIG. 2   b  is a flow chart that schematically illustrates the use of an example preferred embodiment; 
           [0018]      FIG. 3  illustrates an example display of an example preferred embodiment; 
           [0019]      FIG. 4  illustrates an example display of an example preferred embodiment; 
           [0020]      FIG. 5  illustrates an example display of an example preferred embodiment; 
           [0021]      FIG. 6  illustrates an example display of an example preferred embodiment; 
           [0022]      FIG. 7  illustrates an example display of an example preferred embodiment; 
           [0023]      FIG. 8  illustrates an example display of an example preferred embodiment; 
           [0024]      FIG. 9  illustrates an example display of an example preferred embodiment; 
           [0025]      FIG. 10  illustrates an example display of an example preferred embodiment; 
           [0026]      FIG. 11  illustrates an example display of an example preferred embodiment; and 
           [0027]      FIG. 12  illustrates an example display of an example preferred embodiment. 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       [0028]    The invention may be understood more readily by reference to the following detailed description of preferred embodiment of the invention. However, techniques, systems, and operating structures in accordance with the invention may be embodied in a wide variety of forms and modes, some of which may be quite different from those in the disclosed embodiment. Consequently, the specific structural and functional details disclosed herein are merely representative, yet in that regard, they are deemed to afford the best embodiment for purposes of disclosure and to provide a basis for the claims herein, which define the scope of the invention. It must be noted that, as used in the specification and the appended claims, the singular forms “a”, “an”, and “the” include plural referents unless the context clearly indicates otherwise. 
         [0029]    Comparison Shopping Module 
         [0030]      FIG. 1  depicts the system architecture for an example preferred embodiment of a system implementing the present invention. The system shown in  FIG. 1  retrieves item or service and price information from third-party web sites offering items for sale and allows the user to search for the lowest prices for an item or service. After locating an item or service of interest, the user may purchase the item, service, or attempt to win the item or service via the game aspect of the system described below in connection with system user displays. 
         [0031]    The system comprises three tiers—a presentation tier  101 , an application tier  102 , and a database tier  103 . The presentation tier comprises the Microsoft® IIS 5.0 Web Server with ASP 2.0, along with mobile logic that is transmitted to the browser of a user, including product search logic  105  and Jscript and Java game logic  106 . The Web server and mobile logic interact with the applications tier as indicated in  FIG. 1 . The applications tier comprises an odds management component  107 , a product selection component  108 , a user session manager  109 , and a data-mining component  111 . The applications tier interacts with the presentation tier  101  and the database tier  103 . The database tier  103  comprises a product database  112 , a user database  113 , and a data-mining database  114 . 
         [0032]    Application tier components are Microsoft ActiveX components, preferably written in C++ in conformance with the COM/DCOM distributed object model. The odds management component  107  performs odds calculations and random trials for game play as described more fully below. The product selection component  108  retrieves product information from the product database for presentation to the user when searching for, attempting to win, or purchasing products available through the system. The user session manager  109  maintains state information across HTTP requests, allowing user sessions to be tracked. The data mining component  111  gathers product information from third-party websites for use in the system as described below. 
         [0033]    The database layer is preferably implemented in Microsoft® SQL Server®. The product database  112  stores product information gathered by the data-mining database  114 . The user database  113  stores user profiles, user names, and passwords. The data mining database  113  stores product information gathered by the data mining component  111  from third-party databases. Product information from the data-mining database  114  is periodically copied into the product database  112 . 
         [0034]    The system shown in  FIG. 1  is preferably deployed in a distributed environment, comprising a Web server computer and a database server computer. The Web server computer preferably comprises an Intel Pentium 3 computer connected via Ethernet to an Internet-connected router. The Web server computer preferably runs Microsoft Windows Server 2000 and Microsoft®IIS 5.0 Web Server with ASP 2.0. The database server computer preferably comprises an Intel Pentium 3 computer on the same Ethernet network as the Web server, running Microsoft® Windows Server 2000 and Microsoft® SQL Server® v 7.0. 
         [0035]      FIG. 3  depicts a preferred home web page of the present invention. The advertising banner  301  displays advertisements of third-parties on a rotating basis either each time the front-end web page is refreshed by the user or on a pre-determined time interval. Each of the web pages generated by the system during a user&#39;s session displays an advertising banner  301 , for which advertisers are charged. 
         [0036]    The use of the system is schematically illustrated in  FIGS. 2   a  and  2   b . To begin, the user navigates to the home Web page for the system  201 . From the home page, the user may attempt to win cash  202 , browse for an item or service to attempt to win  203 , or search for an item or service to attempt to win using a search engine interface  204 . After the user locates an item by browsing  203  or searching with search terms and restrictions  204 ,  205 , the system retrieves a list of matching items or services available for sale on third-party Web sites along with pricing and other information  206  and displays the information to the user in a dynamically generated Web page  207 . The user may then select the particular offer they desire  208  and either buy the offered item or service from the offering Web site  209  or attempt to win it using the game aspect of the invention  210 . 
         [0037]    If the user attempts to win the offered item or service  210 , the system determines whether the user has an existing PIN number  211  for use in signifying the outcome of a game of chance. If not, the user may select a PIN by entering a number  212 , or having a pseudo-random PIN generated for the user  213 . When the user has a PIN, the system calculates a probability of winning the selected item or service based on factors including the items cost, the current prize budget available, and the revenues derived from this user  214 . The system then generates a random trial having the calculated probability of occurrence  215 . If the trial results in a win for the user, the system displays the user&#39;s PIN as an outcome number  217  and causes the selected item to be purchased for the user  218 . If the trial does not result in a win for the user, an outcome number not equal to the user&#39;s PIN is displayed  219 . 
         [0038]    From the home Web page depicted in  FIG. 3 , the user may click on the browse-for-prize hyperlink  303 , the win-cash hyperlink  304  or may enter information in the search engine interface  302 . At any time during the user&#39;s session in the preferred embodiment, the user may select and search for a new product or service by using the product search engine interface  302 . 
         [0039]    To use the product search engine interface  302 , the user queries the search engine by entering a description of a desired product or service in the text box  302 . In addition, the user may select search restrictions by clicking on the restriction list  306 . For example, the user might search only electronics or games. Once the product or service title is entered in text box  305 , the restrictions (if any) have been selected from the restriction list  306 , the user may search for the item by clicking on the “Find It” button  307 . The “Find It” button  307  comprises a portion of the product search logic  105  of the presentation layer  101 , and causes a request to be transmitted to the product selection component  108 , which in turn queries the product database  112 . In response, the product database is searched for items meeting the search criteria entered  160 . 
         [0040]    The search engine searches the product database  112  for a set of third-party web sites  100  that sell the desired product or service, along with the price for the product or service and preferably other helpful information such as a picture of the product, a description of the service, product specifications, and availability and shipping options. 
         [0041]    In a preferred embodiment, the search engine looks up the product or service in an indexed table of a selected third-party web sites  100  that have been previously indexed. Preferably, the selected third-party web sites  100  comprise only the web-sites of businesses that have relationships with the proprietors of the system, for which the selected third-party web sites are charged. 
         [0042]    The index of third-party web sites may be generated with a spider or web crawler program or service such as the services available from Inktomi® or Excite®, or the WebL or Harvest programs. In the alternative, such programs can be custom designed and written by those skilled in the art, as described in “Programming Bots, Spiders, and Intelligent Agents in Microsoft Visual C++” by David Pallmann. Alternatively, the search engine may pass the description to search engines on selected sites  100  and retrieve and consolidate the results. A program such as WebL may be used for this purpose. In a preferred embodiment, the index is generated by replicating item databases from the select third-party web sites, via data transmission of database files, which are translated into a standard format by the data mining  102  component and stored in the product database  112 . 
         [0043]    Using the data retrieved from the product database  112  in response to the user&#39;s query, the product selection component  108  dynamically generates  180  a price comparison Web page that presents the price and other data in a format that allows the user to compare the offers made by the third-party web sites  100 . Each third-party web site is preferably presented as a separate entry in a table on the web page, the entry comprising a description of the web site, item or service and price, along with a hyperlink to a page for purchasing the item or service. In a preferred embodiment of the invention, the system also displays review or rating information about the product, service or third-party web site  100  itself. This review or rating information may be generated by prior users of the system or may be incorporated from third-parties such as Consumer Reports or gomez.com. 
         [0044]    The user may click on the user&#39;s choice of hyperlink that corresponds to a desired offer  210 . The system presents a web page that displays the desired product or service and provides the user with the option of purchasing the desired product or service and the option of participating in the game aspect of the present invention in an attempt to win the desired product or service. 
         [0045]      FIG. 4  depicts an example preferred dynamically generated price comparison Web page. The number of different sites found which offer the desired product or service is displayed in the “Sites Found” box  401 . The number of different items found by the search engine is displayed in the “Items Found” box  402 . This information is displayed so that the user can judge the effectiveness of the search, allowing the user to adjust the text or restrictions of the user&#39;s search using the search engine interface  302 . Each third-party web site  100  that offers the desired product or service and which has been located by the search engine is displayed as a row in the table  411 . 
         [0046]    In the preferred embodiment, each row in the table  411  includes a hyperlink to the offer  403 , the associated price  410 , an indicator of the offeror  406  with associated profile  407  and “more info”  408  links, and “Win It”  404  and “Buy It” links. The offer hyperlinks  403  are arranged such that offer with the lowest price is displayed on the top row. When the user selects the “Buy-It” hyperlink  405 , the product selection component  108  causes the user&#39;s browser to retrieve the appropriate page for purchasing the item on the third-party web-site  100  of the user&#39;s choice. By clicking on the “Win It” hyperlink  404 , the user&#39;s browser is caused to retrieve a page that displays the game aspect of the present invention discussed in greater detail below. Additional information regarding the product or the merchant can be obtained by clicking on the “Profile” hyperlink  407  or the “More Info” hyperlink  408 . 
         [0047]    URL-Based Embodiment 
         [0048]    According to another aspect of the present invention, the user can access the system in the manner described above, but instead of entering a desired a product or service into the search engine interface, the user can locate a product by entering a particular web-site or URL address into the system. The system then acquires the price and other helpful data and gives the user the option of purchasing the desired product or service or the option of winning the product or service by participating in the game aspect of the present invention discussed below. This aspect of the system is useful for persons desiring to purchase products or services from classified advertisements. 
         [0049]    In a preferred embodiment of the invention, the user, after entering a specific URL address, may invoke the search engine to determine whether other third-party web-sites offer the desired product or service. If this is the case, the system collects and displays the price and other data in a dynamically generated Web page and the user proceeds as described above. 
         [0050]    Auction Module Embodiment 
         [0051]    According to another aspect of the present invention, users who participate in on-line auctions are provided the opportunity to win the product or service they are bidding on. 
         [0052]    Using a web crawler or database replication, the system retrieves data from online auction systems, such as yahoo.com or ebay.com, and locates auctions that are about to close. The system stores the URLs for such auctions, revisits auctions after they have closed to determine the winners. The system sends an e-mail to each winner with a message and a hyperlink. The hyperlink is generated dynamically and includes an identifier of the bidder and the item that was being bid on. If the email recipient (the auction winner) clicks the hyperlink, the email recipient&#39;s browser causes the system to retrieve the auction information and present it in a dynamically generated web page from which the recipient can play a game in accordance with the game aspect of the invention described more fully below. If the auction winner plays and wins the game, the system reimburses the auction winner for the price of the auction item. In a preferred embodiment, a check for the reimbursement amount is mailed to the auction winner who wins the game. 
         [0053]    Alternatively, users may subscribe to a “win your auction item watch” by supplying the system with their auction user name, e-mail address and an identifier of the auction site that they use. The system regularly monitors the auctions of users who subscribe, and solicits them via email to try and win items they have bid on by participating in the game aspect of the present invention. 
         [0054]    Item Index Module 
         [0055]    In another aspect of the present invention, the user can browse through an index of pre-selected items. The user can navigate through the system&#39;s index of pre-selected items by clicking on descriptive hyperlinks grouped by category. Upon selecting an item that the user desires, the product selection component  108  is invoked to search the product database  112  for third-party web sites, which offer the desired item for sale. The results are displayed, and the user can opt to purchase the item or participate in the game aspect of the present invention in an attempt to win the item. 
         [0056]      FIG. 5  depicts an item index Web page of a preferred embodiment of the present invention. The item index is arranged in a category index  501 . In this example preferred embodiment, the user may obtain more information regarding the available items in the categories of computer hardware or phones by clicking on hyperlinks such as  502  and  503 . 
         [0057]    Search Results Display 
         [0058]    After the user has determined an item to retrieve from the search engine by entering a query or browsing, the search results are displayed as illustrated for an example preferred embodiment in  FIG. 4 . Vendor descriptions for the item description are displayed  403 , together with corresponding prices  410 , and merchant identifiers  406 . The user may acquire additional information about the vendor by accessing the vendor&#39;s profile stored on the system by selecting link  407 . Additional information from the vendor concerning the item may be retrieved via the “more information” link  408 . 
         [0059]    The user may buy the item from the vendor by selecting the corresponding “Buy It” link  405 . The hyperlink comprises a URL for a page on the vendor&#39;s web server from which the user may purchase the selected item. Thereafter the user follows the procedures set forth by the selected web site to purchase the desired product or service. 
         [0060]    The user may instead opt to attempt to win the desired product or service by selecting the “Win It” button  404  displayed corresponding to the user&#39;s selected vendor for an item. When the “Win It” button is selected, the user session manager  109  system uses a cookie stored on the user&#39;s computer, or credentials based on the user&#39;s login to query the user database  113  to determine whether the user has a current PIN number. If the user does not have a current PIN number, the display illustrated in  FIG. 7  is presented. The user may then enter a PIN using form  701 , or randomly select a PIN using applet  702 , which comprises a portion of the Jscript/Java game logic  106 . Applet  702  causes the digits displayed therein to scroll past randomly in response to the “SPIN” button  703  and slow to a stop at a pseudo-randomly determined number. The user may select a new pseudo-random number by selecting the “SPIN” button  703  again, or select the pseudo-randomly generated PIN by selecting the “KEEP” button  704 . 
         [0061]    In response to the user selecting a PIN number using form  701  or applet  702 , a selected-pin page similar in form to that illustrated in  FIG. 8  is displayed, prominently displaying the user&#39;s selected PIN number  801 . To continue playing, the user selects the “Continue” link  803 . 
         [0062]    The display illustrated in  FIG. 12  is presented in response to the “Continue” link  803 , or in response to the “Win It” button if the system determined that the user had a current PIN number in response to the user selecting the “Win It” button  404 . In  FIG. 12 , information describing the selected item and vendor is displayed, together with a link permitting the user to purchase the item from the vendor  1002 . In addition, a “Win It” button  1004  is presented, permitting the user to invoke the odds management component  107  to cause a random trial to be performed. If the outcome of the trial is a win for the user, the odds management component  107  retrieves the user&#39;s shipping address from the user&#39;s profile in the user database  113  and the system purchases and pays for the item on behalf of the user. 
         [0063]    The results of the trial are provided to the user in a dynamically generated Web page illustrated in  FIG. 9 . If the outcome is a win for the user, the odds management component  107  causes the outcome number displayed in outcome applet  901  to match the user&#39;s PIN  601 . If the outcome is a non-win, the outcome number displayed in outcome applet  901  will differ from the user&#39;s PIN  601  as shown in  FIG. 9 . In a preferred embodiment, the outcome applet causes the displayed numbers to scroll by pseudo-randomly until settling one digit at a time on the outcome number. The user may cause additional trials to be performed by selecting the “play again” link  902 . After each trial, a display resembling  FIG. 9  is displayed, along with updated outcome and advertising. Advertisers are charged for each advertisement display, resulting in additional revenue for the system for each trial. The odds management component tracks the revenue generated during a particular user session and uses the information to calculate the user&#39;s probability of winning as described below. 
         [0064]    The odds management component  107  controls the probability of a user winning a desired product or service. A variety of probability models and rules may be applied by the odds management component  107  to determine the probability of winning. Preferably, the odds management component  107  is configured to determine an overall prize budget in real-time, and the user&#39;s probability of winning a desired product or service is varied by the odds management component  107  as a function of the ratio of the product or service&#39;s price to the current prize budget. 
         [0065]    In this preferred embodiment, the odds management component  107  increases the prize budget in real time as revenue accrues to the site through advertising. As more users use the site, advertising revenue increases proportionately. Preferably, each advertisement displayed causes a fixed increment to the prize budget, so that the ratio of the prize budget to users remains approximately fixed as system use increases. Other sources of system revenue may also be allocated to the prize budget. The costs of awarded prizes are deducted from the prize budget, so that the probability of any particular user winning any particular item will fluctuate with time. 
         [0066]    The odds management component  107  also preferably adjusts each user&#39;s probability of winning based on user&#39;s session history retrieved from the user database  113 , including the number of numbers the user has “locked in” (as explained below) and the total advertising earnings derived from the user during this session. Preferably, the odds management component  107  calculates a probability of each user&#39;s winning a particular item so that the expected value of the user&#39;s estimated attempts to win during any period are less than or equal to the expected value of the user&#39;s contributions to the prize budget for the same period. 
         [0067]    In one preferred embodiment, the odds management component  107  calculates the probability of winning for the user as 
         [0000]    
       
         
           
             
               Probability 
                
               
                   
               
                
               of 
                
               
                   
               
                
               winning 
             
             = 
             
               P 
               = 
               
                 
                   
                     P 
                      
                     
                         
                     
                      
                     a 
                     * 
                     Pt 
                     * 
                     Pm 
                   
                   N 
                 
                 + 
                 Pu 
               
             
           
         
       
       
         
           
             where
           N is the number of users currently online.
               P a  is a probability factor that varies with the cost of the selected prize in relation to the total cost of all prizes available on the system, such that P a  approaches zero as the cost of the selected prize approaches the total cost of all prizes, and P a  approaches 1 as the cost of the selected prize approaches zero.   P t  is a probability factor that varies with the total current prize budget, such that P t  approaches zero as the cost of the selected prize approaches the maximum allowable prize amount, and P t  approaches 1 as the cost of the selected prize approaches zero.   P m  is a probability factor that varies with the ratio of the current prize budget to the total funds received by the system, such that P m  approaches one as the current prize budget approaches the maximum income received by the system and P m  approaches zero as the current prize budget approaches the maximum income received by the system minus the maximum allowable prize budget.   P u  is a probability factor that varies with the user&#39;s behavior within a session.   
               
         
             Preferably 
           
         
       
     
         [0000]    
       
         
           
             
               P 
                
               
                   
               
                
               a 
             
             = 
             
               
                 1 
                 - 
                 
                   
                     
                       A 
                       p 
                     
                     
                       
                         ∑ 
                         
                           i 
                           - 
                           1 
                         
                         n 
                       
                        
                       
                           
                       
                        
                       Ai 
                     
                   
                    
                   
                       
                   
                    
                   if 
                    
                   
                       
                   
                    
                   
                     A 
                     p 
                   
                 
               
               &lt; 
               
                 T 
                 * 
                 K 
                  
                 
                     
                 
                  
                 and 
                  
                 
                     
                 
                  
                 
                   P 
                   a 
                 
               
               &gt; 
               
                 W 
                  
                 
                     
                 
                  
                 min 
               
             
           
         
       
       
         
           
             
               P 
               a 
             
             = 
             
               W 
                
               
                   
               
                
               min 
             
           
         
       
       
         
           
             otherwise 
             where
           A p =cost of the selected prize   A i =cost of the i th  prize   
         
           
         
       
     
         [0000]    
       
         
           
             
               
                 ∑ 
                 
                   i 
                   - 
                   1 
                 
                 n 
               
                
               
                   
               
                
               Ai 
             
             = 
             
               total 
                
               
                   
               
                
               cost 
                
               
                   
               
                
               of 
                
               
                   
               
                
               all 
                
               
                   
               
                
               prizes 
                
               
                   
               
                
               in 
                
               
                   
               
                
               database 
             
           
         
       
       
         
           
             
               
                 W min =minimum probability of winning
               and preferably   
             
               
             
           
         
       
     
         [0000]    
       
         
           
             Pt 
             = 
             
               
                 
                   
                     
                       T 
                       * 
                       K 
                     
                     - 
                     Ap 
                   
                   
                     T 
                     * 
                     K 
                   
                 
                  
                 
                     
                 
                  
                 if 
                  
                 
                     
                 
                  
                 
                   P 
                   t 
                 
               
               &gt; 
               
                 
                   W 
                   min 
                 
                  
                 
                     
                 
                  
                 where 
                  
                 
                     
                 
                  
                 
                   A 
                   p 
                 
               
               &lt; 
               
                 T 
                 * 
                 K 
               
             
           
         
       
       
         
           and 
         
       
       
         
           
             
               P 
               t 
             
             = 
             
               W 
               min 
             
           
         
       
       
         
           
             
               
                 
                   
                     otherwise 
                     where
                   T=current prize budget   K=proportion of the current prize budget that may be awarded, 0&lt;K&lt;1   
                 
                   
                 
                 And where 
               
             
           
         
       
     
         [0000]    
       
         
           
             
               P 
               m 
             
             = 
             
               
                 
                   
                     
                       T 
                       
                         T 
                         m 
                       
                     
                     + 
                     K 
                     - 
                     1 
                   
                   K 
                 
                  
                 
                     
                 
                  
                 if 
                  
                 
                     
                 
                  
                 
                   P 
                   m 
                 
               
               &gt; 
               
                 
                   W 
                   min 
                 
                  
                 
                     
                 
                  
                 where 
                  
                 
                     
                 
                  
                 T 
               
               &lt; 
               Tm 
             
           
         
       
       
         
           and 
         
       
       
         
           
             
               P 
               m 
             
             = 
             
               W 
               min 
             
           
         
       
       
         
           
             
               
                 otherwise 
                 where
               T m =maximum prize budget to date.   
             
                 And preferably 
               
             
           
         
       
     
         [0000]        P   u =P u1   *P   u2   *P   u3              Where             
         [0000]    
       
         
           
             
               P 
               
                 u 
                  
                 
                     
                 
                  
                 1 
               
             
             = 
             
               
                 P 
                 0 
               
               * 
               
                 ( 
                 
                   
                     1 
                     - 
                     
                       
                         P 
                         
                           0 
                           ) 
                         
                       
                        
                       
                         
 
                       
                        
                       
                         P 
                         0 
                       
                     
                   
                   = 
                   
                     
                       
                         
                           
                             P 
                             a 
                           
                           * 
                           
                             P 
                             t 
                           
                           * 
                           
                             P 
                             m 
                           
                         
                         N 
                       
                        
                       
                         
 
                       
                        
                       
                         P 
                         
                           u 
                            
                           
                               
                           
                            
                           2 
                         
                       
                     
                     = 
                     
                       
                         
                           N 
                            
                           
                               
                           
                            
                           max 
                         
                         + 
                         
                           N 
                            
                           
                               
                           
                            
                           min 
                         
                         - 
                         Nc 
                       
                       
                         N 
                          
                         
                             
                         
                          
                         max 
                       
                     
                   
                 
               
             
           
         
       
       
         
           
             
               
                 N max=maximum number of spinning digits 
                 N min=minimum number of spinning digits 
                 Nc=current number of spinning digits 
               
             
           
         
       
     
         [0000]        P   u3 =1 −e   −E/Ap              where   E=the total advertising earnings derived from the user during this session.             
         [0096]    When the Win-It button  1004  is selected, the Jscript/Java Game logic invokes the odds management component  107 , which calculates a pseudo-random event trial having probability of returning true equal to the calculated probability of winning P. If the pseudo-random event trial returns true, the odds management component  107  causes a winning display to be presented to the user. Otherwise, the odds management component  107  causes a losing display to be displayed to the user. 
         [0097]    The probability of winning is preferably independent of the outcome number and PIN. The outcome of the trial determines whether a winning display or a losing display is presented to the user. Preferably, a different outcome number is presented after each trial. Preferably, losing outcome numbers are selected using a pseudo-random number generator having an output distribution that is independent of and differently distributed from the pseudo-random outcomes used to perform random trials. 
         [0098]    Before each trial, the user may be given an opportunity to increase their odds of winning For example, the user may be asked to complete a brief consumer survey, visit an advertiser&#39;s web site, or voluntarily perform some other similar task for which the system is compensated by third-parties. A portion of this revenue is allocated to the prize budget, and the odds management component  107  increases the user&#39;s probability of winning in response. For example, the user may be presented with the opportunity to increase the user&#39;s odds of winning by completing a survey using survey interface. 
         [0099]    Alternatively, or in addition, such opportunities are presented to the user at random intervals in response to the user&#39;s selection of the “play again” button  902 . A first such opportunity is illustrated in  FIG. 10 . By selecting sponsor link  9102 , the sponsor&#39;s web site is displayed in a frame in the user&#39;s browser. In return for directing the user to the sponsor&#39;s web site, the system receives revenue from the sponsor. A portion of the revenue received is allocated to the prize budget, and the odds management component  107  increases the user&#39;s probability of winning in response. 
         [0100]    An increased probability of winning is reflected in the display by “locking in” a digit of the outcome number to match the user&#39;s PIN as shown in  FIG. 11 . The “locked in” status of digit  9301  is signified by a different background display color. The game may be played using the display shown in  FIG. 11  as described above in connection with  FIG. 10 . However, outcome numbers are selected from a reduced range, and the “locked in” digit of the outcome number is not varied. As before, the user&#39;s probability of winning is preferably varied independently of the selection of outcome numbers. The “locked in” digit thus signifies that the user&#39;s probability of winning has increased, but not the magnitude of the increase. As a user&#39;s probability of winning increases, for example, through continued play, multiple digits may be “locked in” to signify the increased probability of winning. 
         [0101]    In a preferred aspect of the present invention, the odds management component  107  may award an unsuccessful user a consolation prize. Preferably, the odds management component  107  determines to award a consolation prize based on the frequency of visits, participation in odds-increasing opportunities presented, and demographic information stored in the user&#39;s profile. The type of consolation prize may be selected based on preferences determined from the user&#39;s profile. Preferably, the odds management component  107  awards a consolation prize after threshold number of attempts to win has been exceeded and the user has generated more revenue for the system than the cost of the consolation prize and its associated expenses. 
         [0102]    It should be understood that this invention is not limited to the disclosed features and other similar method and system may be utilized without departing from the spirit and the scope of the invention. 
         [0103]    While the invention has been described with reference to the preferred embodiment and alternative embodiments, which embodiments have been set forth in considerable detail for the purposes of making a complete disclosure of the invention, such embodiments are merely exemplary and are not intended to be limiting or represent an exhaustive enumeration of all aspects of the invention. The scope of the invention, therefore, shall be defined solely by the following claims. Further, it will be apparent to those of skill in the art that numerous changes may be made in such details without departing from the spirit and the principles of the invention. It should be appreciated that the invention is capable of being embodied in other forms without departing from its essential characteristics.