home  
The Eleventh Annual Game Design Think Tank Project Horseshoe 2016 
Group Report: Game Theory Applied to Actual Games: The Nash Equilibrium Payoff Matrix as a Model for Multiplayer Behavior 
Participants: A.K.A. "The Sleeping Matrices"  
Michael Austin, Hidden Path Entertainment  Jason Vandenberghe, Ubisoft  
Kyle Brink, Mercenary Technology  Link Hughes, ArenaNet  
Crystin Cox, ArenaNet  Mario Izquierdo, Twitch  
Tim Fowers, Fowers Games  
Facilitator: Zack Hiwiller, Full Sail University  
download the PDF  
Problem Statement
Players often play very differently in multiplayer games than they do in singleplayer games. A model for exactly how these changes manifest, and which provides some predictive power when applied to a known multiplayer game system, would be of great value in creating sustainably entertaining multiplayer games. Game theory provides a possible answer in the reward matrix used to determine a Nash equilibrium. By exploring the applicability of this model to multiplayer gameplay, with known models of player motivation in hand, we determine what visibility it might provide into player behavior as well as the implications of implementing such a model in practice. Payoff Matrices and the Nash Equilibrium A payoff matrix depicts the possible benefits to each player in a game. Each position in the matrix is a possible game state consisting of a specific set of player choices. The payoffs are numerical weights given to the perceived benefit of making that choice. A Nash Equilibrium is one such state where there is no incentive for any player to change strategies. In such a state, any deviation from the current strategy by any player provides lower expected payoffs. In the classic Prisoner’s Dilemma, for example, there is a Nash equilibrium at the state of both prisoners betraying one another, because for either player to choose cooperation worsens that player’s outcomes. This short video from Khan Academy explains these concepts well. A Cornell student blog post from 2011 views the set of player choices in a teambased shooter as a form of Prisoner’s Dilemma where the choices are “play to win” or “play for fun.” The payoff matrix in this post presumes a) the greatest payoff lies in winning, achievable only through team play; and b) playing for fun precludes both team play and winning. This is clearly not always the case; for example, playing to win and playing for fun are not mutually exclusive choices for players whose primary fun comes from winning. But the idea that the choices other players make affects our own payoff options, that this can include whether or not we have fun, and that this can all be modeled using payoff matrices, is salient. Heterogeneous Payoff Matrices In games, a significant portion of the payoff is in the form of enjoyment. Therefore, the game’s rules do not provide a full picture of the player payoff matrix until they are informed by player motivations and preferences. The Bayesian Nash Equilibrium In situations where player payoff matrices differ, those payoff matrices can be viewed as player “types” which predict player choices in a game, and players do not have perfect knowledge of what their fellow players’ types are (though they may have some idea of the likelihood or prevalence of various player types). In game theory, this is known as a Bayesian Game. Conceptually, this is quite similar to how gamers approach multiplayer games. They have some experience with the gaming community as a whole, and with their friends and frequent compatriots (guildmates) in particular, which provides an informal mental model of player types and probabilities which gamers (consciously or unconsciously) use to modify their own play styles. Player Type Models Applying payoff matrices to multiplayer games, then, demands that we have a means of modeling player types in our payoff matrices. We considered several strong candidates. Big 5 / Domains of Play Jason Vandenberghe’s Domains of Play translates the Big 5 (OCEAN) motivation theory from psychology into a form that applies to gamer motivations. It measures the core motivations of players across 30 facets. SelfDetermination Theory and PENS Human beings are motivated by feelings of competence, autonomy, and relatedness. These three motivations are the core of SelfDetermination Theory. SDT is the basis for the PENS (Player Experience of Need Satisfaction) model of player motivation. Quantic Foundry’s Gamer Motivation Model Quantic Foundry analyzed their large data set from the Gamer Motivation Profile survey, and created the Gamer Motivation Model to describe the clusters of motivations they found. The model groups player motivations into Action, Social, Mastery, Achievement, Immersion, and Creativity (with subcategories in each). Matrices Within Matrices Putting together comprehensive payoff matrices for multiple players, across all the possible game action choices, is far beyond the scope of this conference. In fact, to model it most accurately, each game action choice node in a game’s overall payoff matrix should itself be populated with a payoff matrix of all the possible motivations a given player could be feeling from that choice. Two players could have vastly different reasons for liking a particular choice, and end up liking it the same  but you could not know that without having the full model in place. In looking at a prototype of such a model, it becomes clear that a practical approach requires an extant body of game analytics describing the possible trackable game choices. This can then be the framework for player payoff matrices, populated with payoff values weighted according to known player motivation types (and the prevalence of each, from existing player analytics data) to predict probable outcomes and make design decisions. In effect, this gives the game designer a level of specific insight necessary to achieve Bayesian Game levels of knowledge about player types and probabilities. The Game is the Variable In putting such a model together, it becomes clear that  from the game designer’s perspective  player types and motivations are the constant, and the game is the variable. The players bring their motivations to us, and we bring our games to them. In the following simplified matrix (using three Gamer Motivations and three broad strategies), we see that as each player type encounters different player choices by teammates, they receive different levels of satisfaction (payoff). The game cannot change the player type, only the support for different choices and extrinsic rewards for those choices. The intrinsic reward is largely provided by the player’s personality. Thus, when player behavior begins to settle into equilibriums that are detrimental to the game (for example, leading to mass abandonment), we as designers should not look to change players, but instead to change the game’s payoffs as seen through the player type lens. Multiplayer Games are Iterative Bayesian Games Each individual choice in a multiplayer game is itself a Bayesian game. The player chooses based on his or her personal payoff matrix, informed by knowledge of what other players are likely to do. Other players do the same. Then, as those choices are observed by all, each player makes another choice based on new understandings of what other players will do. Importantly, players will act against their “type” if they believe the actions of other players will reward them enough for doing so. Testing the Predictive Power of a PlayerTyped Payoff Matrix in a Multiplayer Game As a backoftheenvelope test, we built a payoff matrix for player choices among three known players and two basic game choices in Diablo III multiplayer. The players, J, K, and C, can choose to “rush,” heading directly for objectives and bosses and overcoming them, or they can “explore,” clearing out each map thoroughly. Rapport represents the additional payoff for each player in doing what someone else is also doing. This turned out to be instrumental in capturing the real cooperative game dynamics among friends. Note that among strangers, these same players might have different Rapport payoffs as they do when playing among friends. (The payoff values in this chart were filled in by the actual players themselves, or by people who knew them very well.)
This creates the following payoff matrix when all players are mapped against each other.
Predictions from this model:
All of the above predictions match actual observed play among these three players. This one anecdotal exploration suggests that, as long as the model is accurate and captures the intrinsic as well as extrinsic payoffs, it could be predictive. Closing Thoughts The lens of Nash equilibriums and reward structures is really useful to game designers as a means of discussing the behavior of players in multiplayer games. While creating a comprehensive payoff matrix model for a multiplayer game seems on the surface to have merit, a truer test of this model would require significant effort and access to a body of player data from an existing multiplayer game. Using a player dataset from an existing multiplayer game, and a Gamer Motivation distribution across that player base, one could look back over past player behavior arcs and see how much players’ actual behavior diverges from that predicted by the Gamer Motivation Model alone. Then one could examine that delta to see how it has developed over time, and map that change to changes in aggregate player behavior. One could seek correlations between rises in one set of player choices and declines in others to spot where player interaction is changing the payoff for other players, driving them to make different choices (taking into account the timing of game updates to see where game design changes may be driving these behavior deltas). Additional Points to Consider Keep these in mind when approaching game design from the perspective of multiplayer payoff matrices and gamer motivations.

Copyright 20002017, Fat Labs, Inc., ALL RIGHTS RESERVED 