糖心TV

Skip to main content Skip to navigation

糖心TV Complexity Science Events

Complexity Centre and MathSys CDT events carry priority over room D1.07.

To book D1.07 please email Sheetal dot Sharma at warwick dot ac dot uk

Please note that your event booking is for D1.07 only. The adjacent common room is a private area for the MathSys Centre that cannot used as part of your booking.

Wednesday, March 16, 2016

Select tags to filter on
Tue, Mar 15 Today Thu, Mar 17 Jump to any date

How do I use this calendar?

You can click on an event to display further information about it.

The toolbar above the calendar has buttons to view different events. Use the left and right arrow icons to view events in the past and future. The button inbetween returns you to today's view. The button to the right of this shows a mini-calendar to let you quickly jump to any date.

The dropdown box on the right allows you to see a different view of the calendar, such as an agenda or a termly view.

If this calendar has tags, you can use the labelled checkboxes at the top of the page to select just the tags you wish to view, and then click "Show selected". The calendar will be redisplayed with just the events related to these tags, making it easier to find what you're looking for.

 
-
Export as iCalendar
MSc and EM weekly student meeting
D1.07 Complexity Science

Stefan Grosskinsky

Heather Robson

-
Export as iCalendar
MathSys Open Day
Complexity Common Room

Robert MacKay

Yulia

Heather

-
Export as iCalendar
MA4G4L Introduction to Theoretical Neuroscience
D1.07

Magnus Richardson

-
Export as iCalendar
Complexity Forum: Doyne Farmer (INET, Oxford)
D1.07
Complex dynamics of evolutionary games
When are do the strategies of the players of a game converge to equilibrium when the players have to learn their strategies? In this talk we investigate this for generic games when the players use variations on reinforcement learning. In some cases players converge quickly to a unique fixed point equilibrium, but in others they converge to limit cycles or chaotic attractors, in which their strategies wander around the space of possibilities without ever settling down. We show that the outcome depends on both properties of the game and properties of the learning strategies. The results suggest that it may be possible to predict the qualitative outcome with a few simple rules, reminiscent of the Reynolds number in fluid turbulence.

--

Catered Lunch

-
Export as iCalendar
PhD group meeting
D1.07 Complexity Science

Gareth Alexander

Stefan Grosskinsky

Placeholder

Let us know you agree to cookies