A distributed implementation of Dang's Fixed-Point algorithm isproposed for searching one Nash equilibrium of a finite n-persongame in normal form. In this paper, the problem consists of twosubproblems. One is changing the problem form to a mixed 0-1 linearprogramming form. This process is derived from applications of theproperties of pure strategy and multilinear terms in the payofffunction. The other subproblem is to solve the 0-1 linearprogramming generated in the former subproblem. A distributedcomputation network which is based on the Dang's Fixed-Point methodis built to solve this 0-1 linear programming. Numerical resultsshow that this distributed computation network is effective tofinding a pure-strategy Nash equilibrium of a finite n-person gamein normal form and it can be easily extended to other NP-hardproblems.
['Zhengtian Wu', 'Chuangyin Dang', 'Changan Zhu']
Searching One Pure-Strategy Nash Equilibrium Using a Distributed Computation Approach