Portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 2 
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
Published in , 2026
We develop a theory of liquidity provisioning for AMM prediction markets in which liquidity providers are effectively treated as parallel market makers who collect fees.
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.
Published:
This is a description of your talk, which is a markdown file that can be all markdown-ified like any other post. Yay markdown!
Published:
This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.