Abstract
A multi-agent symmetric dilemma game is studied, in which the agent possesses the two pure strategies of defiance and compliance. For total defiance each agent is fined for three conditional units, while the cost of complying with system requirements is set to one conditional unit. Whichever the number of agents is, every agent has the best defiance strategy, at which the agents’ losses are identically minimized. This strategy is a mixed one, which is a nonzero probability of defiance. The probability can be approximated by using the bisection method with any accuracy desired, where the left and right endpoints for the method are 0 and the reciprocal of the number of agents decreased by 1, respectively.