Generalised Nash bargaining solution in multiplayer games on graphs

The presentation is about the algorithm of Jon Kleinberg and Éva Tardos for multiplayer coalition games. Its purpose is to create two-person coalitions and to divide the gain between the players. These games are represented on graphs, where the nodes correspond to the players and the edges correspond to the possible coalitions. The algorithm result is the set of so called balanced outcomes, defined by the Nash bargaining solution. In the case of two-person games, the outcome of the algorithm is equal to the Nash bargaining solution.