Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Balanced outcomes in social exchange networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Behavioral experiments in networked trade
Proceedings of the 9th ACM conference on Electronic commerce
Local dynamics in bargaining networks via random-turn games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Optimizing social welfare for network bargaining games in the face of unstability, greed and spite
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Bargaining for revenue shares on tree trading networks
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We study the concept of bargaining solutions, which has been studied extensively in two-party settings, in a generalized setting involving arbitrary number of players and bilateral trade agreements over a social network. We define bargaining solutions in this setting, and show the existence of such solutions on all networks under some natural assumptions on the utility functions of the players. We also investigate the influence of network structure on equilibrium in our model, and note that approximate solutions can be computed efficiently when the networks are trees of bounded degree and the parties have nice utility functions.