Alexander Gnedin (QMUL)

will speak on

Self-similarity in the sequential selection problems

Time: 3:00PM
Date: Wed 21st April 2021
Location: Online [map]

Abstract: Some poissonised combinatorial optimisation problems have a self-similarity feature, not available in their fixed-n counterparts. In this talk we shall review recent results on the sequential best-choice and increasing subsequence problems, where using the self-similarity to reduce the state-space leads to very precise solutions.

Zoom Link:
https://ucd-ie.zoom.us/j/83491228915?pwd=WWV3ZkNGNzVXdGxLRlR0dkdMYUtMZz09

Meeting ID: 834 9122 8915
Passcode: 698437

(This talk is part of the Probability series.)

PDF notice

Return to all seminars