Method of and system for conducting multiple contests of skill with a single performance

Information

  • Patent Grant
  • 11951402
  • Patent Number
    11,951,402
  • Date Filed
    Friday, April 8, 2022
    2 years ago
  • Date Issued
    Tuesday, April 9, 2024
    7 months ago
Abstract
A method of and system for conducting multiple competitions of skill for a single performance are described herein. User generated competition groups and system generated competition groups allow users to participate in multiple competitions at once based on answering the same questions or making the same selections related to a single event. The users are informed of each competition either via email, text message or when logging into the network via a website. The users select which competitions groups to join. After joining the desired groups, the users then make their selections related to the event which are transmitted to the network where results are tabulated and transmitted back to the users. The results are separated based on each competition group, so that users can continually know where they stand in each separate competition. With multiple competition groups, users are able to have varying success from the same performance in multiple competitions.
Description
FIELD OF THE INVENTION

The present invention relates to the field of distributed gaming. More specifically, the present invention relates to the field of distributed gaming utilizing a mobile device.


BACKGROUND OF THE INVENTION

In the United States alone there are over 170 million registered cellular phones. With the expiration of the U.S. Pat. No. 4,592,546 to Fascenda and Lockton, companies are able to now use the cellular phone and other mobile communication devices utilizing a multicast network to control television viewers in games of skill based upon predicting, for example, what the quarterback may call on the next play within a football game. In addition, games of skill with a common start time can be conducted simultaneously among cellular phone owners, based on classic card, dice, trivia, and other games. In order to avoid the anti-gaming laws in the various states, the winners must be determined by the relative skill, experience and practice of the player in each discrete game.


U.S. Pat. No. 5,813,913 ('913) to Berner and Lockton provides for a central computing system which includes a means of grouping participants having similar skill levels together in simultaneous, but separate, levels of competition playing an identical game. The relative performances are communicated to only those participants competing at the same skill level. The '913 patent also provides for a wireless receiving device to permanently store the specific skill level for each participant for each type of common event such as those based on televised sports or game shows. The '913 patent provides for a telephonic link at the completion of the game to collect information and update the skill level of the participants of a particular game. When a person achieves sufficient points or meets other objective criteria to graduate into another skill level, a method is provided for accomplishing this in the central computer and then transmitting an alert to the participant notifying them of their promotion. The '913 patent describes awarding prizes and providing recognition for the members of each discreet skill level in a common game. All users, no matter what level they are on, receive the same number of questions and thus the possibility of earning the same number of points. Thus direct comparisons between users at different levels, although not encouraged are possible. Such comparisons between players of disparate skills can lead to user discouragement.


Games of skill and chance have an intrinsic excitement and entertainment value. Any game is greatly enhanced by a participant's ability to know how their performance compares in relation to other participants and/or to historical performance for the game throughout the contest. As with any game of skill, competition among friends, or with strangers of similar experience, or the ability at ones option, sometimes for an extra consideration, to compete in a separate team or individual contest, offers the opportunity of increased enjoyment and prizes.


SUMMARY OF THE INVENTION

A method of and system for conducting multiple competitions of skill for a single performance are described herein. User generated competition groups and system generated competition groups allow users to participate in multiple competitions at once based on answering the same questions or making the same selections related to a single event. The users are informed of the availability of each competition either via email, text message or when logging into the network via a website. The users select which competitions groups to join. After joining the desired groups, the users then make their selections related to the event which are transmitted to the network where results are tabulated and transmitted back to the users. The results are separated for each competition group, so that users continually know where they stand in each separate competition. With multiple competition groups, users are able to have varying success from the same performance in multiple competitions.


In one aspect, a method of participating in multiple contests of skill corresponding to an event comprises receiving a list of competitive groups to join, selecting a plurality of competitive groups to join, participating with the plurality of competitive groups by sending selections related to the single event to a server and receiving standings on a device from the server, wherein the standings are based on results from the selections. The event is selected from the group consisting of a television-based sporting event, entertainment programming and a game show. Alternatively, the event comprises identical classic card, dice, trivia and word games played simultaneously. Receiving the standings on the device with the plurality of competitive groups occurs during the event. The results are separated based on the plurality of competitive groups. The standings are received periodically and represent performance in the competitive groups. The competitive groups are selected from the service provider generated competitive groups and/or user generated competitive groups. The service provider generated competitive groups are based on general playing characteristics. The list of competitive groups to join is received on the device selected from the user interface including a cellular phone, a laptop computer, a personal computer or a PDA. The competitive groups are maintained in a database. In some embodiments, the results include a handicap.


In another aspect, a method of conducting multiple contests of skill corresponding to an event comprises generating separate competitive groups related to the event, coupling to a network to participate in the competitive groups, informing a user which of the competitive groups are available for the user to join, joining a selected number of the competitive groups, participating with the competitive groups by sending selections related to the event to a server within the network, storing results and standings on the server, wherein the standings are based on the results and the results are based on the selections and transmitting the standings to a device. The method further comprises displaying the standings on the device. The server contains an application and a database for assisting in generating the competitive group. The application includes a graphical user interface. The device contains an application for assisting in generating the competitive group. Generating competitive groups related to the event further comprises coupling to the server, selecting a type of contest and additional conditions to be included in the competitive group, adding competitors to the competitive group and selecting the event for competition by the competitive group. The type of contest is selected from the group consisting of, for example, an open contest, a head-to-head contest and a team contest. Adding competitors to the competitive group includes identifying the competitors by an identifier selected from the group consisting of a username, an email address, a cellular phone number or other unique identifier. The method further comprises sending an invitation which informs the competitors of an opportunity to be included in the competitive group. The invitation is sent by a competitor or the service provider with a mechanism selected from the group consisting of an email, an SMS text message, a voice message or similar addressable communication. The event is selected from the group consisting of, for example, a television-based sporting event, entertainment programming and a game show. Alternatively, the event comprises identical classic card, dice, trivia and word games played simultaneously. Transmitting the standings with the competitive groups occurs during the event. The standings are separated for each of the competitive groups. The standings are received periodically and represent performance in the competitive groups. The competitive groups are selected from the service provider generated competitive groups and/or user generated competitive groups. The service provider generated competitive groups are based on general playing characteristics. The device is selected from the group consisting of a cellular phone, a laptop computer, a personal computer and a PDA. The competitive groups are maintained in a database. In some embodiments, the results include a handicap.


In another embodiment, a system for conducting multiple contests of skill corresponding to an event comprises a device and a server coupled to the device through a network for storing competitive groups, receiving selections related to the event, storing results and standings based on the selections and transmitting the standings to the device. The server is further for providing an interface for generating competitive groups related to the event. The device contains an application for generating the competitive groups related to the event. The event is selected from the group consisting of a television-based sporting event, entertainment programming and a game show. Alternatively, the event comprises classic card, dice, trivia and word games played simultaneously. The device communicates data for generating the competitive groups, for selecting the competitive groups to join and for submitting the selections. The network includes at least one of the Internet and a cellular network. The standings are transmitted periodically to the device and represent performance in the competitive groups. The standings are separated for each of the competitive groups. The network identifies the competitive groups a user is eligible for. The system further comprises a database stored on the server for managing the selections, the results, the standings and the competitive groups. The device is selected from the group consisting of a cellular phone, a laptop computer, a personal computer and a PDA. In some embodiments, the results include a handicap.


In yet another aspect, a network of devices for conducting multiple contests of skill corresponding to an event comprises a plurality of devices and a server within a network, wherein the server and the plurality of devices communicate to conduct the multiple contests of skill corresponding to the event. The plurality of devices are selected from the group consisting of cellular phones, laptop computers, personal computers and PDAs.


In another aspect, a server device for conducting multiple contests of skill corresponding to an event comprises a storage mechanism and an application for interacting with the storage mechanism and a communicating device to generate and store competitive groups which are used to compete in the multiple contests of skill. The storage mechanism is a database. The communicating device is selected from the group consisting of a cellular phone, a laptop computer, a personal computer and a PDA. Interacting with the storage mechanism and the communicating device further includes receiving selections and transmitting standings.


In yet another aspect, a device for participating in multiple contests of skill corresponding to a single event comprises a communications module for coupling to a server and an application for utilizing the communications module for coupling to a server to communicate with the server to generate competitive groups which are used to compete in the multiple contests of skill. The application utilizes the communications module for coupling to the server to send selections to and receive standings from the server.


In yet another aspect, a device for participating in multiple simultaneous contests of skill corresponding to a single event comprises a storage module and an application stored within the storage module for simultaneously starting the multiple contests of skill and simultaneously scoring the multiple contests of skill. The application is downloaded from a server.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates a flowchart of a process of utilizing the present invention.



FIG. 2 illustrates a flowchart of a process of generating a user generated competition group.



FIG. 3 illustrates a graphical representation of an embodiment of the present invention.



FIG. 4 illustrates a graphical representation of a network of devices.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

A method and system for conducting a variety of competitions simultaneously are described herein. The organization of competition in a game of skill has previously taken one of three basic formats:

    • 1) Open contests: where large numbers of players enter an event, and all of the entrants are competing against each other for a single prize pool.
    • 2) Head-to-head: where competitors are matched between a relatively small number of players identified to compete head-to-head against each other. The actual match making occurs in many forms, such as match play or elimination tournaments.
    • 3) Team competitions: where two or more people are teamed to compete in head-to-head elimination against other similar sized teams in match play or total score competitions.


