Every finite noncooperative game can be presented as a weighted network congestion game, and also as a network congestion game with player-specific costs. In the first presentation, different players may contribute differently to congestion, and in the second, they are differently (negatively)...

We study population dynamics under which each revising agent tests each strategy k times, with each trial being against a newly drawn opponent, and chooses the strategy whose mean payoff was highest. When k = 1, defection is globally stable in the prisoner's dilemma. By contrast, when k 1 we...

A group of people with identical preferences but different abilities in identifying the best alternative (e.g., a jury) takes a vote to decide between two alternatives. The first best voting rule is a weighted voting rule that takes into account the different individual competences, and is...