Technical perspective: The rewards of selfish mining

We consider general resource assignment games involving selfish users/agents in which users compete for resources and try to be assigned to those which maximize their own benefits (e.g., try to route their traffic through links which minimize the ...

We consider a strategic variant of the knapsack problem: the items are owned by agents, and agents can misrepresent their sets of items—either by hiding items (understating), or by reporting fake ones (overstating). Each agent's utility equals the total ...

In this paper, we address the selfish bin covering problem, which is greatly related both to the bin covering problem, and to the weighted majority game. What we are mainly concerned with is how much the lack of central coordination harms social ...