Selfish Bin Covering

Details Selfish Bin Covering Selfish Bin Covering

2009-04-14

arxiv.org/abs/0904.2061v2

Theoretical Computer Science, 412, 2011, 7049-7058

Computer Science

Computer Science and Game Theory

16 pages

Scientific paper

10.1016/j.tcs.2011.09.017

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 mainly concern is how much the lack of coordination harms the social welfare. Besides the standard PoA and PoS, which are based on Nash equilibrium, we also take into account the strong Nash equilibrium, and several other new equilibria. For each equilibrium, the corresponding PoA and PoS are given, and the problems of computing an arbitrary equilibrium, as well as approximating the best one, are also considered.

Affiliated with

Also associated with

No associations

Rating

Selfish Bin Covering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Selfish Bin Covering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Selfish Bin Covering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-98348