In this paper we propose a distributed algorithm for jointly optimizing almost blank subframe (ABS) and cell selection bias (CSB) patterns in Long Term Evolution-Advanced (LTE-A) heterogeneous networks (HetNets). We formulate the optimization problem as an exact potential game, where a Nash equilibrium point is guaranteed to be achieved within finite number of plays. Through simulations, we are able to demonstrate the fast convergence of the algorithm, an increase in average user rate, and a tremendous improvement on the service fairness of the users.