Location of Repository

Selfish Bin Covering

By Zhigang Cao and Xiaoguang Yang

Abstract

In this paper, we address for the first time the selfish bin covering problem, which is greatly related both to the famous bin covering problem in the field of combinatorial optimization, and to the classic weighted majority game in coalitional game theory. As in the other models of algorithmic game theory, what we mainly concern in this model is how the decentralized decision making affects the social profit. Besides the standard PoA and PoS, which are based on Nash equilibrium, we also take into account the strong Nash equilibrium, and define several new equilibria. For each equilibrium, the corresponding PoA and PoS are given. The problem of computing an equilibrium, as well as computing a good one (in the sense that with a large social profit), is also considered

Topics: Bin covering, weighted majority games, price of anarchy
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.315.5780
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/0904.2061... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.