Paper Info
Title
Two-group knapsack game
Abstract
This paper presents a ''two-group knapsack game''. A number of investors colligate into two groups to bid on a common pool of potential projects. Each investor has his/her own budget limit and a cost estimation for undertaking each possible project. Each group represents a power by its market share. Associated with each project, there is a potential profit that can be realized. Investors in the same group hold an internal agreement of putting the group's collective interest ahead of the individual's interest and not bidding on the same project by more than one investor in the group. The profit of a particular project can be wholly taken by the sole bidder or shared proportionally by two bidders in different groups according to their group power. The objective of each group may be based not only on its own group profit but also on the other group's profit. Assuming that each investor acts in a selfish manner with the best response to optimize its group's objective subject to the budget constraint, we show that a pure Nash equilibrium exists under certain conditions. We also have some interesting findings of the ''price of anarchy'' (the ratio of the worst Nash equilibrium to the social optimum) associated with a simplified version of the two-group knapsack game with three investors.
Year
DOI
Venue
2010
10.1016/j.tcs.2009.12.002
Theor. Comput. Sci.
Keywords
DocType
Volume
potential profit,investors colligate,Game theory,Price of anarchy,investor act,group power,possible project,Knapsack problem,Nash equilibrium,two-group knapsack game,different group,own group profit,potential project,particular project,Two-group knapsack game
Journal
411
Issue
ISSN
Citations 
7-9
Theoretical Computer Science
2
PageRank 
References 
Authors
0.43
7
3
Name
Order
Citations
PageRank
Zhenbo Wang1599.43
Wenxun Xing29610.67
Shu-Cherng Fang3115395.41