3 papers
eess.SY2026
A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
Brandon Van Over, Bowen Li, Edwin K. P. Chong +1
We present a simple performance bound for the greedy scheme in string optimization problems that obtains strong results. Our approach vastly generalizes the group of previously est…
eess.SY2026
Performance Guarantees for Data-Driven Sequential Decision-Making
Bowen Li, Edwin K. P. Chong, Ali Pezeshki
The solutions to many sequential decision-making problems are characterized by dynamic programming and Bellman's principle of optimality. However, due to the inherent complexity of…
eess.SY2024
On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
Bowen Li, Brandon Van Over, Edwin K. P. Chong +1
We consider the celebrated bound introduced by Conforti and Cornuéjols (1984) for greedy schemes in submodular optimization. The bound assumes a submodular function defined on a c…