Competition for resources - The equilibrium existence problem in congestion games

Add to your list(s) Download to your calendar using vCal

• Max Klimm (TU Berlin)
• Monday 18 November 2013, 15:00-16:00
• MR15, Centre for Mathematical Sciences, Wilberforce Road, Cambridge.

If you have a question about this talk, please contact Felix Fischer.

Weighted congestion games are an important class of noncooperative games that constitute an elegant model for the resource usage by selfish users, i.e. in traffic networks. Unfortunately, they need not possess a pure Nash equilibrium, in general. We give a complete characterization of the maximal sets of cost functions that guarantee the existence of a pure Nash equilibrium. Further implications of this characterization are discussed.

This talk is part of the Optimization and Incentives Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Economics and Computer Science Talks
• Hanchen DaDaDash
• Interested Talks
• MR15, Centre for Mathematical Sciences, Wilberforce Road, Cambridge
• Optimization and Incentives Seminar
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.