Eliciting Fairness in N-Player Network Games through Degree-Based Role Assignment

Algorithm 1

Pseudo-code of the main cycle of our simulations. We perform 100 runs over 10 different networks of each type (BA and DMS) with generations per run.

	Initialize all
	For To do Main cycle of interaction and strategy update:
	For To Select agent to update:
	/∗ Sample two neighbors of the population
	(agent to update)
	(agent to be imitated)
	if then Mutation:
	else Imitation:
	fitness()
	fitness()
	If then
	+ imitation error
	+ imitation error