| Abstract | 第1-7页 |
| Acknowledgements | 第7-8页 |
| Table of Contents | 第8-10页 |
| List of Figures | 第10-11页 |
| List of Tbules | 第11-12页 |
| Chapter 1 Introdution | 第12-22页 |
| ·Background and motivation | 第12-15页 |
| ·Background | 第12-14页 |
| ·Motivation | 第14-15页 |
| ·Literature review | 第15-19页 |
| ·The computation of Nash equilibrium | 第15-18页 |
| ·Review of integer programming | 第18-19页 |
| ·Thesis outline and contributions | 第19-22页 |
| Chapter 2 Preliminary | 第22-28页 |
| ·Polynomial reduction of an n-person game to a three-person game | 第22-23页 |
| ·An approximation of the multilinear term | 第23-27页 |
| ·Summary | 第27-28页 |
| Chapter 3 Computing all pure-strategy Nash equilibria problem | 第28-48页 |
| ·Converting the problem to a mixed O-1 linear programming | 第28-39页 |
| ·Numerical Results | 第39-44页 |
| ·Summary | 第44-48页 |
| Chapter 4 Computing all mixed-strategy Nash equilibria problem | 第48-64页 |
| ·Converting the problem to a mixed integer linear programming | 第48-60页 |
| ·Numerical Results | 第60-63页 |
| ·Summary | 第63-64页 |
| Chapter 5 Distributed implementation of the fixed-point method | 第64-80页 |
| ·Dang and Ye's fixed-point iterative method | 第64-67页 |
| ·Some details of the distributed implementation | 第67-70页 |
| ·The computation of a single pure-strategy Nash equilibrium problem | 第70-71页 |
| ·The computation of the market split problem | 第71-75页 |
| ·Reformulation of the Problem based on Lattice Basis Reduction | 第71-74页 |
| ·Numerical results | 第74-75页 |
| ·The computation of the knapsack feasibility problem | 第75-79页 |
| ·Summary | 第79-80页 |
| Chapter 6 Concluding Remarks | 第80-82页 |
| ·Summary | 第80-81页 |
| ·Future Work | 第81-82页 |
| Reference | 第82-94页 |
| Curriulum Vitae | 第94-96页 |
| 中文简介 | 第96-101页 |