The present invention is a system and method allowing participants to simultaneously compete in multiple contests based on a single performance. For example, a user is able to participate in an open contest, compete in a team competition, and also compete against a small group of friends all utilizing a score achieved in the same event.


As a comparison, in tournaments held for bowling or golf, players are able to compete simultaneously in a gross score tournament as well as a net (handicap) tournament with the same performance. However, the contestants in the gross and net competitions are identical. The focus of the present invention is on enabling the entry of an individual in separate competitions, with separate prizes based on their single performance (score), where the pool of entrants is different for each competition.


The default mechanism for organizing a competition for this type of game in the past has been an open contest where all competitors are automatically entered in a contest against all other players. As taught in U.S. Pat. No. 5,813,913, incorporated herein by reference, the competitive field of players is also able to be divided into separate flights or groups according to skill and experience and only scores from other competitions at the same skill level are compared. Thousands of players are able to compete in a particular football game within a particular skill level. In some embodiments, game data includes a lockout signal to prevent improper game inputs by participants. For example, a central computer system broadcasts a lockout signal to prevent improper game inputs by participants.


For this example, Player A has been rated as an “intermediate” player and is competing against 10,000 other “intermediate” players in an interactive game of skill played with a live Monday Night Football broadcast. Prior to the telecast, Player A has arranged a side competition against four of his friends. Player B has organized through a match-making interface, a small competition which includes Players A, B, C, D and E. In this example, Players A and B are intermediate players, but Players C, D and E are novice players. Player B has also organized this small competition to require a $2.00 entry fee with a winner-takes-all rule. While none of the competitions require prizes or awards, they are allowable in games of skill.


When Player A logs on to a network supporting mobile games of skill, he is presented with the option of competing in the private separate contest that Player B set up. Player A agrees to compete with the $2.00 entry fee.


Separately, Player A has previously registered to participate in a sponsored season long team competition with coworkers F, G and H. The highest two scores of their four man team are totaled, and these points are added to the season's cumulative score with the highest team scores winning prizes. Thus, for a single football game, Player A is registered in: an open competition where the best competitors win prizes, a friendly competition for a prize pool of $10, and a season long team competition.


During the football game, Player A, like all of the other players, tries to get the best possible score by predicting the plays correctly before they happen. He plays in the same manner he would playing in the open contest alone, but his performance is in fact simultaneously separately scored in these completely different competitions against a different set of opponents for different rewards.


At the end of the event, Player A scored 12,565 points, in this example. That score was in the 92nd percentile among the 10,000 intermediate players, but not high enough to win an award in that contest. That same score of 12,565 was also compared against Players B, C, D and E, and was the highest score, so Player A won the separate competition of $10. At the same time, Player A's score was the second highest among his team members in the separate team competition, and therefore was one which was totaled for the season long team competition.


It is essential to the success and enjoyment of such an invention that a potential competitor have an easy method of registering and entering these separate competitions on an ad hoc or seasonal basis. In addition, it is important to the success of such a system that all of the competitors be able to monitor periodically, not only their ongoing standings in the overall open competition at their skill level, but they will be able to periodically review all the competitions they are entered into to see the current standings.


For each of these competitions, there are two ways the group of attendees are able to be formed: A) organized by the service provider and/or a commercial sponsor or B) organized by the users themselves. Examples of service provider generated groups include those based on competitive skill level and region. For example, all intermediate players for a specific football game. An example of a user generated group is identifying five friends for a football competition. As each player enters a particular event (e.g. Monday Night Football), they are informed of the competitions they are playing in (e.g. Intermediate Global competition, the California Bay Area competition, and the personal Group competition). Each group is able to have a generic name and/or a specific name such as “personal group competition 1” or “Bob's Competition.” When a player's phone or computing device establishes a connection with the network (e.g. the Airplay Network), the network identifies all of the groups that this player is able to compete in, and the server will upload this information to the phone over a cellular connection for display to the user. When a user couples to the network with a computing device other than a cellular phone, the information is available through the Internet. In some embodiments, participation in various group competitions involves additional fees. Users have the ability to choose not to compete in any or all of the groups they have been invited to.


There are two classes of Groups: System Generated Groups (e.g. Service Provider Groups) and User Generated Groups. System Generated Groups are generated by the service administrator based on database information about the user. Examples include Intermediate Skill Level and California Bay Area San Francisco 49ers Fans. User Generated Groups are defined by one or more members. A member is able to generate a group either from the services website or from a cellular phone interface. To generate a group, a member generates a name for the group or a generic name is assigned, and then the member adds other members to the group. The member is able to add other members to the group by their handle (unique identifier), email address (for new members) or by their cellular phone number. Groups are able to be assigned to a particular event. A group is able to be designated as an active group or a party. User group owners generate a party by associating the group to a particular event (e.g. December 12th Monday Night Football Game). In some embodiments, an email invitation or text message is sent to inform the members of the group that they have been invited to a party.


The game control server maintains a list of groups. Service Provider Groups are automatically assigned to events. User Groups are assigned to events by the group owners. In both cases, a list of active groups is known before the start of the event such as parties for a particular event. Within each of these known groups a list of all the participants is also maintained. This is able to be implemented in several ways. The most common way is via a database manager. This is able to be done through a data structure that is loaded for each event, and a database is one natural implementation to keep track of the group/participant relationships.


Throughout the game, a server manages the scores for every player. The scores are updated in a central location such as a database server, and are sorted with the members of a particular group to identify the rankings for each member in the competition.


During an event, scores and rankings are sent to members of the various groups. This is done after each scoring opportunity, or at a slower pace such as every five minutes or every five scoring opportunities. For small groups (e.g. 20 or less active participants) all of the scores and rankings are able to be sent by the server and displayed on the participant's device. For very large groups there are two approaches that can be taken: 1) Common message or 2) Individualized message. Sending a common message for large groups is much more efficient on the network, and is able to still provide a significant amount of information. The message is able to contain the top 20 names and scores for this group as well as the score that is required to be in the top 95%, 90%, 85%, . . . 5%. When the client receives this message, it determines what percentile the user is in by extrapolating its score between the percentile scores that the user is between. In sending an individual message for a large group, the server would still send the top 20 names and scores as well as the exact percentile that this user falls in.


Each separate tournament is managed effectively. A message is sent from the game server to the individual clients associated with each group. For very large groups, this message is able to be identical for all of those that are receiving the message. Past results tracked on the phone and in more detail on the website will track the rankings in each of the different groups associated with an event. A selection of pre-produced audio and visual comments, for example, in the nature of taunts and cheers are able to be selected from a menu and sent to a specific individual or to all competitors in the group.


Games of skill played on the Internet or cellular phones based upon live telecast sporting events or popular game shows are expected to attract a large number of potential competitors. As in all games of skill, there will be a wide variety of experience and talent and many motivations to play. To some, the enjoyment will be competing in open competitions against skilled players to test their medal. For others, it may be just the ability to compete and possibly win against a handful of close friends who share the same passion for the underlying televised event. Others may be more team oriented and derive more enjoyment from participating as a member of the group. The method and systems described herein provide not only the ability for an individual to find a group of competitors and a contest attractive to them, but also allows them to compete in multiple contests simultaneously with the identical performance and with the same investment of time. This increases not only the sense of community, but provides greater opportunities for the satisfaction of beating friends as well as winning prizes.



FIG. 1 illustrates a flowchart of a process of utilizing the present invention. In the step 100, competitive groups are generated related to events. The competitive groups are either system generated or user generated. As described above, a system generated group is generally based on skill level, location or another generic attribute that some users qualify for, while other users do not. A user generated group is selected by a user where participants are added to the group by entering a username, email address, cellular phone number, or another distinguishing identifier. User generated groups typically include groups of friends, co-workers and other groups of people that a user wants to compete with. Any number of system groups and user groups are able to be generated. In addition to determining who is included in the competition, the events being played within the competition are selected. For example, a user is able to set up a Monday Night Football league, wherein every Monday night for the regular season of the NFL, the users within the group compete based on the Monday night game. In some embodiments, the specific games that the users compete in are selected at later dates beyond the initial generation of the group.


In the step 102, users couple to a network (e.g. the Airplay Network) to participate in the generated competitions. In the step 104, the users are informed which competitions are available for participation. For example, an intermediate user couples to the network using his cellular phone and is greeted with a list of competitions available for him to join. The list includes, a free open competition for all intermediate players for a specified game, an individual group competition that his friend invited him to join also for the same specified game, a team competition that his co-workers wanted him to be a part of where it is a season long tournament which includes the same specified game and another system generated competition also for the same game that costs $10 to enter with larger prizes available than the free competition. In the step 106, each user who has coupled to the network joins the groups desired. Continuing with the example above, the user decides to join the free open competition, the friend's competition and the co-worker competition but does not join the $10 competition.


In the step 108, the users then participate in the competitions by sending user selections (e.g. predictions) to a server within the network for monitoring, analyzing and determining results based on the selections. Based on the results, standings for each competition are also determined. Using the example above again, although the user joined three different competitions related to a single game, the user competes exactly the same as if he entered in only one of the competitions, since his input is distributed for the three different competitions.


In the step 110, the results based on the users' selections are stored. The results are stored in a way such that they are easily retrieved for each competition. For example, a storing mechanism such as a database stores the results of Game X for Player A where Player A's score is 1000. In the free open competition, Player A's score was not good enough to win a prize. However, in the friendly competition, it was the highest score, and in the co-worker team competition it was a score usable by the team. Therefore, although the score was not a winning score for one competition, it was a beneficial score in the other two competitions. By competing in multiple competitions for the same game/event, a user's results/score could provide different outcomes depending on the competition. Therefore, the proper associations of each competition and the score are required.


