21 citations · 40 across the 13 of their papers we have counts for
8 papers · 1 filter
Submodular Optimization Problems and Greedy Strategies: A Survey
Yajing Liu, Edwin K. P. Chong, Ali Pezeshki +1
The greedy strategy is an approximation algorithm to solve optimization problems arising in decision making with multiple actions. How good is the greedy strategy compared to the o…
A General Framework for Bounding Approximate Dynamic Programming Schemes
Yajing Liu, Edwin Chong, Ali Pezeshki +1
For years, there has been interest in approximation methods for solving dynamic programming problems, because of the inherent complexity in computing optimal solutions characterize…
Improved Bounds for the Greedy Strategy in Optimization Problems with Curvature
Yajing Liu, Edwin K. P. Chong, Ali Pezeshki
Consider the problem of choosing a set of actions to optimize an objective function that is a real-valued polymatroid function subject to matroid constraints. The greedy strategy p…
Performance Bounds with Curvature for Batched Greedy Optimization
Yajing Liu, Zhenliang Zhang, Edwin K. P. Chong +1
The batched greedy strategy is an approximation algorithm to maximize a set function subject to a matroid constraint. Starting with the empty set, the batched greedy strategy itera…
Performance Bounds for Nash Equilibria in Submodular Utility Systems with User Groups
Yajing Liu, Edwin K. P. Chong, Ali Pezeshki
In this paper, we consider variations of the utility system considered by Vetta, in which users are grouped together. Our aim is to establish how grouping and cooperation among use…
Performance Bounds for the -Batch Greedy Strategy in Optimization Problems with Curvature
Yajing Liu, Zhenliang Zhang, Edwin K. P. Chong +1
The -batch greedy strategy is an approximate algorithm to solve optimization problems where the optimal solution is hard to obtain. Starting with the empty set, the -batch gr…
Bounding the Greedy Strategy in Finite-Horizon String Optimization
Yajing Liu, Edwin K. P. Chong, Ali Pezeshki
We consider an optimization problem where the decision variable is a string of bounded length. For some time there has been an interest in bounding the performance of the greedy st…
Guaranteed Bounds for General Approximate Dynamic Programming
Yajing Liu, Edwin K. P. Chong, Ali Pezeshki +1
In this paper, we will develop a systematic approach to deriving guaranteed bounds for approximate dynamic programming (ADP) schemes in optimal control problems. Our approach is in…