👩💻 Join our community of thousands of amazing developers!
The following is an open research question for which I would be happy to have an answer. Please contact me if you have ideas. The model is in cooperative matrix games and the question is about hardness of computation of equilibria. In cooperative one-shot games, there is a matrix with payoff for single actions from each of the players. In contrast to zero-sum games where one player pays the other, each player gets the entry of the matrix. Players can not communicate before the game. The follow...