21 citations · 31 across the 4 of their papers we have counts for
4 papers
Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty
Andrew Mastin, Patrick Jaillet, Sang Chin
The minmax regret problem for combinatorial optimization under uncertainty can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizi…
Greedy Online Bipartite Matching on Random Graphs
Andrew Mastin, Patrick Jaillet
We study the average performance of online greedy matching algorithms on , the random bipartite graph with vertices on each side and edges occurring independently wit…
Log-Quadratic Bounds for the Gaussian Q-function
Andrew Mastin, Patrick Jaillet
We present bounds of quadratic form for the logarithm of the Gaussian Q-function. We also show an analytical method for deriving log-quadratic approximations of the Q-function and…
Average-Case Performance of Rollout Algorithms for Knapsack Problems
Andrew Mastin, Patrick Jaillet
Rollout algorithms have demonstrated excellent performance on a variety of dynamic and discrete optimization problems. Interpreted as an approximate dynamic programming algorithm,…