Equilibrium Computation of the Hart and Mas-Colell Bargaining Model

The 8-th problem raised by [Hart, S., Mas-Colell, A., 2010. Bargaining and cooperation in strategic form games. Journal of the European Economics Association 8 (1), 7–33], is solved. To be specific, I show that the set of SP equilibria can be determined by a finite number of systems of linear inequalities, which are efficiently solvable when there are two players. This is more or less surprising because the Hart and MasColell bargaining model and the SP equilibrium both seem to be rather complicated, and it is well known that an arbitrary Nash equilibrium is hard to compute, even when there are only two players. Using this algorithm, it is shown that players of Prisoners’ Dilemma can cooperate to some extent in the Hart and Mas-Colell bargaining, and full cooperation is attainable as ρ, a parameter of this model, approaches to 1. Quantitative efficiency, i.e. price of anarchy, is also analyzed. © 2013 Elsevier B.V. All rights reserved.

[1]  David Avis,et al.  A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra , 1992, Discret. Comput. Geom..

[2]  Andreas S. Schulz,et al.  On the performance of user equilibria in traffic networks , 2003, SODA '03.

[3]  R. Aumann.  Subjectivity and Correlation in Randomized Strategies , 1974 .

[4]  S. Hart,et al.  Bargaining and Value , 1996 .

[5]  Xiaotie Deng,et al.  Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[6]  S. Hart,et al.  Bargaining and Cooperation in Strategic Form Games , 2010 .

[7]  J. Nash.  Two-Person Cooperative Games , 1953 .

[8]  Felix Brandt,et al.  Symmetries and the complexity of pure Nash equilibrium , 2009, J. Comput. Syst. Sci..

[9]  C. Papadimitriou.  Algorithmic Game Theory: The Complexity of Finding Nash Equilibria , 2007 .

[10]  C Goh,et al.  Duality in Variational Inequalities , 2002 .

[11]  Raimund Seidel.  Convex Hull Computations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[12]  Bernard Chazelle,et al.  An optimal convex hull algorithm in any fixed dimension , 1993, Discret. Comput. Geom..

[13]  Zhigang Cao,et al.  Bargaining and cooperation in strategic form games with suspended realizations of threats , 2012, Soc. Choice Welf..

[14]  Tomomi Matsui,et al.  NP-completeness for calculating power indices of weighted majority games , 2001, Theor. Comput. Sci..

[15]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[16]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.