Finding the pareto curve in bimatrix games is easy
暂无分享,去创建一个
[1] Oded Maler,et al. Approximating the Pareto Front of Multi-criteria Optimization Problems , 2010, TACAS.
[2] J. Nash. THE BARGAINING PROBLEM , 1950, Classics in Game Theory.
[3] Felix Brandt,et al. Pareto Optimality in Coalition Formation , 2011, SAGT.
[4] Mihalis Yannakakis,et al. On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[5] P. Hammond,et al. Essential Mathematics for Economic Analysis , 2002 .
[6] Vincent Conitzer,et al. New complexity results about Nash equilibria , 2008, Games Econ. Behav..
[7] Christian Glaßer,et al. Approximability and Hardness in Multi-objective Optimization , 2010, CiE.
[8] Yoav Shoham,et al. Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .
[9] Thomas Demuynck,et al. The computational complexity of rationalizing Pareto optimal choice behavior , 2011, Soc. Choice Welf..
[10] Lizhen Shao,et al. An approximation algorithm for convex multi-objective programming problems , 2011, J. Glob. Optim..
[11] Tuomas Sandholm,et al. Algorithms for Strong Nash Equilibrium with More than Two Agents , 2013, AAAI.
[12] Tuomas Sandholm,et al. On the verification and computation of strong nash equilibrium , 2013, AAMAS.
[13] Tuomas Sandholm,et al. Strong Nash Equilibrium Is in Smoothed P , 2013, AAAI.
[14] R. Aumann. Acceptable points in games of perfect information. , 1960 .
[15] Vincent Conitzer,et al. Mixed-Integer Programming Methods for Finding Nash Equilibria , 2005, AAAI.
[16] E. Kalai,et al. OTHER SOLUTIONS TO NASH'S BARGAINING PROBLEM , 1975 .
[17] Markus Wagner,et al. Approximation-Guided Evolutionary Multi-Objective Optimization , 2011, IJCAI.