Abstract
The traditional non-cooperative game theory is neither Pareto optimal nor fair. It will lead to the loss of efficiency among the homogeneous network services. In this paper, a cooperative game theory based network resource negotiation model carried on by agents is presented. Compared with previous research, the current work focuses on efficiency and fairness. Its chief aim is to utilize cooperation and aggregated of the homogeneous services. The model is based on the idea of the asymmetric NBS (Nash Bargaining Solution) and coalitional game from cooperative game theory. Then a two-stage negotiation algorithm is presented. The homogeneous network services coalition reaches agreement by multi-lateral negotiation using the algorithm. Finally the comparison analysis results demonstrate the advantages of the model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Altman, E.: Flow control using the theory of zero-sum Markov games. IEEE Transactions on Automatic Control 39, 814–818 (1994)
Altman, E.: A Markov game approach for optimal routing into a queue-ing network. Annals of Dynamic Games 5, 359–376 (1999)
Kurose, J., Simha, R.: A microeconomic approach to optimal resource allocation in distibuted computer systems. IEEE Trans. On Computers 38(5), 705–717 (1989)
La, R.J., Anantharam, V.: Window-based congestion control with heterogeneous users. In: Proc. IEEE infocom2001, Ankorage, Alaska (2001)
Nash, J.: The bargaining problem. Econometrica 18, 155–162 (1950)
Dubey, P.: Inefficiency of Nash equilibria. Math. Oper. Res. 11, 1–8 (1986)
Kelly, F.P.: Charging and rate control for elastic traffic. European Trans. on Telecom. 8, 33–37 (1998)
Mazumdar, R.R., Yaiche, H., Rosenberg, C.: A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Trans. on Networking 8(5), 667–677 (2000)
Mazumdar, R., Mason, L.G., Douligeris, C.: Fairness in network optimal flow control: optimality of product forms. IEEE Trans. on Comm. 39, 775–782 (1991)
Rextin, A.T., Irfan, Z., Uzmi, Z.A.: Games networks play a game theoretic approach to networks. In: Proc. 7th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 451–456 (2004)
Rubinstein, A.: Perfect equilibrium in a bargaining model. Econometrica 50, 97–109 (1982)
Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)
Stefan, N.: Bilateral Bargaining: Theory and Applications. Lecture Notes in Economics and Mathematical Systems, vol. 518. Springer, Heidelberg (2002)
Faratin, P., Sierra, C., Jennings, N.R.: Negotiation Decision Functions for Autonomous Agents. Robotics and Autonomous Systems 24, 159–182 (1998)
Shapley, L.: On balanced sets and cores. Naval Research Logistics Quarterly 14, 453–460 (1967)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bian, ZA., Luo, JZ. (2007). A Cooperative Game Theory Based Coalitional Agent Negotiation Model in Network Service. In: Shen, W., Luo, J., Lin, Z., Barthès, JP.A., Hao, Q. (eds) Computer Supported Cooperative Work in Design III. CSCWD 2006. Lecture Notes in Computer Science, vol 4402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72863-4_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-72863-4_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72862-7
Online ISBN: 978-3-540-72863-4
eBook Packages: Computer ScienceComputer Science (R0)