Consider Following Two Player Congestion Game Ai R R2 Player Select Either Resource R1 R2 Q37245032

(a) Consider the following two player congestion game: ·Ai {rı, r2): (a player can select either resource r1 or r2 but not both) Write down the payoff matrix for this two player routing game. Prove that a pure Nash equilibrium must exist irrespective of the congestion functions for route rı and r2 (b) Consider any arbitrary routing game with with n players: r1, …, Tm N-1.,n Consider the following two potential functions rER Let

OR

 

OR