REPORTS > DETAIL:
Paper:
TR05-139 | 21st November 2005 00:00
Three-Player Games Are Hard
TR05-139 Authors: Constantinos Daskalakis, Christos H. Papadimitriou
Publication: 29th November 2005 04:53
Downloads: 190
Keywords:
Abstract:
We prove that computing a Nash equilibrium in a 3-player game is PPAD-complete, solving a problem left open in our recent result on the complexity of Nash equilibria.