In part I of the paper the problem of distributing potential games over undirected graphs was formulated. A restricted information potential game was designed using state-based formulation. Here, learning Nash equilibria for this game is studied. An algorithm is developed with mainly two phases, an estimation phase and a learning phase. The setting allows for available learning methods of the full information game to be directly incorporated in the learning phase. The result matches the outcome (i.e. converges to the same equilibria) of the full information game. In addition, the design takes into account considerations of convergence time, and synchrony of actions update. The developed distributed game and learning algorithm are used to solve a platoon matching problem for heavy duty vehicles. This serves two objectives. First, it provides a motivation for the presented gaming results. Second, the problem addressed can facilitate platoon matching where it provides a basis for an on-the-go strategy.