4 citations · 7 across the 7 of their papers we have counts for
7 papers
Robust Secretary and Prophet Algorithms for Packing Integer Programs
C. J. Argue, Anupam Gupta, Marco Molinaro +1
We study the problem of solving Packing Integer Programs (PIPs) in the online setting, where columns in of the constraint matrix are revealed sequentially, and the goal i…
Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing
C. J. Argue, Anupam Gupta, Marco Molinaro
The current best algorithms for convex body chasing problem in online algorithms use the notion of the Steiner point of a convex set. In particular, the algorithm which always move…
Necessary and sufficient conditions for rank-one generated cones
C. J. Argue, Fatma Kılınç-Karzan, Alex L. Wang
A closed convex conic subset of the positive semidefinite (PSD) cone is rank-one generated (ROG) if all of its extreme rays are generated by rank-one matrices. The RO…
Dimension-Free Bounds on Chasing Convex Functions
C. J. Argue, Anupam Gupta, Guru Guruganesh
We consider the problem of chasing convex functions, where functions arrive over time. The player takes actions after seeing the function, and the goal is to achieve a small functi…
Chasing Convex Bodies with Linear Competitive Ratio
C. J. Argue, Anupam Gupta, Guru Guruganesh +1
We study the problem of chasing convex bodies online: given a sequence of convex bodies the algorithm must respond with points in an online…
A Nearly-Linear Bound for Chasing Nested Convex Bodies
C. J. Argue, Sébastien Bubeck, Michael B. Cohen +2
Friedman and Linial introduced the convex body chasing problem to explore the interplay between geometry and competitive ratio in metrical task systems. In convex body chasing, at…
Covers in Partitioned Intersecting Hypergraphs
Ron Aharoni, C. J. Argue
Given an integer and a vector of positive numbers with , an -uniform hypergraph is said to be -partitioned if…