US 6,960,135 B2Grant
Payout distributions for games of chance
Issue Date:2005-11-01
•25 Claims
•6 Drawing Sheets
Abstract
Based on a metric that represents a value of a game of chance, a payout distribution is optimized with respect to the metric.
Metadata
Assignee
- ProfitLogic, Inc.
Inventors
- Peter Gaidarev
- Jonathan W. Woo
Application Information
Application Number:US 10/005,217
Filing Date:2001-12-05
Priority Date:2001-12-05
Art Unit:3713
Patent Drawings (6 sheets)
Description
Background
[0001] This invention relates to payout distributions for games of chance.
[0002] In a typical game of chance, a player plays the game repeatedly. For each play, he places something of value at risk and receives either no payout or a payout of value. The payout of value can be in any form. Some examples are coins, tokens, credits, or tickets. Each play can result in different levels of payout (for example, payouts at levels of $0, $10, $20, and $100) and each payout level has a probability. For example, each play may have a probability of 5% of producing a payout at the $100 level, a probability of 20% of a $20 payout, 20% for a $10 payout, and 55% for a payout of $0.
[0003] The different levels of payout and the probability of each payout level occurring on a given play is called the payout distribution. In some games, such as some card games, the payout distribution is determined by the rules of the game. In other games, such as typical mechanized games of chance (e.g., slot machines), the manufacturer or operator of the game (which we will call the house) can set the payout distribution (in the case of slot machines, the frequencies and payouts are expressed on a so called “par sheet.”).
[0004] For example, if a slot machine has 30,000 possible reel positions, there are 30,000 equally possible outcomes for each play. Of these outcomes, a certain number are set to result in a particular payout amount. If 1800 of the possible outcomes are set to produce a payout of 5 coins, a player will win 5 coins in 6% of his plays. If 900 of the possible outcomes are set to produce a payout of 10 coins, a player will win 10 coins in 3% of his plays. The sum of the percentages for all of the possible non-zero payouts is called the hit rate.
[0005] The house typically offers multiple units of the game (e.g., rooms full of slot machines) to large numbers of players. The payout distribution to the players determines both the house hold (the average fraction of the payer's at-risk value which the house retains as gross profit) and the quality of the experience for players of the game.
[0006] Games having the same hold can produce widely different experiences for players.
[0007] For instance, consider two games which both have a hold of 10% and which require the player to risk one dollar to play. Suppose one game produces only a single $1,000,000 payout on average every 1.1 million plays and the other produces a single $10 payout on average every 11.1 plays. From the point of view of the house, these games are essentially the same in that the long-term hold is 10% of money that players put at risk.
[0008] However, the players of the two games have much different experiences.
[0009] The first game can provide the thrill of a potential million-dollar windfall, but very few people ever experience it. The second game provides a much more modest payout, but the payout is still ten times the price of a single play, and anyone can experience it if he is moderately persistent in playing. If each game is played once every ten seconds 24 hours per day, the first game produces an average of only 2.9 winners per year while the second game produces an average of 864 winners per day.
[0010] The gaming industry often characterizes games by their hold, their hit rate (the frequency with which a player wins a payout of any amount), and their volatility (the expected volatility in the percentage of hold as a function of the number of plays).
Summary
[0011] In general, in one aspect, the invention features a method in which, based on a metric that represents a value of a game of chance, a payout distribution is optimized with respect to the metric.
[0012] Implementations of the invention may include one or more of the following features. The metric represents a quality of a player experience. The metric evaluates payouts for successive plays of the game, or the quality of experience for average players who receive more frequent payouts, or a fraction of players experiencing payouts in a succession of plays. The metric is chosen based on characteristics of particular player populations. The characteristic includes at least one of (a) location of game played, (b) time of day played, (c) amounts put at risk, and (d) identity of games played. The payout distribution includes a number of the payout levels, a frequency of payouts, or levels of payouts. The optimizing includes simulating a number of players. Different termination rules are applied for respective groups of the players, each of the termination rules defining when play of each of the players in the group will terminate. At least one of the termination rules provides for termination when a player has reached a predefined number of plays or when a player has experienced a predefined number of plays with no payouts. The metric includes the aggregate payout among all of the players or the aggregate number of plays of all of the players. The number of players is based on the frequency of payouts or on a specified accuracy to be achieved in the optimizing. The optimizing includes generating simulations of player experiences. The number of plays is based on the occurrence of a length of time elapsed during play. The number of plays is based on the depletion of an initial budget. The optimizing applies a genetic algorithm to the player experiences. The optimizing is based on predefined constraints. The constraints are associated with amounts of house hold. Other advantages and features will become apparent from the following description and from the claims.
Description
[0013] FIGS. 1 through 4 are graphs.
[0014] FIG. 5 is a block diagram.
[0015] As shown in FIG. 5 , an optimization system 10 can be used to generate an optimized payout distribution 12 for a game of chance (defined by game rules 14) with respect to a user-specified design goal 16, without violating user-specified constraints 18. (By user, we are not referring to the player of the game but rather to the party that, for example, designs or configures the game.)
[0016] The design goal 16 could be to optimize (e.g., maximize) the payout distribution by determining the payout distribution that produces the highest value of a metric or combination of metrics 20 subject to meeting the contraints 18, for example, a minimum hold, a number of payout levels, or a minimum hit rate.
[0017] The optimization system 10 includes a simulation process 30 for simulating sequences of plays experienced by each of a number of players of the game. Such a sequence would, for a given player, represent the number of plays and the payout for each play, for example. Each sequence can be considered a player experience for the corresponding player. The simulation uses a pseudo-random number generator 34 to simulate the experiences of a large number of players.
Metrics
[0018] A wide range of different metrics can be used to represent the quality of a player experience. For example, the metric may represent the quality of the experience for an average player rather than the quality of experience for exceptional players who win rare payouts. The metrics may also include more than a final change in wealth experienced by the average player. They may also include events along the way that lend an enjoyable aspect to what the player should know is a losing game. Among the many possible metrics for player experience is the fraction of players experiencing winning “streaks” during their play. Furthermore, the appropriate metric will be different for different player populations who play at different games, locations, and times of day or who put different amounts of money at risk. These variations can also be considered in the optimization process. A player might be offered the option of different types of games (even within the same machine) that have been labeled in such a way that the player can select the game that provides the experience that he or she is seeking.
Termination Rules
[0019] The computation of metrics may take account of termination rules 33 that determine the conditions under which players quit playing the game. Different termination rules reflect different playing behaviors or different experiences being sought by players. For example, some players quit after a set number of plays or after a set number of plays with no payouts. Others do not quit until they have run out of money. The different rules mandate different payout distributions no matter which metric is being optimized. The simulation corresponding to a player's experience is continued for a number of plays until terminated according to a rule that is part of the metric. Such rules might be based, for example, on the payout experience (e.g., quit after no payouts in 20 plays) or time (e.g., quit after two hours) or money (e.g., quit when the budget is exhausted), or on more complicated combinations of these and other factors.
Number of Players Simulated
[0020] The number of players simulated depends on the frequency of the events, that is, the payouts upon which the metric is based, and on the desired accuracy of the result. For instance, if the metric is the number of players experiencing a rare payout, many simulations are required to measure the metric accurately. A smaller number of simulated players may be used for frequent events. The number of players being simulated may be varied from smaller numbers early in the process to larger numbers later as the optimizer (described below) gets closer to an optimal solution.
Optimizer
[0021] An optimizer 32 optimizes the payout distribution 12 to achieve the best value of one or more metrics and consistent with the constraints 18. In some implementations, the optimizer performs the optimization using a genetic algorithm (GA) 36 because of its good general convergence properties. Other algorithms may yield shorter computation times depending on the metric employed. The GA uses a vector to represent the payout distribution and adjusts that vector to optimize the metric while assuring that all proposed solutions of payout distributions are consistent with the constraints 18 imposed by the user.
[0022] The interplay between constraints and metrics can comply with a wide variety of design requirements. One could, for instance, require a specific hold and maximize a particular metric of the quality of player experience metric (as represented by the simulation) or conversely maximize the hold while maintaining any metric or set of metrics at a given level.
[0023] The system of FIG. 5 can be implemented using software, hardware, firmware, or some combination of them.
Slot Machine Example
[0024] An example of a practical application is the optimization of a slot machine.
[0025] One metric for a slot machine is the fraction of players experiencing at least a specified level of wealth at least at one point during the player experience. The level of wealth is expressed as a percentage of an initial budget (the amount of money that a given player is initially willing to put at risk). This metric assumes that players derive entertainment value from being ahead of the house (by some amount) at some point during their period of play even though they will lose some or all of that money in the end.
[0026] In a specific case, assume that each of 100,000 players begins with a budget of 1000 coins, plays two coins each time in each play, and quits after losing 1000 coins or playing 720 plays, whichever comes first.
[0027] Suppose that the user is interested in modifying an existing machine to operate according to a par sheet that has the same number of payouts as the existing machine while requiring the hold to increase from 5% to 6.5%.
[0028] The optimization system optimizes the payout distribution based on a set of simulated player experiences generated by the simulation process 30, each of them satisfying the constraints 18. The simulation process measures the quality of each player experience using the metric. The optimizer then optimizes the payout distribution to maximize the value of the metric.
[0029] In this example, we first show the result when the user wants to maximize the proportion of players who have, at some point during their period of play, accumulated at least 10% more than their initial stake (the budget). The accumulation of at least 10% more wealth is the metric. What is being optimized is the proportion of players who achieve at least that wealth.
[0030] In FIG. 1 , the curve 50 marked with x's represents the cumulative numbers of players (arrayed along the y-axis) who achieve specific wealth levels (arrayed along the x-axis) at some point during play using the original machine. For example, point 52 represents 40,000 players each achieving a wealth of at least 1150 coins at some point during play. The curve demonstrates that almost no players would achieve a wealth of at least 3000 coins while all 100,000 players would achieve a wealth of 1000 coins or more (which they must given than they all start with 1000 coins).
[0031] In FIG. 2 , the shaded bars represent the cumulative distribution of maximum wealth as a function of the percentage of the maximum wealth above the initial budget. For example, bar 60 represents the 43% of the players who at some point during their play achieve a maximum wealth of 1100 coins, 10% over the initial budget.
[0032] The bulleted curve 54 in FIG. 1 and the unshaded bars in FIG. 2 represent similar information for a modification of the machine intended to achieve better player experience compared to the original machine by optimization of a metric of player experience.
[0033] As shown, the cumulative distribution of maximum wealth has been adjusted to increase the proportion of players who achieve relatively smaller maximum wealths while reducing the proportion of players who achieve relatively very large maximum wealths.
[0034] For example, the bar 62 on FIG. 2 represents the fact that, in the optimized game, 71% of the players will achieve a wealth of 1100 coins, a much higher percentage than for the original machine.
[0035] In FIGS. 3 and 4 , the user has optimized the par sheet to maximize the fraction of players experiencing at least a 60% surplus over their initial stake. The result is even more different than in the original machine curves of FIGS. 1 and 2 in that more than seven times as many players have that experience than for the initial game (as seen by the points on the two curves at the 1600 coin level represented by vertical line 70 on FIG. 3).
[0036] In both of these examples, the hold was also increased from 5.0% to 6.5%, illustrating that it is possible to improve the players' experiences while achieving greater revenue for the house.
[0037] The metric given in the example may not actually be the best metric to use for designing a slot machine payout distribution because it may not effectively characterize the entertainment value that players receive from playing slot machines. Better metrics could be determined based on research in gambling behavior. Whatever metrics are deemed useful can be applied in the optimization method discussed above to design useful games.
[0038] Other implementations are within the scope of the following claims.
[0039] For example, for almost any metric that can be developed, it is possible to increase the value of the player experience while maintaining or increasing the hold. Furthermore, different metrics can and should be used to optimize the experience for different players based on the places, times, and types of machines they play as well as the amount of money they put at risk.
Claims
1. A method comprising
A. simulating sequences of plays experienced by each of one or more simulated players of a game of chance,
B. measuring an experience of each of said one or more simulated players using a metric that represents a value of the game of chance,
C. optimizing a payout distribution of the game of chance with respect to the metric.
2. The method of claim 1 in which the metric represents a quality of a player experience.
3. The method of claim 1 in which the metric evaluates payouts for successive plays of the game.
4. The method of claim 1 in which the metric evaluates a quality of experience for average players who receive more frequent payouts.
5. The method of claim 1 in which the metric evaluates a fraction of players experiencing payouts in a succession of plays.
6. The method of claim 1 in which the metric is chosen based on characteristics of particular player populations.
7. The method of claim 6 in which the characteristic comprises at least one of location of game played, time of day played, amounts put at risk, and identity of games played.
8. The method of claim 1 in which the payout distribution comprises a number of the payout levels.
9. The method of claim 1 in which the payout distribution comprises a frequency of payouts.
10. The method of claim 1 in which the payout distribution comprises levels of payouts.
11. The method of claim 1 wherein step (A) includes terminating simulating the sequences of plays of each respective simulated player in accord with rules that take into account conditions under which a corresponding player being simulated will quit playing the game of chance.
12. The method of claim 11 in which at least one of the termination rules provides for termination when a simulated player has reached a predefined number of plays.
13. The method of claim 11 in which at least one of the termination rules provides for termination when a simulated player has experienced a predefined number of plays with no payouts.
14. The method of claim 11 in which the metric comprises the aggregate payout among all of the players.
15. The method of claim 11 in which the metric comprises an aggregate number of plays of all of the simulated players for which sequences of plays are simulated in step (A).
16. The method of claim 11 in which a number of simulated players for which sequences of plays are simulated in step (A) is based on the frequency of payouts.
17. The method of claim 11 in which a number of simulated players for which sequences of plays are simulated in step (A) is based on a specified accuracy to be achieved in the optimizing.
18. The method of claim 1 in which each of the simulations of sequences is terminated after a number of plays.
19. The method of claim 18 in which the number of plays is based on the occurrence of a sequence of plays without payouts.
20. The method of claim 18 in which the number of plays is based on the occurrence of a length of time elapsed during play.
21. The method of claim 18 which the number of plays is based on the depletion of an initial budget.
22. The method of claim 1 in which step (C) includes performing the optimizing by applying a genetic algorithm to the sequences of plays.
23. The method of claim 1 in which step (C) includes optimizing the payout distribution subject to one or more constraints.
24. The method of claim 23 in which one or more of the constraints are associated with amounts of house hold associated with the game of chance.
25. A medium bearing instructions capable of enabling a machine to optimize a payout distribution for a game of chance, where that payout distribution is optimized according to a process including the steps of:
A. simulating sequences of plays experienced by each of one or more simulated players of the game of chance,
B. measuring an experience of each of said one or more simulated players using a metric that represents a value of the game of chance,
C. optimizing the payout distribution of the game of chance with respect to the metric.
Patent Citations (47)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5237496(A) | 1993-08-01 | Kagami et al. | Applicant |
| US5237498(A) | 1993-08-01 | Tenma et al. | Applicant |
| US5450314(A) | 1995-09-01 | Kagami et al. | Applicant |
| US5758328(A) | 1998-05-01 | Giovannoli | Applicant |
| US5765143(A) | 1998-06-01 | Sheldon et al. | Applicant |
| US5822736(A) | 1998-10-01 | Hartman et al. | Applicant |
| US5933813(A) | 1999-08-01 | Teicher et al. | Applicant |
| US5963919(A) | 1999-10-01 | Brinkley et al. | Applicant |
| US5974396(A) | 1999-10-01 | Anderson et al. | Applicant |
| US5983224(A) | 1999-11-01 | Singh et al. | Applicant |
| US5987425(A) | 1999-11-01 | Hartman et al. | Applicant |
| US6006196(A) | 1999-12-01 | Feigin et al. | Applicant |
| US6009407(A) | 1999-12-01 | Garg | Applicant |
| US6029139(A) | 2000-02-01 | Cunningham et al. | Applicant |
| US6061691(A) | 2000-05-01 | Fox | Applicant |
| US6092049(A) | 2000-07-01 | Chislenko et al. | Applicant |
| US6151582(A) | 2000-11-01 | Huang et al. | Applicant |
| US6205431(B1) | 2001-03-01 | Willemain et al. | Applicant |
| US6230150(B1) | 2001-05-01 | Walker et al. | Applicant |
| US6253187(B1) | 2001-06-01 | Fox | Applicant |
| US6293866(B1) | 2001-09-01 | Walker et al. | Examiner |
| US6306038(B1) | 2001-10-01 | Graves et al. | Examiner |
| US6308162(B1) | 2001-10-01 | Ouimet et al. | Applicant |
| US6328648(B1) | 2001-12-01 | Walker et al. | Examiner |
| US6331144(B1) | 2001-12-01 | Walker et al. | Examiner |
| US6341269(B1) | 2002-01-01 | Dulaney et al. | Applicant |
| US6366890(B1) | 2002-04-01 | Usrey | Applicant |
| US6397166(B1) | 2002-05-01 | Leung et al. | Applicant |
| US6397197(B1) | 2002-05-01 | Gindlesperger | Applicant |
| US6493678(B1) | 2002-12-01 | Foster et al. | Applicant |
| US6496834(B1) | 2002-12-01 | Cereghini et al. | Applicant |
| US6520856(B1) | 2003-02-01 | Walker et al. | Examiner |
| US6553352(B2) | 2003-04-01 | Delurgio et al. | Applicant |
| US2001/0014868(A1) | 2001-08-01 | Herz et al. | Applicant |
| US2001/0044766(A1) | 2001-11-01 | Keyes | Applicant |
| US2001/0047293(A1) | 2001-11-01 | Waller et al. | Applicant |
| US2002/0022985(A1) | 2002-02-01 | Guidice et al. | Applicant |
| US2002/0029176(A1) | 2002-03-01 | Carlson et al. | Applicant |
| US2002/0072977(A1) | 2002-06-01 | Hoblit et al. | Applicant |
| US2002/0174119(A1) | 2002-11-01 | Kummamuru et al. | Applicant |
| US2003/0028437(A1) | 2003-02-01 | Grant et al. | Applicant |
| US2003/0046127(A1) | 2003-03-01 | Crowe et al. | Applicant |
| EP1271278(A2) | 2003-02-01 | Applicant | |
| JP200184239(A) | 2001-03-01 | Applicant | |
| WO90/09638(A1) | 1990-08-01 | Applicant | |
| WO98/21907 | 1998-05-01 | Applicant | |
| WO2/29696(A1) | 2002-04-01 | Applicant |
Non-Patent Literature (29)
- “Fair Market to Take the Guesswork Out of Sale Pricing With New Performance-Based Markdown Engine: Major Step in Online Selling to Help Merchants Maximize Margin,” Business Wire, May 21, 2001 (3 pages).Applicant
- Screenshots of www.grossprofit.com.Applicant
- “Merchants Try Complex Math Tools to Improve Inventory Decisions,” by Koloszyc from Stores Magazine.Applicant
- Ackerman, Jerry, “Looking Back to Fashion's Future,” The Boston Globe Oct. 7, 1998 [retrieved Jan. 7, 2003], 3 pages, retrieved from: archive.org and Google.com.Applicant
- Agrawal, Rakesh et al. “Fast Similarity Search in the Presence of Noice, Scaling, and Translation in Time-Series Databases,” Proceedings of the 21st Internaitonal Conference on Very Large Data Bases Sep. 11-15, 1995.Applicant
- Datz, Todd, “Pythagorean Pantsuits-Modeling Merchandise,” CIO Magazine, Feb. 15, 1999 [retrieved Jan. 7, 2003], 1 page, retrieved from Google.com and archive.org.Applicant
- Gaffney, Scott and Padhraic Smyth, “Trajectory Clustering with Mixtures of Regression Models,” Proceedings: The Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining Aug. 15-18, 1999, pp. 63-72.Applicant
- “Gymboree Selects TSI to Design and Implement Inventory Optimization and Pricing Solution,” TSI Press Release, Jan. 13, 1999 [retrieved Jan. 7, 2003], 2 pages, retrieved from: Google.com and archive.com.Applicant
- Jain, Anil K. and Richard C. Dubes, Algorithms for Clustering Data (Prentice Hall: 1988) pp. ix-xi, 1-30.Applicant
- Keogh, Eamonn and Padhraic Smyth, “A Probabilistic Approach to Fast Pattern Matching in Time Series Databases,” Proceedings of the Third Conference in Knowledge Discovery in Databases and Data Mining (1997).Applicant
- Keogh, Eamonn J. and Michael J. Pazzani, “An Enhanced Representation of Time Series Which Allows Fast and Accurate Classification, Clustering and Relevance Feedback,” Fourth Conference on Knowledge Discovery in Databases and Data Mining (1998) pp. 239-243.Applicant
- Keogh, Eamonn J. and Michael J. Pazzani, “Relevance Feedback Retrieval of Time Series Data,” 22nd International Conference on Research and Development in Information Retrieval, Aug. 1999.Applicant
- Keogh, Eamonn, “A Fast and Robust Method for Pattern Matching in Time Series Databases,” Proceedings of WUSS (1997).Applicant
- Koloszyc, Ginger, “Merchants Try Complex Mathematical Tools to Improve Inventory Decisions,” Stores Magazine Nov. 1999 [retrieed Jan. 7, 2003], 3 pages, retrieved from: Google.com and archive.org.Applicant
- Kopalle, Praveen K. et al. “The Dynamic Effect of Discounting on Sales: Empirical Analysis and Normative Pricing Implications,” Marketing Science 18:3 (1999) 317-332.Applicant
- Levy, Michael R. and Woo, Jonathan, Ph.D. “Yield Management in Retail: The Application of Advanced Mathematics to the Retail Pricing Dilemma,” TSI (Marketing Materials), 1999.Applicant
- Makridakis, Spyros, “Forecasting,” copyright 1997, John Wiley & Sons, Inc., pp. 312, 373-374.Applicant
- Merritt, Jennifer, “Company makes Science out of Shopping Trends,” Boston Business Journal Sep. 3, 1998 [retrieved on Jan. 7, 2003], 3 pages, retrieved from: Google.com and archive.org.Applicant
- Rice, John A. “Mathematical Statistics and Data Analysis,” 2nd Ed. Duxbury Press pp. xiii-xx, 1-30.Applicant
- Screenshots of Technology Strategy, Inc., www.grossprofit.com, Mar. 2, 2000 [retrieved on Jan. 7, 2003], 9 pages, retrieved from: Google.com and archive.org.Applicant
- Silva-Risso, Jorge M. et al. “A Decision Support System for Planning Manufacturers' Sales Promotion Calendars,” Marketing Science 18:3 (1999) 274-300.Applicant
- Smith, Stephen A. and Achabal, Dale D. “Clearance Pricing and Inventory Policies for Retail Chains,” Management Science 44:3 (Mar. 1998), pp. 285-300.Applicant
- “Special Feature: Alliances of Accenture: Accenture, Profitlogic team helps retailers enhance sales,” Businessworld (Feb. 5, 2001).Applicant
- Technology Strategy, Inc., company marketing materials, copyright 1991, Technology Strategy, Inc.Applicant
- Technology Strategy, Inc., company marketing materials, copyright 1998, Technology Strategy, Inc.Applicant
- “Technology Strategy, Inc. Names Jonathan Woo as Director of R&D,” TSI Press Release, Jul. 15, 1998 [retrieved Jan. 7, 2003], 1 pages, retrieved from: Google.com and archive.org.Applicant
- “Wal-mart: Retailer of the Century: High-Tech Complements Human Touch,” Discount Store News Oct. 11, 1999 [retrieved Jun. 26, 2002], 3 pages, retrieved from: www.lexus.com.Applicant
- Wang, Qinan and Wu, Zhang, “Improving a supplier's quantity discount gain from many different buyers,” IIE Transactions vol. 32 (2000) 1071-1079.Applicant
- Achabal et al., A Decision Support System for Vendor Managed Inventory, Winter 2000, Journal of Retailing, vol. 76, No. 4, p. 430.Applicant