Transformation of a Product Buchi Game to a Parity Game
I will assume that by "Product Buchi game", you mean the (synchronous) product of a deterministic Buchi automaton and some kind of plant or deterministic finite automaton that represents the rules of the game (so to speak) apart from the specification. 

You then translated this product between the Buchi automaton and a deterministic automaton to a game by assigning atomic propositions (of which the actions of the two players are composed) or characters to the two players. You have a Buchi game then. Because in your question you state that you want to represent a Product Buchi game as a parity game, I will assume that you have this product Buchi game already.

Translating a Buchi game to a parity game is now easy: Let $\mathcal{F}$ be the set of accepting states/vertices/positions in the Buchi game. Then, you can replace $\mathcal{F}$ by the following coloring function (for every vertex $v$):

$$
c(v) = \begin{cases} 1 &amp; \text{ if } v \in \mathcal{F} \\
0 &amp; \text{ otherwise} \end{cases}
$$

This will give you a parity game in which the player who was formerly the Buchi player can ensure that the highest color visited infinitely often is odd if and only if it is able to win the Buchi game from which the parity game was translated.

If your definition of parity game reasons about the lowest color visited infinitely often, swap the 0 and 1 in the formula above. Likewise, add 1 to every number if the player should make sure that the highest/lowest color should be even. There are multiple definitions of parity game winning in the literature, which are however all equivalent.