Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Proceedings of the twenty-second annual symposium on Principles of distributed computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selfish Routing in Capacitated Networks
Mathematics of Operations Research
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
Algorithmic Game Theory
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Approximation algorithms for a bi-level knapsack problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Approximation algorithms for a bi-level knapsack problem
Theoretical Computer Science
Hi-index | 5.23 |
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.