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

Georgio Hawi

Georgio Hawi

Polynomial Method in Additive Combinatorics: Extension of CAP Sets Problem to More Than Three Points
Wilson Lorensyah

Wilson Lorensyah

Robust Adjustments To Random Effects Models for Dispersed Coun
Daniel Roberts

Daniel Roberts

Ethical Considerations in Vaccine Hesitancy
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.