Home > Department of Mathematics > Seminars > Seminar on Combinatorics, Games and Optimisation
How to contact us

Department of Mathematics
Columbia House
London School of Economics
Houghton Street
London WC2A 2AE, UK

 

Email: maths.info@lse.ac.uk
Tel: +44(0)207 955 7732/7925
Follow us on Twitter: Twitter
Read our research blog:  http://blogs.lse.ac.uk/maths/
Connect with us on LinkedIn: LinkedIn
Watch our videos on YouTube: Icon of the YouTube logo

 

Click here for information on how to get to LSE using public transport and maps of the campus

Seminar on Combinatorics, Games and Optimisation

Below you'll find the programme for the Seminar on Combinatorics, Games and Optimisation (a joining together of the former Seminar on Discrete Mathematics and Game Theory and the former Seminar on Operations Research).

This semianr series covers many of the research areas in the Department: discrete mathematics, algorithms, game theory and operational research.

Unless stated below, this Seminar normally takes place:

Questions, suggestions, etc., about the seminar can be forwarded to the seminar administrator, by sending an e-mail to: seminar@maths.lse.ac.uk.

Upcoming Speakers:

SUMMER TERM

Wednesday 24 May - Sylvain Sorin (University Pierre and Marie Curie, Paris)
Learning procedures and evolutionary dynamics: some recent advances

This talk will be a general presentation of the field and a survey of recent results. Starting with the replicator dynamics we describe recent advances on the links between on-line learning and dynamics in games. The presentation will in particular focus on: properties of the unilateral process, interaction between discrete and continuous time, and applications to games were equilibrium conditions have a "Variational Inequalities" form.

Thursday 25 May - Jan van den Heuvel (LSE)
Improper Colourings inspired by Hadwiger's Conjecture

Hadwiger's Conjecture (1943) asserts that every graph without the complete graph K_t as a minor has a proper vertex-colouring using t-1 colours. Since the conjecture is stubbornly refusing to be proved, we should look at relax versions of it.

In the talk we relax the conclusion by considering two types of improper colourings for K_t-minor-free graphs: (1) colourings in which each monochromatic component has small degree, and (2) colourings in which each monochromatic component has small size. In both cases our new results greatly improve the existing results on these colourings.

Moreover, all we use is an elementary decomposition result for graphs without K_t-minor that might be of independent interest.

This is joint work with David Wood (Monash Univ., Melbourne)

Wednesday 31 May - TBC

Thursday 1 June - TBC

Wednesday 7 June - Oktay Gunluk (IBM)
Title and abstract TBC

Thursday 8 June - Éva Tardos (Cornell)
Title and abstract TBC

 

Previous seminars in this series: 20172016

Seminar on Discrete Mathematics and Game Theory: 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004 and before

Seminar on Operations Research: 2016, September 2015 - December 2015, August 2014 - August 2015, October 2010 - July 2014

 

Share:Facebook|Twitter|LinkedIn|