Computational complexity of fixed points and intersection points

On algorithms for discrete and approximate brouwer fixed points

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Matching algorithmic bounds for finding a Brouwer fixed point

Journal of the ACM (JACM)

On the Complexity of Nash Equilibria and Other Fixed Points

SIAM Journal on Computing

Survey: Equilibria, fixed points, and complexity classes

Computer Science Review