Optimal Strategies in Sequential Selection Problems

I would like to examine the formulations used to solve sequential selection problems, for instance the theory of stopping times and dynamic programming. Furthermore I will look at what you can do when the problems are not exactly solvable, using techniques like finding approximate solutions, computer simulations, and asymptotic analysis. This will allow me to find connections between the problems and add my own insights.

Ben Martin

Macquarie University

Ben Martin is second-year undergraduate student at Macquarie University studying a Bachelor of Mathematical Science and majoring in applied mathematics. He has a particular interest in probability theory.

You may be interested in

Kenrick Chung

Kenrick Chung

Mackey Functor (Co)homology of G-C.W Complexes
Liam Barnes

Liam Barnes

Coriolis Force acting on Magnetic Active Regions on the Sun Project
James Jensen

James Jensen

Vertex Operator Algebras and the Monster
Nelly Tucker

Nelly Tucker

Long memory random walks
Contact Us

We're not around right now. But you can send us an email and we'll get back to you, asap.

Not readable? Change text.