One of its cases was the subject of a tournament hosted by Robert Axelrod at the University of Michigan consisting of computer-implemented personalities representing the players.  
Its multi-bodied generalization is known as the free rider problem.  One of its cases was the subject of a tournament hosted by Robert Axelrod at the University of Michigan consisting of computer-implemented personalities representing the players.  Each algorithm attempted to maximize its payoff matrix, a tool useful to game theorists, with the winner being the simple program tit-for-tat, which cooperated with those that didn't betray it.  FTP, name this problem of game theory that illustrates the difficulties that arise in noncooperative games by utilizing a deal offered to two potential criminals.
Its multi-bodied generalization is known as the free rider problem.  
prisoner's dilemma