On Primal-Dual Cost Allocation Schema in Multicast Communication: Combinatorial Game Theory Model
We analyze the cost allocation strategy associated with the problem of sending information from some source to a number of communication network users. A multicast routing chooses a minimum cost network that spans the source and all the receivers. The cost of such a network is distributed among its receivers who may be individuals or organizations with possibly conflicting interests. These receivers are likely to cooperate if they are charged the fair share of the cost. Providing network developers, users and owners with computable fair cost allocation solution procedures is of great importance for network management. We overview some previously published, as well as some new results, in the development of algorithmic cooperative game theory based mechanisms to efficiently compute attractive cost allocation solutions for multicast networks. We also present some open cost allocation problems and the potential contribution that combinatorial game theory models might make in the future.
Cost allocation cooperative games mathematical programming Steiner trees
Darko Skorin-Kapov
Department of Management,Marketing and Decision Sciences School of Business,Adelphi University Garden City,New York,USA
国际会议
厦门
英文
433-438
2010-10-29（万方平台首次上网日期，不代表论文的发表时间）