Representation of Finite Games as Congestion Games



Friday, 19 January 2018, 17:15 to 18:45


  • D-405 (D-Block Seminar Room)


A congestion game is a game where the cost of a player for using a resource depends on all the players using that resource. Network congestion games are a natural model for situations where different individuals use resources in a network e.g., road networks, data networks etc. Since every player have finite number of strategies, this is a finite game. In this talk, we will show that every finite game can be represented as a weighted congestion game. This has been proved by Milchtaich.

Ref: Representation of finite games as congestion games - Milchtaich