A simultaneous congestion game: There are two drivers, one who will travel from A to C, the other from B to D. Assume each road AB, AD, CD, BC is un-oriented and can be used in any direction. Moreover each road is labeled (x, y), where x is the cost to any driver who travels the road alone, and y is the cost to each driver if both drivers use this road. Write the game in matrix form, and find all of the pure Nash equilibria. A (10, 15) D (13, 16) (21, 14) B (7, 23) C