We present two simple search methods for computing a sample Nash equilibrium in a normal-form game: one for 2-player games and one for n-player games. Both algorithms bias the search towards supports that are small and balanced, and employ a backtracking procedure to efficiently explore these...

We consider the problem of dividing a homogeneous divisible good among n players. Each player holds a private non-negative utility function that depends only on the amount of the good that he receives. We define the fair share of a player P to be the average utility that a player could receive...

We define a new class of games, congestion games with load-dependent failures (CGLFs). In a CGLF each player can choose a subset of a set of available resources in order to try and perform his task. We assume that the resources are identical but that players' benefits from successful completion...