Combinatorial optimization games
暂无分享,去创建一个
[1] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[2] E. Kalai,et al. Finite Rationality and Interpersonal Complexity in Repeated Games , 1988 .
[3] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[4] V. Knoblauch. Computable Strategies for Repeated Prisoner's Dilemma , 1994 .
[5] Eitan Zemel,et al. Totally Balanced Games and Games of Flow , 1982, Math. Oper. Res..
[6] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[7] Carl A. Futia. The complexity of economic decision rules , 1977 .
[8] Sándor P. Fekete,et al. On the complexity of testing membership in the core of min-cost spanning tree games , 1997, Int. J. Game Theory.
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Xiaotie Deng,et al. On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..
[11] A. Neyman. Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma , 1985 .
[12] Bernhard von Stengel,et al. Fast algorithms for finding randomized strategies in game trees , 1994, STOC '94.
[13] Imma Curiel,et al. Cooperative game theory and applications , 1997 .
[14] M. Padberg. Linear Optimization and Extensions , 1995 .
[15] Toshihide Ibaraki,et al. Complexity of the Minimum Base Game on Matroids , 1997, Math. Oper. Res..
[16] Eitan Zemel,et al. Generalized Network Problems Yielding Totally Balanced Games , 1982, Oper. Res..
[17] Ehud Kalai,et al. Games, computers, and O.R. , 1996, SODA '96.
[18] U. Faigle,et al. On the complexity of testing membership in the core of min-cost spanning tree games , 1997 .
[19] N. Megiddo. On computable beliefs of rational machines , 1989 .