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...

We study the problem of allocating m identical items among nm agents with unit demand and private value for consuming the good. We allow payments and focus on dominant-strategy implementation. In the absence of an auctioneer who can absorb payments collected from the agents, the payments must be...

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...