In the step 112, each user receives the results and/or standings on his cellular phone or computer. The results and/or standings arrive at varying times depending on the setup of the system. The results and/or standings are received or at least accessible after the competition ends. If desired, the results and/or standings are also received throughout the competition such as every five minutes or after a certain number of selections are made. The standings from the results determine who wins at the end of the competition. While displayed during the game, the standings show what position the user is in. The standings are based on the results of the selections made by the users.



FIG. 2 illustrates a flowchart of a process of generating a user generated competition group. In the step 200, a user couples to a server within a network (e.g. the Airplay Network) storing an application to generate a competition group. In some embodiments, the application is stored on the user's cellular phone instead of or in addition to on the server. Preferably, the application provides a graphical user interface such as an interactive website for easily generating the competition group. In the step 202, the user selects the type of competition, such as open, head-to-head or team, in addition to other types of competitions. The user also adds any additional requirements or conditions such as intermediate players only or $2 entry fee with the winner-take-all. Additionally, the user labels or names the competition group. In the step 204, competitors are added to the competition. The competitors are added based on a username, phone number, email address or another identification mechanism. In the step 206, either at the initial set up of the competition group or later on, one or more events are selected to be competed in. For example, if a user wants to set up a competition specifically for Super Bowl XLI, he is able to designate that immediately. Or if a user wants to start a week-long competition related to Jeopardy, he is able to do that as well. The user is also able to retain the same group and modify it to generate a second competition. For example, after the Super Bowl XLI competition ends, the user is able to generate another competition with the same group for the NCAA BCS Bowl Championship Game. Users are able to generate as basic or as complex a competition group as desired. As described above, it is able to be for a single event, a variety of events or an entire season of events. Preferably, a database is utilized to organize the competition groups for easy correlation of data.



FIG. 3 illustrates a graphical representation of an embodiment of the present invention. A server 300 contains an application 302 and a storage mechanism 304. The application 302 is preferably a web application or at least has a web component to enable users to interact with a web graphical user interface to input data and review data. The storage mechanism 304 is utilized for storing selections and results from the selections as well as competition groups. The storage mechanism 304 preferably includes a database for organizing the data including the selections, results, standings and competition groups amongst other data needed for executing the competitions. The server 300 is part of a network 306. A device 308 couples to the server 300 through the network 306. In some embodiments the network 306 includes the Internet. In some embodiments, the network 306 includes a cellular network Also, in some embodiments, the network 306 includes both the Internet and a cellular network. The device 308 is selected from a cellular phone, a PDA, a computer, a laptop or any other device capable of communicating with the server 300. As described above, in some embodiments, an application for allowing users to generate competition groups, input selections and communicate with the server in general is included in the device 308 instead of or in addition to the application 302 on the server 300.



FIG. 4 illustrates a graphical representation of a network of devices. As described above, the server 300 contains the application 302 and the storage mechanism 304 for inputting and outputting data related to the competitions. The device 308, couples to the network through a network 306. As described above, the network includes either the Internet, a cellular network or both. Although the device 308 is able to be a device other than a cellular phone as shown, other devices are also shown coupled to the network 306 therefore forming a network of devices 400. The other devices include a laptop 310, a computer 312 and a PDA 314. One of the devices 308 is shown with an application 320 for enabling the user to generate competition groups and communicate with the server 300.


In some embodiments, handicaps are implemented so that users of different levels are able to compete more fairly. Handicaps provide additional points to users at lower levels so their score is comparable to a more advanced user. The handicaps are determined based on analysis of the scoring. For example, if advanced users on average score 3000, while intermediate users on average score 2000 and beginners on average score 1000 for the same set of questions, then a fair handicap is 1000 per difference in level. Thus, when there is a friendly competition between one user who is advanced by playing every week and three beginner users who play once a month just for fun, a straight game without handicaps is not likely going to be a close competition. However, if the beginner users are given help to put them on par with the advanced user, then the outcome of the competition could result in a beginner user winning.


In some embodiments, each user competes in the same game, but slightly different sets of questions/choices are posed based on the competition level. For example, an intermediate user chooses to play in an open intermediate competition and also with a group of beginner friends. Each of the beginner users is asked to choose what type of play the following play is going to be (e.g. Run or Pass). The intermediate user is also asked to choose the following play. However, the intermediate user is also asked to choose which direction the play will go (e.g. Left or Right). Therefore, the same game is being played to some extent, but there is a slight modification, so that more advanced users have additional options. However, when scoring, the additional options apply only across the same level. Thus, the user selecting Left or Right correctly has no effect on the scoring in the beginner competition. It only affects scoring for the intermediate competition. Thus, users are able to compete at different levels for the same event.


To utilize the present invention, users select from or generate competition groups to participate in. The users select system generated competition groups which are specific to levels, geographic locations and other general categories. The users are also able to generate their own competition groups which include friends, family, co-workers or other groups of people they choose. After the competition groups are generated, users are able to join whichever group they are invited to. After joining one or more groups, the users are able to join additional groups beyond that as they are generated and become available to the user. A user is informed of the competition groups available for entering either by email, Short Message Service (SMS) text message, voice message or when the user couples to the network to view/play competitions. After joining the desired competition groups, the user participates in the competitions by answering questions or making selections based on viewing a sporting event, television show, game show or other event where skill is involved in making choices. In addition, games of skill with a common start time can be conducted simultaneously in real-time, based on classic card, dice, trivia, word and other games. The selections/answers/predictions are stored and results and/or standings are sent to the user. The results and/or standings throughout the competition show how well the user is doing compared to other competitors via standings, and when the competition is over, the results and/or standings determine who the winner is. Additionally, since multiple competitions are occurring based on a single event, the results and standings are organized so that the user is able to understand how he is doing in each event. For example, if a user is winning by a lot in his two friendly competitions, but is slightly out of prize position in the open competition, he will not simply relax and coast to victory in his friendly competitions. He is able to realize that by performing slightly better, he still has a chance to win a prize in the open competition, while still winning easily in the friendly competitions.


In operation, the present invention allows users to set up and compete in multiple competitions for a single event. Although users are competing against typically different competitors in different competition groups, the same selections are utilized to produce scores that have specific meaning based on the competition group. As described above, a user may lose in one competition group but win in another competition group because the competitors are different. Also, the requirements of each group are different as well. For example, in team play, if the top two scores are counted and the user has one of the top two scores, then his score is important even though he lost in a different competition group. In another example, the competition group is a season long event where there is no weekly winner, but only a year-end winner. Thus, although the competitor is doing terrible one week and has no chance of winning the separate weekly competition, the user is still encouraged to do as well as possible for the year-end total. By allowing users to compete in multiple competition groups for the same event, the user interaction increases substantially. For example, instead of a user simply playing his standard weekly intermediate football competition, the user is also invited to play in his family's tournament for bragging rights, his friend's competition where the winner gets $20 and his co-worker's competition where the lowest score pays for a round of drinks the following Friday. With more chances to win, users have a much more vested interest in competing. To ensure users do not get frustrated with the scoring, the results and/or standings are displayed in a very user-friendly format so that a user knows how well he is doing in each respective competition.


In some embodiments, multiple servers are used within the network. For example, one server is dedicated for the scoring, a separate server is dedicated for the database and another server is dedicated for hosting the graphical user interface.


The present invention has been described in terms of specific embodiments incorporating details to facilitate the understanding of principles of construction and operation of the invention. Such reference herein to specific embodiments and details thereof is not intended to limit the scope of the claims appended hereto. It will be readily apparent to one skilled in the art that other various modifications may be made in the embodiment chosen for illustration without departing from the spirit and scope of the invention as defined by the claims.

