On the core of cooperative queueing games
暂无分享,去创建一个
[1] Lloyd S. Shapley,et al. On balanced sets and cores , 1967 .
[2] E. Messerli. B.S.T.J. brief: Proof of a convexity property of the erlang B formula , 1972 .
[3] W. Whitt,et al. Resource sharing for efficiency in traffic systems , 1981, The Bell System Technical Journal.
[4] Yves Sprumont. Population monotonic allocation schemes for cooperative games with transferable utility , 1990 .
[5] Carmen Herrero,et al. Optimal sharing of surgical costs in the presence of queues , 2004, Math. Methods Oper. Res..
[6] Y. Gerchak,et al. Capacity Pooling and Cost Sharing among Independent Firms in the Presence of Congestion , 2007 .
[7] Justo Puerto,et al. Cooperation in Markovian queueing models , 2008, Eur. J. Oper. Res..
[8] S. Benjaafar,et al. Capacity Sharing and Cost Allocation among Independent Firms in the Presence of Congestion , 2009 .
[9] Moshe Haviv,et al. Cooperation in Service Systems , 2010, Oper. Res..
[10] Marco Slikker,et al. Analysis of resource pooling games via a new extension of the Erlang loss function , 2011 .