Sitemap

A list of all the posts and pages found on the site. For you robots out there, there is an XML version available for digesting as well.

Pages

Posts

Future Blog Post

less than 1 minute read

Published:

This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.

Blog Post number 4

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 3

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 2

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 1

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

portfolio

publications

Combinatorial Markov Search

Published in Symposium on Theory of Computing, 2026

We explore an extension of the Pandora’s box problem where each box is modeled as an MDP. We obtain a constant-factor approximation using a Prophet Inequality-style algorithm that considers boxes one at a time.

Recommended citation: Bowers, Robin, Elias Lindgren, and Bo Waggoner. "Combinatorial Markov Search." Symposium on Theory of Computing, 2026, https://arxiv.org/abs/2502.08976.
Download Paper

Qualifier Selection Mechanisms in Collegiate Cross Country

Published in , 2026

We analyze the algorithm used in NCAA Division I Cross Country to select which teams qualify for the national championships meet, and a more general family of selection algorithms, taking an axiomatic social choice approach.

talks