Claims
  • 1. A method, programmed in a memory of a device, of participating in a plurality of competitive groups, each comprising a plurality of competitors and corresponding to one or more events, the method comprising: determining, with the device, a physical location of a user and eligibility of the user to participate in the plurality of competitive groups based on the physical location of the user;receiving, with the device, one or more event selections by the user related to the one or more events prior to the beginning of a first event of the one or more events, wherein the one or more event selections enable the user to participate in the plurality of competitive groups; andtriggering, on the device, a lockout signal preventing further additional user input.
  • 2. The method as claimed in claim 1 wherein the one or more events are selected from the group consisting of a live television-based event, a recorded television event, a scheduled competition, a scheduled series of competitions, a sporting event, an event based on a video game, computer game, mobile game or electronic game conducted in real time, an entertainment show, a game show, a reality show and a news show.
  • 3. A server device for conducting multiple contests each comprising a plurality of competitors and corresponding to one or more events, the server device comprising: a memory configured for:determining a physical location of a user and eligibility of the user to participate in a plurality of competitive groups based on the physical location of the user;receiving one or more event selections by the user related to the one or more events; andtriggering a lockout signal preventing further additional user input; anda processor configured for processing the multiple contests corresponding to the one or more events, wherein processing the multiple contests is based on the one or more event selections for the user which enables the user to participate in the plurality of competitive groups, wherein the server device presents standings and results related to the event selections, wherein the standings in each of the plurality of competitive groups are based on the results.
  • 4. A device for participating in multiple contests each comprising a plurality of competitors and corresponding to one or more events, the device comprising: a communications module for coupling to a server; andan application for utilizing the communications module for coupling to a server to communicate with the server determine which competitive groups a user is eligible to complete in which are used to compete in the multiple contests wherein the application enables an individual user to join a plurality of competitive groups for the one or more events, wherein the application is configured for: determining a physical location of a user and eligibility of the user to participate in the plurality of competitive groups based on the physical location of the user;receiving one or more event selections by the user related to the one or more events prior to the beginning of the first one of the one or more events, wherein the one or more event selections enable the user to participate in the plurality of competitive groups; andtriggering a lockout signal preventing further additional user input.
  • 5. The device as claimed in claim 4 wherein the application utilizes the communications module for coupling to the server to send selections to and receive standings from the server.
  • 6. The method as claimed in claim 1 wherein the one or more events are one or more live events.
  • 7. The method as claimed in claim 1 wherein the one or more events comprise multiple events over a period of time of a same sport.
  • 8. The method as claimed in claim 1 wherein the lockout signal occurs immediately before competitors in the competitive groups are able to see or hear relevant live action unfold.
  • 9. The method as claimed in claim 1 wherein the lockout signal is triggered based on a countdown time presented simultaneously to all competitors.
  • 10. The server device as claimed in claim 3 wherein the one or more events are one or more live events.
  • 11. The server device as claimed in claim 3 wherein the one or more events comprise multiple events over a period of time of a same sport.
  • 12. The server device as claimed in claim 3 wherein the lockout signal occurs immediately before competitors in the contests are able to see or hear relevant live action unfold.
  • 13. The server device as claimed in claim 3 wherein the lockout signal is triggered based on a countdown time presented simultaneously to all competitors.
  • 14. The server device as claimed in claim 3 wherein the one or more events comprise classic games of skill including card, dice, trivia and word games played simultaneously.
  • 15. The device as claimed in claim 4 wherein the one or more events are one or more live events.
  • 16. The device as claimed in claim 4 wherein the one or more events comprise multiple events over a period of time of a same sport.
  • 17. The device as claimed in claim 4 wherein the lockout signal occurs immediately before competitors in the contests are able to see or hear relevant live action unfold.
  • 18. The device as claimed in claim 4 wherein the lockout signal is triggered based on a countdown time presented simultaneously to all competitors.
  • 19. The device as claimed in claim 4 wherein the one or more events comprise classic games of skill including card, dice, trivia and word games played simultaneously.
RELATED APPLICATION(S)

This patent application is a continuation of co-pending U.S. patent application Ser. No. 16/934,886, filed on Jul. 21, 2020, titled “METHOD OF AND SYSTEM FOR CONDUCTING MULTIPLE CONTESTS OF SKILL WITH A SINGLE PERFORMANCE” which is a continuation of U.S. patent application Ser. No. 16/426,788, filed on May 30, 2019, titled “METHOD OF AND SYSTEM FOR CONDUCTING MULTIPLE CONTESTS OF SKILL WITH A SINGLE PERFORMANCE” which is a continuation of U.S. patent application Ser. No. 15/900,480, filed on Feb. 20, 2018, titled “METHOD OF AND SYSTEM FOR CONDUCTING MULTIPLE CONTESTS OF SKILL WITH A SINGLE PERFORMANCE” which is a continuation of co-pending U.S. patent application Ser. No. 15/296,983, filed on Oct. 18, 2016, titled “METHOD OF AND SYSTEM FOR CONDUCTING MULTIPLE CONTESTS OF SKILL WITH A SINGLE PERFORMANCE” which is a continuation of U.S. patent application Ser. No. 14/927,276, filed on Oct. 29, 2015, titled “METHOD OF AND SYSTEM FOR CONDUCTING MULTIPLE CONTESTS OF SKILL WITH A SINGLE PERFORMANCE” which is a continuation of U.S. patent application Ser. No. 14/723,363, filed on May 27, 2015, titled “METHOD OF AND SYSTEM FOR CONDUCTING MULTIPLE CONTESTS OF SKILL WITH A SINGLE PERFORMANCE” which is a continuation of U.S. patent application Ser. No. 14/044,173, filed on Oct. 2, 2013, titled “METHOD OF AND SYSTEM FOR CONDUCTING MULTIPLE CONTESTS OF SKILL WITH A SINGLE PERFORMANCE” which is a continuation of U.S. patent application Ser. No. 13/215,052, filed on Aug. 22, 2011, titled “METHOD OF AND SYSTEM FOR CONDUCTING MULTIPLE CONTESTS OF SKILL WITH A SINGLE PERFORMANCE” which is a continuation of U.S. patent application Ser. No. 11/652,240, filed on Jan. 10, 2007, titled “METHOD OF AND SYSTEM FOR CONDUCTING MULTIPLE CONTESTS OF SKILL WITH A SINGLE PERFORMANCE”, now issued as U.S. Pat. No. 8,002,618, which claims priority under 35 U.S.C. § 119(e) of the co-owned U.S. Provisional Patent Application No. 60/757,960, filed Jan. 10, 2006, and entitled “METHODOLOGY FOR CONDUCTING MULTIPLE CONTESTS OF SKILL WITH A SINGLE PERFORMANCE,” all of which are also hereby incorporated by reference in their entirety.

