Equilibrium computation of the Hart and Mas-Colell bargaining model

Aumann, 1974, Subjectivity and correlation in randomized strategies, Journal of Mathematical Economics, 1, 67, 10.1016/0304-4068(74)90037-8 Avis, 1992, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, Discrete and Computational Geometry, 8, 295, 10.1007/BF02293050 Brandt, 2009, Symmetries and the complexity of pure Nash equilibrium, Journal of Computer and System Sciences, 75, 163, 10.1016/j.jcss.2008.09.001 Chazelle, 1993, An optimal convex hull algorithm in any fixed dimension, Discrete and Computational Geometry, 10, 377, 10.1007/BF02573985 Cao, 2012, Bargaining and cooperation in strategic form games with suspended realizations of threats, Social Choice and Welfare Chen, X., Deng, X., 2005. Settling the Complexity of 2-Player Nash-Equilibrium. TR05-140, ECCC. Goh, 2002 Hart, 1996, Bargaining and value, Econometrica., 64, 357, 10.2307/2171787 Hart, 2010, Bargaining and cooperation in strategic form games, Journal of the European Economics Association, 8, 7, 10.1162/jeea.2010.8.1.7 Karmarkar, 1984, A new polynomial-time algorithm for linear programming, Combinatorica, 4, 373, 10.1007/BF02579150 Koutsoupias, E., Papadimitriou, C.H., (1999). Worst-case equilibria. In: Proc. 16th Annual Symp. on Theoretical Aspects of Computer Science, pp. 404–413. Kintali, S., Poplawski, L.J., Rajaraman, R., Sundaram, R., Teng, S., 2009. Reducibility Among Fractional Stability Problems. arXiv:0904.1435v1. Matsui, 2001, NP-completeness for calculating power indices of weighted majority games, Theoretical Computer Science, 263, 305, 10.1016/S0304-3975(00)00251-6 Nash, 1953, Two-person cooperative games, Econometrica, 21, 128, 10.2307/1906951 Nisan, 2007 Osborne, 1994 Papadimitriou, 2007, The complexity of finding Nash equilibria, 29 Seidel, 1997, Convex hull computations, 361 Schulz, A.S., Moses, N.S., 2003. On the performance of user equilibria in traffic networks. in: Proc. 14th Symp. Discrete Algorithms, pp. 86–87.