Computing an Element in the Lexicographic Kernel of a Game
暂无分享,去创建一个
[1] D. Schmeidler. The Nucleolus of a Characteristic Function Game , 1969 .
[2] Nimrod Megiddo,et al. Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree , 1978, Math. Oper. Res..
[3] M. Maschler,et al. Stable Sets and Stable Points of Set-Valued Dynamic Systems with Applications to Game Theory , 1976 .
[4] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.
[5] R. Stearns. Convergent transfer schemes for $N$-person games , 1968 .
[6] Daniël Paulusma,et al. Matching Games: The Least Core and the Nucleolus , 2003, Math. Oper. Res..
[7] David M. Stein,et al. An Asymptotic, Probabilistic Analysis of a Routing Problem , 1978, Math. Oper. Res..
[8] Jeroen Kuipers,et al. On the computation of the nucleolus of a cooperative game , 2001, Int. J. Game Theory.
[9] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[10] Morton D. Davis,et al. The kernel of a cooperative game , 1965 .
[11] M. Justman. Iterative processes with „nucleolar“ restrictions , 1977 .
[12] U. Faigle,et al. On the complexity of testing membership in the core of min-cost spanning tree games , 1997 .
[13] Ulrich Faigle,et al. Algorithmic principles of mathematical programming , 2002 .
[14] Moshe Yarom. The Lexicographic Kernel of a Cooperative Game , 1981, Math. Oper. Res..