The　NashCC-Q　learning　algorithm　was　proposed　to　resolve　traffic　signal　coordination　control　for　two　adjacent　intersections.　The　problem　of　coordination　control　for　two　adjacent　intersections　is　the　type　of　two-player　general　sum　cooperative　game　in　Game　theory.　Therefore,　according　to　the　Nash-Q　learning　algorithm,　the　update　of　the　Q-Value　function　was　based　on　Nash　bargaining　solution,　furthermore,　coordination　control　for　two　adjacent　intersections　was　realized.　The　validity　of　this　method　was　proved　by　Paramics　simulation　software.