In defining n-player games, game theorists usually provide a definition that allow for any (finite) number of players.
One might define an n-player Prisoner's Dilemma where a single defection results everyone else getting the sucker's payoff.
Alternatively, it might take certain amount of defection before the cooperators receive the sucker's payoff.
Other algorithms, like maxn, are required for traversing the game tree to optimize the score for a specific player.
[3] This game theory article is a stub.