Bargaining theory with applications
Bargaining theory with applications
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Network design with weighted players
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Strong equilibrium in cost sharing connection games
Proceedings of the 8th ACM conference on Electronic commerce
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the value of coordination in network design
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Designing networks with good equilibria
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Polynomial calculation of the Shapley value based on sampling
Computers and Operations Research
Socially-aware network design games
INFOCOM'10 Proceedings of the 29th conference on Information communications
Hi-index | 0.00 |
The Network Formation problem has received increasing attention in recent years. Previous works have addressed this problem considering almost exclusively networks designed by selfish users, which can be consistently suboptimal. This paper addresses the network formation issue using cooperative game theory, which permits to study ways to enforce and sustain cooperation among agents. Both the Nash bargaining solution and the Shapley value are widely applicable concepts for solving these games. However, we show that the Shapley value presents three main drawbacks in this context: (1) it is non-trivial to define meaningful characteristic functions for the cooperative network formation game, (2) it can determine for some players cost allocations that are even higher than those at the Nash Equilibrium (i.e., if players refuse to cooperate), and (3) it is computationally very cumbersome. For this reason, we solve the cooperative network formation game using the Nash bargaining solution (NBS) concept. More specifically, we extend the NBS approach to the case of multiple players and give an explicit expression for users' cost allocations. Furthermore, we compare the NBS to the Shapley value and the Nash equilibrium solution, showing its advantages and appealing properties in terms of cost allocation to users and computation time to get the solution. Numerical results demonstrate that the proposed Nash bargaining solution approach permits to allocate costs fairly to users in a reasonable computation time, thus representing a very effective framework for the design of efficient and stable networks.