Determining the weights of evaluators is an important step in evaluation methods． This paper proposes a new method to determine an evaluator’s weight based on network game，and detailed discussions and validations of the solution and parameters are given． This paper considers evaluators as network nodes，and the evaluations as the links between the evaluators，which make up the edges of the network． Based on the evaluators’rating information，this paper defines the“Cooperation”and“Confliction”matrix between the evaluators as the weight matrix of the network． A network game model is established and the optimal solution is solved as the weight values． It is proved that the optimal solution is a Nash interior equilibrium solution and the only Nash equilibrium solution of this problem． Furthermore，this paper analyzes the relationship between the optimal solution and network-centricity measure，and the meaning of optimal solution in network science; namely，this paper linkes up the knowledge of decision-making theory and network science． Through mathematical proofs and simulation analyses，this paper reveals the meaning of the parameters in the model，which determine two excellent properties of the solution: “isotonicity”and“stability”． Accordingly，this paper proposes an approach on parameter selection based on the features of the data set，and applies the model in a real data set． In conclusion，the weight allocation method is practical，and it could balance the two good properties of the solutions．