In this paper, a modified distributed Nash equilibrium seeking problem with input saturation has been investigated. The payoff function of each player is related to the communication topology, which is closer to the actual scenes. The sigmoid function is utilized to limit the range of the input. Through the network communication between players and the gradient of the players’ payoff functions, the finite-time and fixed-time distributed Nash equilibrium seeking protocols with input saturation are given. Using the Lyapunov stability analysis, it is determined that the action of each player converges to the Nash equilibrium if all the players update their action according to the proposed algorithms. The numerical simulations are also provided to testify the algorithms.