Selection of cooperative partners in n-player games

We address the problem of finding the appropriate agents to interact with in n-player games. In our model an agent only requires knowledge about the payoff and identification of its partners. This information is used to update a probability distribution over candidate partners. As such, our model is applicable in any situation, be it a cooperative dilemma or a game where a Nash Equilibrium is equal to a Pareto Optimal profile