US Referenced Citations (759)
Number Name Date Kind
2010516 Hoffmann Aug 1935 A
2051615 Miles Aug 1936 A
2193638 Morton Mar 1940 A
2274933 Peck Mar 1942 A
2831105 Parker Apr 1958 A
3550944 Chamberlin Dec 1970 A
3562650 Gossard et al. Feb 1971 A
3689071 Kucera Sep 1972 A
4141548 Everton Feb 1979 A
4270755 Willhide et al. Jun 1981 A
4386377 Hunter, Jr. May 1983 A
4496148 Morstain et al. Jan 1985 A
4521803 Glittinger Jun 1985 A
4592546 Fascenda et al. Jun 1986 A
4816904 McKenna et al. Mar 1989 A
4918603 Hughes et al. Apr 1990 A
4930010 MacDonald May 1990 A
5013038 Luvenberg May 1991 A
5018736 Pearson et al. May 1991 A
5035422 Berman Jul 1991 A
5073931 Audebert et al. Dec 1991 A
5083271 Thatcher et al. Jan 1992 A
5083800 Lockton Jan 1992 A
5119295 Kapur Jun 1992 A
5120076 Luxenberg et al. Jun 1992 A
5213337 Sherman May 1993 A
5227874 Von Kohom Jul 1993 A
5256863 Ferguson Oct 1993 A
5263723 Pearson et al. Nov 1993 A
5283734 Von Kohorn Feb 1994 A
5327485 Leaden Jul 1994 A
5343236 Koppe et al. Aug 1994 A
5343239 Lappington et al. Aug 1994 A
5417424 Snowden May 1995 A
5462275 Lowe et al. Oct 1995 A
5479492 Hofstee et al. Dec 1995 A
5488659 Millani Jan 1996 A
5519433 Lappington May 1996 A
5530483 Cooper Jun 1996 A
5553120 Katz Sep 1996 A
5566291 Boulton et al. Oct 1996 A
5585975 Bliss Dec 1996 A
5586257 Perlman Dec 1996 A
5589765 Ohmart et al. Dec 1996 A
5594938 Engel Jan 1997 A
5618232 Martin Apr 1997 A
5628684 Jean-Etienne May 1997 A
5636920 Shur et al. Jun 1997 A
5638113 Lappington Jun 1997 A
5643088 Vaughn et al. Jul 1997 A
5663757 Morales Sep 1997 A
5711715 Ringo Jan 1998 A
5759101 Won Kohom Jun 1998 A
5761606 Wolzien Jun 1998 A
5762552 Voung et al. Jun 1998 A
5764275 Lappington et al. Jun 1998 A
5794210 Goldhaber et al. Aug 1998 A
5805230 Staron Sep 1998 A
5813913 Berner et al. Sep 1998 A
5818438 Howe et al. Oct 1998 A
5828843 Grimm Oct 1998 A
5838774 Weiser, Jr. Nov 1998 A
5838909 Roy Nov 1998 A
5846132 Junkin Dec 1998 A
5848397 Marsh et al. Dec 1998 A
5860862 Junkin Jan 1999 A
5882260 Marks Mar 1999 A
5894556 Grimm Apr 1999 A
5916024 Von Kohom Jun 1999 A
5870683 Wells et al. Sep 1999 A
5970143 Schneier et al. Oct 1999 A
5971854 Pearson et al. Oct 1999 A
5987440 O'Neil et al. Nov 1999 A
6009458 Hawkins et al. Dec 1999 A
6016337 Pykalisto Jan 2000 A
6038599 Black Mar 2000 A
6042477 Addink Mar 2000 A
6015344 Kelly et al. Apr 2000 A
6064449 White May 2000 A
6104815 Alcorn et al. Aug 2000 A
6110041 Walker et al. Aug 2000 A
6117013 Elba Sep 2000 A
6126543 Friedman Oct 2000 A
6128660 Grimm Oct 2000 A
6135881 Abbott et al. Oct 2000 A
6154131 Jones, II Nov 2000 A
6174237 Stephenson Jan 2001 B1
6182084 Cockrell et al. Jan 2001 B1
6193610 Junkin Feb 2001 B1
6222642 Farrell et al. Apr 2001 B1
6233736 Wolzien May 2001 B1
6251017 Leason et al. Jun 2001 B1
6264650 Goldberg Jul 2001 B1
6267670 Walker Jul 2001 B1
6287199 McKeown et al. Sep 2001 B1
6293868 Bernard Sep 2001 B1
6312336 Handelman et al. Nov 2001 B1
6343320 Fairchild Jan 2002 B1
6345297 Grimm Feb 2002 B1
6371855 Gavriloff Apr 2002 B1
6373462 Pan Apr 2002 B1
6411969 Tam Jun 2002 B1
6416414 Stadelmann Jul 2002 B1
6418298 Sonnenfeld Jul 2002 B1
6425828 Walker et al. Jul 2002 B2
6434398 Inselberg Aug 2002 B1
6446262 Malaure et al. Sep 2002 B1
6470180 Kotzin et al. Oct 2002 B1
6475090 Gregory Nov 2002 B2
6524189 Rautila Feb 2003 B1
6527641 Sinclair et al. Mar 2003 B1
6530082 Del Sesto et al. Mar 2003 B1
6536037 Guheen et al. Mar 2003 B1
6537150 Luciano Mar 2003 B1
6578068 Bowma-Amuah Jun 2003 B1
6594098 Sutardja Jul 2003 B1
6604997 Saidakovsky et al. Jul 2003 B2
6610953 Tao et al. Aug 2003 B1
6611755 Coffee Aug 2003 B1
6648760 Nicastro Nov 2003 B1
6659860 Yamamoto et al. Dec 2003 B1
6659861 Faris Dec 2003 B1
6659872 Kaufman et al. Dec 2003 B1
6690661 Agarwal et al. Feb 2004 B1
6697869 Mallart Feb 2004 B1
6718350 Karbowski Apr 2004 B1
6752396 Smith Jun 2004 B2
6758754 Lavanchy et al. Jul 2004 B1
6758755 Kelly et al. Jul 2004 B2
6760595 Insellberg Jul 2004 B2
6763377 Balknap et al. Jul 2004 B1
6766524 Matheny et al. Jul 2004 B1
6774926 Ellis et al. Aug 2004 B1
6785561 Kim Aug 2004 B1
6801380 Saturdja Oct 2004 B1
6806889 Malaure et al. Oct 2004 B1
6807675 Millard et al. Oct 2004 B1
6811482 Letovsky Nov 2004 B2
6811487 Sengoku Nov 2004 B2
6816628 Sarachik et al. Nov 2004 B1
6817947 Tanskanen Nov 2004 B2
6824469 Allibhoy et al. Nov 2004 B2
6837789 Garahi et al. Jan 2005 B2
6837791 McNutt et al. Jan 2005 B1
6840861 Jordan et al. Jan 2005 B2
6845389 Sen Jan 2005 B1
6846239 Washio Jan 2005 B2
6857122 Takeda et al. Feb 2005 B1
6863610 Vancraeynest Mar 2005 B2
6870720 Iwata et al. Mar 2005 B2
6871226 Ensley et al. Mar 2005 B1
6873610 Noever Mar 2005 B1
6884166 Leen et al. Apr 2005 B2
6884172 Lloyd et al. Apr 2005 B1
6887159 Leen et al. May 2005 B2
6888929 Saylor May 2005 B1
6893347 Zilliacus et al. May 2005 B1
6898762 Ellis et al. May 2005 B2
6899628 Leen et al. May 2005 B2
6903681 Faris Jun 2005 B2
6908389 Puskala Jun 2005 B1
6942574 LeMay et al. Sep 2005 B1
6944228 Dakss et al. Sep 2005 B1
6960088 Long Nov 2005 B1
6978053 Sarachik et al. Dec 2005 B1
7001279 Barber et al. Feb 2006 B1
7029394 Leen et al. Apr 2006 B2
7035626 Luciano, Jr. Apr 2006 B1
7035653 Simon et al. Apr 2006 B2
7058592 Heckerman et al. Jun 2006 B1
7076434 Newman et al. Jul 2006 B1
7085552 Buckley Aug 2006 B2
7116310 Evans et al. Oct 2006 B1
7117517 Milazzo et al. Oct 2006 B1
7120924 Katcher et al. Oct 2006 B1
7124410 Berg Oct 2006 B2
7125336 Anttila et al. Oct 2006 B2
7136871 Ozer et al. Nov 2006 B2
7144011 Asher et al. Dec 2006 B2
7169050 Tyler Jan 2007 B1
7185355 Ellis Feb 2007 B1
7187658 Koyanagi Mar 2007 B2
7191447 Ellis et al. Mar 2007 B1
7192352 Walker et al. Mar 2007 B2
7194758 Waki et al. Mar 2007 B1
7228349 Barone, Jr. et al. Jun 2007 B2
7231630 Acott et al. Jun 2007 B2
7233922 Asher et al. Jun 2007 B2
7240093 Danieli et al. Jul 2007 B1
7244181 Wang et al. Jul 2007 B2
7249367 Bove, Jr. et al. Jul 2007 B2
7254605 Strum Aug 2007 B1
7260782 Wallace et al. Aug 2007 B2
RE39818 Slifer Sep 2007 E
7283830 Buckley Oct 2007 B2
7288027 Overton Oct 2007 B2
7341517 Asher et al. Mar 2008 B2
7343617 Kartcher et al. Mar 2008 B1
7347781 Schultz Mar 2008 B2
7351149 Simon et al. Apr 2008 B1
7367042 Dakss et al. Apr 2008 B1
7379705 Rados et al. May 2008 B1
7389144 Osorio Jun 2008 B1
7430718 Gariepy-Viles Sep 2008 B2
7452273 Amaitis et al. Nov 2008 B2
7460037 Cattone et al. Dec 2008 B2
7461067 Dewing et al. Dec 2008 B2
7502610 Maher Mar 2009 B2
7510474 Carter, Sr. Mar 2009 B2
7517282 Pryor Apr 2009 B1
7534169 Amaitis et al. May 2009 B2
7543052 Cesa Klein Jun 2009 B1
7562134 Fingerhut et al. Jul 2009 B1
7602808 Ullmann Oct 2009 B2
7610330 Quinn Oct 2009 B1
7614944 Hughes et al. Nov 2009 B1
7630986 Herz et al. Dec 2009 B1
7693781 Asher et al. Apr 2010 B2
7699707 Bahou Apr 2010 B2
7702723 Dyl Apr 2010 B2
7711628 Davie et al. May 2010 B2
7729286 Mishra Jun 2010 B2
7753772 Walker Jul 2010 B1
7753789 Walker et al. Jul 2010 B2
7780528 Hirayama Aug 2010 B2
7828661 Fish Nov 2010 B1
7835961 Davie et al. Nov 2010 B2
7860993 Chintala Dec 2010 B2
7886003 Newman Feb 2011 B2
7907211 Oostveen et al. Mar 2011 B2
7907598 Anisimov Mar 2011 B2
7909332 Root Mar 2011 B2
7925756 Riddle Apr 2011 B1
7926810 Fisher et al. Apr 2011 B2
7937318 Davie et al. May 2011 B2
7941482 Bates May 2011 B2
7941804 Herington May 2011 B1
7951002 Brosnan May 2011 B1
7976389 Cannon et al. Jul 2011 B2
8002618 Lockton Aug 2011 B1
8006314 Wold Aug 2011 B2
8025565 Leen et al. Sep 2011 B2
8028315 Barber Sep 2011 B1
8082150 Wold Dec 2011 B2
8086445 Wold et al. Dec 2011 B2
8086510 Amaitis et al. Dec 2011 B2
8092303 Amaitis et al. Jan 2012 B2
8092306 Root Jan 2012 B2
8105141 Leen et al. Jan 2012 B2
8107674 Davis et al. Jan 2012 B2
8109827 Cahill et al. Feb 2012 B2
8128474 Amaitis et al. Mar 2012 B2
8147313 Amaitis et al. Apr 2012 B2
8147373 Amaitis et al. Apr 2012 B2
8149530 Lockton et al. Apr 2012 B1
8155637 Fujisawa Apr 2012 B2
8162759 Yamaguchi Apr 2012 B2
8176518 Junkin et al. May 2012 B1
8186682 Amaitis et al. May 2012 B2
8204808 Amaitis et al. Jun 2012 B2
8219617 Ashida Jul 2012 B2
8240669 Asher et al. Aug 2012 B2
8246048 Asher et al. Aug 2012 B2
8267403 Fisher et al. Sep 2012 B2
8342924 Leen et al. Jan 2013 B2
8342942 Amaitis et al. Jan 2013 B2
8353763 Amaitis et al. Jan 2013 B2
8376855 Lockton et al. Feb 2013 B2
8396001 Jung Mar 2013 B2
8397257 Barber Mar 2013 B1
8465021 Asher et al. Jun 2013 B2
8473393 Davie et al. Jun 2013 B2
8474819 Asher et al. Jul 2013 B2
8535138 Amaitis et al. Sep 2013 B2
8538563 Barber Sep 2013 B1
8543487 Asher et al. Sep 2013 B2
8555313 Newman Oct 2013 B2
8556691 Leen et al. Oct 2013 B2
8585490 Amaitis et al. Nov 2013 B2
8597117 Bruce Dec 2013 B2
8622798 Lockton et al. Jan 2014 B2
8632392 Shore et al. Jan 2014 B2
8634943 Root Jan 2014 B2
8638517 Lockton et al. Jan 2014 B2
8641511 Ginsberg et al. Feb 2014 B2
8659848 Lockton et al. Feb 2014 B2
8672751 Leen et al. Mar 2014 B2
8699168 Lockton et al. Apr 2014 B2
8705195 Lockton Apr 2014 B2
8708789 Asher et al. Apr 2014 B2
8717701 Lockton et al. May 2014 B2
8727352 Amaitis et al. May 2014 B2
8734227 Leen et al. May 2014 B2
8737004 Lockton et al. May 2014 B2
8738694 Huske et al. May 2014 B2
8771058 Alderucci et al. Jul 2014 B2
8780482 Lockton et al. Jul 2014 B2
8805732 Davie et al. Aug 2014 B2
8813112 Cibula et al. Aug 2014 B1
8814664 Amaitis et al. Aug 2014 B2
8817408 Lockton et al. Aug 2014 B2
8837072 Lockton et al. Sep 2014 B2
8849225 Choti Sep 2014 B1
8849255 Choti Sep 2014 B2
8858313 Selfors Oct 2014 B1
8870639 Lockton et al. Oct 2014 B2
8935715 Cibula et al. Jan 2015 B2
9056251 Lockton Jun 2015 B2
9067143 Lockton Jun 2015 B2
9069651 Barber Jun 2015 B2
9076303 Park Jul 2015 B1
9098883 Asher et al. Aug 2015 B2
9111417 Leen et al. Aug 2015 B2
9205339 Cibula et al. Dec 2015 B2
9233293 Lockton Jan 2016 B2
9258601 Lockton et al. Feb 2016 B2
9270789 Huske et al. Feb 2016 B2
9289692 Barber Mar 2016 B2
9306952 Burman et al. Apr 2016 B2
9314686 Lockton Apr 2016 B2
9314701 Lockton et al. Apr 2016 B2
9355518 Amaitis et al. May 2016 B2
9406189 Scott et al. Aug 2016 B2
9430901 Amaitis et al. Aug 2016 B2
9457272 Lockton et al. Oct 2016 B2
9498724 Lockton et al. Nov 2016 B2
9501904 Lockton Nov 2016 B2
9504922 Lockton et al. Nov 2016 B2
9511287 Lockton et al. Dec 2016 B2
9526991 Lockton et al. Dec 2016 B2
9536396 Amaitis et al. Jan 2017 B2
9556991 Furuya Jan 2017 B2
9604140 Lockton et al. Mar 2017 B2
9652937 Lockton May 2017 B2
9662576 Lockton et al. May 2017 B2
9662577 Lockton et al. May 2017 B2
9672692 Lockton Jun 2017 B2
9687738 Lockton et al. Jun 2017 B2
9687739 Lockton et al. Jun 2017 B2
9707482 Lockton et al. Jul 2017 B2
9716918 Lockton et al. Jul 2017 B1
9724603 Lockton et al. Aug 2017 B2
9744453 Lockton et al. Aug 2017 B2
9805549 Asher et al. Oct 2017 B2
9821233 Lockton et al. Nov 2017 B2
9878243 Lockton et al. Jan 2018 B2
9881337 Jaycobs et al. Jan 2018 B2
9901820 Lockton et al. Feb 2018 B2
9908053 Lockton et al. Mar 2018 B2
9919210 Lockton Mar 2018 B2
9919211 Lockton et al. Mar 2018 B2
9919221 Lockton et al. Mar 2018 B2
9978217 Lockton May 2018 B2
9993730 Lockton et al. Jun 2018 B2
9999834 Lockton et al. Jun 2018 B2
10052557 Lockton et al. Aug 2018 B2
10089815 Asher et al. Oct 2018 B2
10096210 Amaitis et al. Oct 2018 B2
10137369 Lockton et al. Nov 2018 B2
10150031 Lockton et al. Dec 2018 B2
10165339 Huske et al. Dec 2018 B2
10186116 Lockton Jan 2019 B2
10195526 Lockton et al. Feb 2019 B2
10226698 Lockton et al. Mar 2019 B1
10226705 Lockton et al. Mar 2019 B2
10232270 Lockton et al. Mar 2019 B2
10248290 Galfond Apr 2019 B2
10279253 Lockton May 2019 B2
10360767 Russell et al. Jul 2019 B2
10410474 Lockton Sep 2019 B2
10438451 Amaitis Oct 2019 B2
10569175 Kosai et al. Feb 2020 B2
10593157 Simons Mar 2020 B2
10653955 Lockton May 2020 B2
10695672 Lockton et al. Jun 2020 B2
10709987 Lockton et al. Jul 2020 B2
10721543 Huske et al. Jul 2020 B2
10825294 Katz Nov 2020 B2
10937279 Workman Mar 2021 B1
10981070 Isgreen Apr 2021 B2
11077366 Lockton Aug 2021 B2
11082746 Lockton Aug 2021 B2
11083965 Lockton Aug 2021 B2
11154775 Lockton Oct 2021 B2
11179632 Lockton Nov 2021 B2
11185770 Lockton Nov 2021 B2
20010004609 Walker et al. Jun 2001 A1
20010005670 Lahtinen Jun 2001 A1
20010013067 Koyanagi Aug 2001 A1
20010013125 Kitsukawa et al. Aug 2001 A1
20010020298 Rector, Jr. et al. Sep 2001 A1
20010032333 Flickinger Oct 2001 A1
20010036272 Hirayama Nov 2001 A1
20010036853 Thomas Nov 2001 A1
20010044339 Cordero Nov 2001 A1
20010054019 de Fabrega Dec 2001 A1
20020010789 Lord Jan 2002 A1
20020018477 Katz Feb 2002 A1
20020026321 Faris Feb 2002 A1
20020029381 Inselberg Mar 2002 A1
20020035609 Lessard Mar 2002 A1
20020037766 Muniz Mar 2002 A1
20020069265 Bountour Mar 2002 A1
20020042293 Ubale et al. Apr 2002 A1
20020046099 Frengut et al. Apr 2002 A1
20020054088 Tanskanen et al. May 2002 A1
20020055385 Otsu May 2002 A1
20020056089 Houston May 2002 A1
20020059094 Hosea et al. May 2002 A1
20020059623 Rodriguez et al. May 2002 A1
20020069076 Faris Jun 2002 A1
20020076084 Tian Jun 2002 A1
20020078176 Nomura et al. Jun 2002 A1
20020083461 Hutcheson Jun 2002 A1
20020091833 Grimm Jul 2002 A1
20020094869 Harkham Jul 2002 A1
20020095333 Jokinen et al. Jul 2002 A1
20020097983 Wallace et al. Jul 2002 A1
20020099709 Wallace Jul 2002 A1
20020100063 Herigstad et al. Jul 2002 A1
20020103696 Huang et al. Aug 2002 A1
20020105535 Wallace et al. Aug 2002 A1
20020107073 Binney Aug 2002 A1
20020108112 Wallace et al. Aug 2002 A1
20020108125 Joao Aug 2002 A1
20020108127 Lew et al. Aug 2002 A1
20020112249 Hendricks et al. Aug 2002 A1
20020115488 Berry et al. Aug 2002 A1
20020119821 Sen Aug 2002 A1
20020120930 Yona Aug 2002 A1
20020124247 Houghton Sep 2002 A1
20020132614 Vanlujit et al. Sep 2002 A1
20020133817 Markel Sep 2002 A1
20020133827 Newman et al. Sep 2002 A1
20020142843 Roelofs Oct 2002 A1
20020144273 Reto Oct 2002 A1
20020147049 Carter, Sr. Oct 2002 A1
20020157002 Messerges et al. Oct 2002 A1
20020157005 Bunk Oct 2002 A1
20020159576 Adams Oct 2002 A1
20020162031 Levin et al. Oct 2002 A1
20020162117 Pearson Oct 2002 A1
20020165020 Koyama Nov 2002 A1
20020165025 Kawahara Nov 2002 A1
20020177483 Cannon Nov 2002 A1
20020184624 Spencer Dec 2002 A1
20020187825 Tracy Dec 2002 A1
20020198050 Patchen Dec 2002 A1
20030002638 Kaars Jan 2003 A1
20030003997 Vuong et al. Jan 2003 A1
20030013528 Allibhoy et al. Jan 2003 A1
20030023547 France Jan 2003 A1
20030040363 Sandberg Feb 2003 A1
20030054885 Pinto et al. Mar 2003 A1
20030060247 Goldberg et al. Mar 2003 A1
20030066089 Anderson Apr 2003 A1
20030069828 Blazey et al. Apr 2003 A1
20030070174 Solomon Apr 2003 A1
20030078924 Liechty et al. Apr 2003 A1
20030086691 Yu May 2003 A1
20030087652 Simon et al. May 2003 A1
20030088648 Bellaton May 2003 A1
20030088878 Rogers May 2003 A1
20030114224 Anttila et al. Jun 2003 A1
20030115152 Flaherty Jun 2003 A1
20030125109 Green Jul 2003 A1
20030134678 Tanaka Jul 2003 A1
20030144017 Inselberg Jul 2003 A1
20030154242 Hayes et al. Aug 2003 A1
20030165241 Fransdonk Sep 2003 A1
20030177167 Afage et al. Sep 2003 A1
20030177504 Paulo et al. Sep 2003 A1
20030189668 Newman et al. Oct 2003 A1
20030195023 Di Cesare Oct 2003 A1
20030195807 Maggio Oct 2003 A1
20030208579 Brady et al. Nov 2003 A1
20030211856 Zilliacus Nov 2003 A1
20030212691 Kuntala et al. Nov 2003 A1
20030216185 Varley Nov 2003 A1
20030216857 Feldman et al. Nov 2003 A1
20030228866 Pezeshki Dec 2003 A1
20030233425 Lyons et al. Dec 2003 A1
20040005919 Walker et al. Jan 2004 A1
20040014524 Pearlman Jan 2004 A1
20040015442 Hmlinen Jan 2004 A1
20040022366 Ferguson et al. Feb 2004 A1
20040025190 McCalla Feb 2004 A1
20040056897 Ueda Mar 2004 A1
20040060063 Russ et al. Mar 2004 A1
20040073915 Dureau Apr 2004 A1
20040088729 Petrovic et al. May 2004 A1
20040093302 Baker et al. May 2004 A1
20040152454 Kauppinen May 2004 A1
20040107138 Maggio Jun 2004 A1
20040117831 Ellis et al. Jun 2004 A1
20040117839 Watson et al. Jun 2004 A1
20040128319 Davis et al. Jul 2004 A1
20040139158 Datta Jul 2004 A1
20040139482 Hale Jul 2004 A1
20040148638 Weisman et al. Jul 2004 A1
20040152517 Haedisty Aug 2004 A1
20040152519 Wang Aug 2004 A1
20040158855 Gu et al. Aug 2004 A1
20040162124 Barton Aug 2004 A1
20040166873 Simic Aug 2004 A1
20040176162 Rothschild Sep 2004 A1
20040178923 Kuang Sep 2004 A1
20040183824 Benson Sep 2004 A1
20040185881 Lee Sep 2004 A1
20040190779 Sarachik et al. Sep 2004 A1
20040198495 Cisneros et al. Oct 2004 A1
20040201626 Lavoie Oct 2004 A1
20040203667 Shroder Oct 2004 A1
20040203898 Bodin et al. Oct 2004 A1
20040210507 Asher et al. Oct 2004 A1
20040215756 VanAntwerp Oct 2004 A1
20040216161 Barone, Jr. et al. Oct 2004 A1
20040216171 Barone, Jr. et al. Oct 2004 A1
20040224750 Ai-Ziyoud Nov 2004 A1
20040242321 Overton Dec 2004 A1
20040266513 Odom Dec 2004 A1
20050005303 Barone, Jr. et al. Jan 2005 A1
20050021942 Diehl et al. Jan 2005 A1
20050026699 Kinzer et al. Feb 2005 A1
20050028208 Ellis Feb 2005 A1
20050043094 Nguyen et al. Feb 2005 A1
20050076371 Nakamura Apr 2005 A1
20050077997 Landram Apr 2005 A1
20050060219 Ditering et al. May 2005 A1
20050097599 Potnick et al. May 2005 A1
20050101309 Croome May 2005 A1
20050113164 Buecheler et al. May 2005 A1
20050003878 Updike Jun 2005 A1
20050116416 Peterson Jun 2005 A1
20050131984 Hofmann et al. Jun 2005 A1
20050138668 Gray et al. Jun 2005 A1
20050144102 Johnson Jun 2005 A1
20050155083 Oh Jul 2005 A1
20050177861 Ma et al. Aug 2005 A1
20050210526 Levy et al. Sep 2005 A1
20050216838 Graham Sep 2005 A1
20050235043 Teodosiu et al. Oct 2005 A1
20050239551 Griswold Oct 2005 A1
20050255901 Kreutzer Nov 2005 A1
20050256895 Dussault Nov 2005 A1
20050266869 Jung Dec 2005 A1
20050267969 Poikselka et al. Dec 2005 A1
20050273804 Preisman Dec 2005 A1
20050283800 Ellis et al. Dec 2005 A1
20050288080 Lockton et al. Dec 2005 A1
20050288101 Lockton et al. Dec 2005 A1
20050288812 Cheng Dec 2005 A1
20060020700 Qiu Jan 2006 A1
20060025070 Kim et al. Feb 2006 A1
20060046810 Tabata Mar 2006 A1
20060047772 Crutcher Mar 2006 A1
20060053390 Gariepy-Viles Mar 2006 A1
20060058103 Danieli Mar 2006 A1
20060059161 Millett et al. Mar 2006 A1
20060063590 Abassi et al. Mar 2006 A1
20060082068 Patchen Apr 2006 A1
20060087585 Seo Apr 2006 A1
20060089199 Jordan et al. Apr 2006 A1
20060094409 Inselberg May 2006 A1
20060101492 Lowcock May 2006 A1
20060111168 Nguyen May 2006 A1
20060135253 George et al. Jun 2006 A1
20060148569 Beck Jul 2006 A1
20060156371 Maetz et al. Jul 2006 A1
20060160597 Wright Jul 2006 A1
20060174307 Hwang et al. Aug 2006 A1
20060183547 McMonigle Aug 2006 A1
20060183548 Morris et al. Aug 2006 A1
20060190654 Joy Aug 2006 A1
20060205483 Meyer Sep 2006 A1
20060205509 Hirota Sep 2006 A1
20060205510 Lauper Sep 2006 A1
20060217198 Johnson Sep 2006 A1
20060236352 Scott, III Oct 2006 A1
20060248553 Mikkelson et al. Nov 2006 A1
20060248564 Zinevitch Nov 2006 A1
20060256865 Westerman Nov 2006 A1
20060256868 Westerman Nov 2006 A1
20060269120 Mehmadi et al. Nov 2006 A1
20060285586 Westerman Dec 2006 A1
20070004516 Jordan et al. Jan 2007 A1
20070013547 Boaz Jan 2007 A1
20070019826 Horbach et al. Jan 2007 A1
20070028272 Lockton Feb 2007 A1
20070037623 Romik Feb 2007 A1
20070054695 Huske et al. Mar 2007 A1
20070078009 Lockton et al. Apr 2007 A1
20070083920 Mizoguchi et al. Apr 2007 A1
20070086465 Paila et al. Apr 2007 A1
20070087832 Abbott Apr 2007 A1
20070093296 Asher Apr 2007 A1
20070106721 Schloter May 2007 A1
20070107010 Jolna et al. May 2007 A1
20070129144 Katz Jun 2007 A1
20070147870 Nagashima et al. Jul 2007 A1
20070162328 Reich Jul 2007 A1
20070183744 Koizumi Aug 2007 A1
20070197247 Inselberg Aug 2007 A1
20070210908 Putterman et al. Sep 2007 A1
20070219856 Ahmad-Taylor Sep 2007 A1
20070222652 Cattone et al. Sep 2007 A1
20070226062 Hughes et al. Sep 2007 A1
20070238525 Suomela Oct 2007 A1
20070243936 Binenstock et al. Oct 2007 A1
20070244570 Speiser et al. Oct 2007 A1
20070244585 Speiser et al. Oct 2007 A1
20070244749 Speiser et al. Oct 2007 A1
20070265089 Robarts Nov 2007 A1
20070294410 Pandya Dec 2007 A1
20080005037 Hammad Jan 2008 A1
20080013927 Kelly et al. Jan 2008 A1
20080051201 Lore Feb 2008 A1
20080066129 Katcher et al. Mar 2008 A1
20080076497 Kiskis et al. Mar 2008 A1
20080104630 Bruce May 2008 A1
20080146337 Halonen Jun 2008 A1
20080169605 Shuster et al. Jul 2008 A1
20080222672 Piesing Sep 2008 A1
20080240681 Fukushima Oct 2008 A1
20080248865 Tedesco Oct 2008 A1
20080270288 Butterly et al. Oct 2008 A1
20080288600 Clark Nov 2008 A1
20080301741 Stern Dec 2008 A1
20080315521 Reabe, Jr. Dec 2008 A1
20090011781 Merrill et al. Jan 2009 A1
20090094632 Newman et al. Apr 2009 A1
20090103892 Hirayama Apr 2009 A1
20090119151 de Heer May 2009 A1
20090186676 Amaitis et al. Jul 2009 A1
20090163271 George et al. Sep 2009 A1
20090228351 Rijsenbrij Sep 2009 A1
20090234674 Wurster Sep 2009 A1
20090264188 Soukup Oct 2009 A1
20090271512 Jorgensen Oct 2009 A1
20090325716 Harari Dec 2009 A1
20100099421 Patel et al. Apr 2010 A1
20100099471 Feeney et al. Apr 2010 A1
20100107194 McKissick et al. Apr 2010 A1
20100120503 Hoffman et al. May 2010 A1
20100137057 Fleming Jun 2010 A1
20100203936 Levy Aug 2010 A1
20100261533 Kryger Oct 2010 A1
20100279764 Allen et al. Nov 2010 A1
20100296511 Prodan Nov 2010 A1
20110016224 Riley Jan 2011 A1
20110053681 Goldman Mar 2011 A1
20110065490 Lutnick Mar 2011 A1
20110081958 Herman Apr 2011 A1
20110116461 Holt May 2011 A1
20110124397 Gingher May 2011 A1
20110130197 Bythar et al. Jun 2011 A1
20110227287 Reabe Sep 2011 A1
20110269548 Barclay et al. Nov 2011 A1
20110306428 Lockton et al. Dec 2011 A1
20120058808 Lockton Mar 2012 A1
20120115585 Goldman May 2012 A1
20120157178 Lockton Jun 2012 A1
20120264496 Behrman et al. Oct 2012 A1
20120282995 Allen et al. Nov 2012 A1
20120295686 Lockton Nov 2012 A1
20130005453 Nguyen et al. Jan 2013 A1
20130072271 Lockton et al. Mar 2013 A1
20130079081 Lockton et al. Mar 2013 A1
20130079092 Lockton et al. Mar 2013 A1
20130079093 Lockton et al. Mar 2013 A1
20130079135 Lockton et al. Mar 2013 A1
20130079150 Lockton et al. Mar 2013 A1
20130079151 Lockton et al. Mar 2013 A1
20130196774 Lockton et al. Aug 2013 A1
20130225285 Lockton Aug 2013 A1
20130225299 Lockton Aug 2013 A1
20140031134 Lockton et al. Jan 2014 A1
20140100011 Gingher Apr 2014 A1
20140106832 Lockton et al. Apr 2014 A1
20140128139 Shuster et al. May 2014 A1
20140155130 Lockton et al. Jun 2014 A1
20140155134 Lockton Jun 2014 A1
20140206446 Lockton et al. Jul 2014 A1
20140237025 Huske et al. Aug 2014 A1
20140248952 Cibula et al. Sep 2014 A1
20140256432 Lockton et al. Sep 2014 A1
20140279439 Brown Sep 2014 A1
20140287832 Lockton et al. Sep 2014 A1
20140309001 Root Oct 2014 A1
20140335961 Lockton et al. Nov 2014 A1
20140335962 Lockton et al. Nov 2014 A1
20140378212 Sims Dec 2014 A1
20150011310 Lockton et al. Jan 2015 A1
20150024814 Root Jan 2015 A1
20150067732 Howe et al. Mar 2015 A1
20150148130 Cibula et al. May 2015 A1
20150238839 Lockton Aug 2015 A1
20150238873 Arnone et al. Aug 2015 A1
20150258452 Lockton et al. Sep 2015 A1
20150356831 Osibodu Dec 2015 A1
20160023116 Wire Jan 2016 A1
20160045824 Lockton et al. Feb 2016 A1
20160049049 Lockton Feb 2016 A1
20160054872 Cibula et al. Feb 2016 A1
20160082357 Lockton Mar 2016 A1
20160121208 Lockton et al. May 2016 A1
20160134947 Huske et al. May 2016 A1
20160217653 Meyer Jul 2016 A1
20160220908 Isgreen Aug 2016 A1
20160271501 Balsbaugh Sep 2016 A1
20160361647 Lockton et al. Dec 2016 A1
20160375362 Lockton et al. Dec 2016 A1
20170036110 Lockton et al. Feb 2017 A1
20170036117 Lockton et al. Feb 2017 A1
20170043259 Lockton et al. Feb 2017 A1
20170053498 Lockton Feb 2017 A1
20170065891 Lockton et al. Mar 2017 A1
20170098348 Odom Apr 2017 A1
20170103615 Theodospoulos Apr 2017 A1
20170128840 Croci May 2017 A1
20170221314 Lockton Aug 2017 A1
20170225071 Lockton et al. Aug 2017 A1
20170225072 Lockton et al. Aug 2017 A1
20170232340 Lockton Aug 2017 A1
20170243438 Merati Aug 2017 A1
20170249801 Malek Aug 2017 A1
20170252649 Lockton et al. Sep 2017 A1
20170259173 Lockton et al. Sep 2017 A1
20170264961 Lockton Sep 2017 A1
20170282067 Lockton et al. Oct 2017 A1
20170296916 Lockton et al. Oct 2017 A1
20170304726 Lockton et al. Oct 2017 A1
20170345260 Strause Nov 2017 A1
20180001213 Tsang Jan 2018 A1
20180025586 Lockton Jan 2018 A1
20180071637 Baazov Mar 2018 A1
20180104582 Lockton et al. Apr 2018 A1
20180104596 Lockton et al. Apr 2018 A1
20180117464 Lockton et al. May 2018 A1
20180140955 Lockton et al. May 2018 A1
20180154255 Lockton Jun 2018 A1
20180169523 Lockton et al. Jun 2018 A1
20180190077 Hall Jul 2018 A1
20180236359 Lockton et al. Aug 2018 A1
20180243652 Lockton et al. Aug 2018 A1
20180264360 Lockton et al. Sep 2018 A1
20180300988 Lockton Oct 2018 A1
20180318710 Lockton et al. Nov 2018 A1
20190054375 Lockton et al. Feb 2019 A1
20190060750 Lockton et al. Feb 2019 A1
20190143225 Baazov May 2019 A1
20190295382 Huke Sep 2019 A1
20190304259 Joao Oct 2019 A1
20200111325 Lockton Apr 2020 A1
20210043036 Katz Feb 2021 A1
20210099759 Armstrong Apr 2021 A1
20210136456 Srinivasan May 2021 A1
20210142620 Platis May 2021 A1
20210260476 Lockton Aug 2021 A1
Foreign Referenced Citations (25)
Number Date Country
2252074 Nov 1997 CA
2252021 Nov 1998 CA
2279069 Jul 1999 CA
2287617 Oct 1999 CA
0649102 Jun 1996 EP
2364485 Jan 2002 GB
11-46356 Feb 1999 JP
11-239183 Aug 1999 JP
2000-165840 Jun 2000 JP
2000-217094 Aug 2000 JP
2000-358255 Dec 2000 JP
2001-28743 Jan 2001 JP
2000-209563 Jul 2008 JP
330242 Oct 1989 NZ
01039506 May 2001 WO
0165743 Sep 2001 WO
0203698 Oct 2002 WO
2005064506 Jul 2005 WO
2006004855 Jan 2006 WO
2006004856 Jan 2006 WO
2007002284 Jan 2007 WO
2007016575 Feb 2007 WO
2007041667 Apr 2007 WO
2008027811 Mar 2008 WO
2008115858 Sep 2008 WO
Non-Patent Literature Citations (21)
Entry
“IST and Sportal.com: Live on the Internet Sep. 14, 2004 by Clare Spoonheim”, www.isk.co.usk/NEWS/dotcom/ist_sportal.html.
“Modeling User Behavior in Networked Games byTristan Henderson and Saleem Bhatti”, www.woodworm.cs.uml.edu/rprice/ep/henderson.
Pinnacle, “The basics of reverse line movement,” Jan. 19, 2018, Retrieved on Jan. 22, 2020 , http://www.pinnacle.com/en/betting-articles educational/basics-of-reverse-line-movement/QAH26XGGQQS7M3GD.
Gambling Commission,“Virtual currencies, eSports and social casino gaming-position paper,” Mar. 2017, Retrieved on Jan. 22, 2020, http://gamblingcomission.gov.uk/PDF/Virtual-currencies-eSports-and -social-casino-gaming.pdf.
Sipko et al.,“Machine learning for the prediction of professional tennis matches,” In: MEng computing-final year project, Imperial College London, Jun. 15, 2015, http://www.doc.ic.ac.uk/teaching/distinguished-projects/2015/m.sipko.pdf.
Winview Game Producer, “Live TV Sports Play Along App WinView Games Announces Sponsorship With PepsiCo to Start This Holiday Season,” In Winview Games. Dec. 21, 2016, Retrieved on Jan. 21, 2020 from , http://www. winviewgames./press-release/live-tv-sports-play-along-app-winview-games-announces-sponsorship-pepsico-start-holiday-season/.
The International Search Report and the Written Opinion for the PCT/US2019/054859 dated Feb. 4, 2020.
The International Preliminary Report dated Apr. 22, 2021 for the application PCT/US2019/054859.
Fantasy sport-Wikipedia.pdf, https://en.wikepedia.org/w/index.php?title=Fantasy_sport&oldid=685260969(Year 2015).
Two Way TV Patent and Filing Map www.twowaytv.com/version4/technologies/tech_patents.asp.
Ark 4.0 Standard Edition, Technical Overview www.twowaytv.com/version4/technologies/tech_ark_professionals.asp.
“Understanding the Interactivity Between Television and Mobile commerce”, Robert Davis and David Yung, Communications of the ACM, Jul. 2005, vol. 48, No. 7, pp. 103-105.
“Re: Multicast Based Voting System” www.ripe.net/ripe/maillists/archives/mbone-eu-op/1997/msg00100html.
“IST and Sportal.com: Live on the Internet Sep. 14, 2004 by Clare Spoonheim”, www.isk.co.usk/NEWS/dotcom/st_sportal.html.
“Modeling User Behavior in Networked Games byTristan Henderson and Saleem Bhatti”, www.woodworm.cs.uml.edu/price/ep/henderson.
“SMS Based Voting and Survey System for Meetings”, www.abbit.be/technology/SMSSURVEY.html.
“PurpleAce Launches 3GSM Ringtone Competition”, www.wirelessdevnet.com/news/2005/jan/31/news6html.
“On the Perfomance of Protocols for collecting Responses over a Multiple-Access Channel”, Mostafa H. Ammar and George N. Rouskas, IEEE Incomform '91, pp. 1490-1499, vol. 3, IEEE, New York, NY.
Merriam-Webster, “Game” definition, <http://www.merriam-webster.com/dictionary/agme.pg.1.
Ducheneaut et al., “The Social Side of Gaming: A Study of Interaction Patterns in a Massively Multiplayer Online Game”, Palo Alto Research Center, Nov. 2004, vol. 6, Issue 4, pp. 360-369.
http://help.yahoo.com/help/us/tourn/tourn-03.html.
Related Publications (1)
Number Date Country
20220226738 A1 Jul 2022 US
Provisional Applications (1)
Number Date Country
60757960 Jan 2006 US
Continuations (9)
Number Date Country
Parent 16934886 Jul 2020 US
Child 17716311 US
Parent 16426788 May 2019 US
Child 16934886 US
Parent 15900480 Feb 2018 US
Child 16426788 US
Parent 15296983 Oct 2016 US
Child 15900480 US
Parent 14927276 Oct 2015 US
Child 15296983 US
Parent 14723363 May 2015 US
Child 14927276 US
Parent 14044173 Oct 2013 US
Child 14723363 US
Parent 13215052 Aug 2011 US
Child 14044173 US
Parent 11652240 Jan 2007 US
Child 13215052 US