1 citations · 1 across the 4 of their papers we have counts for
5 papers
Locally Sparsified, Globally Near-Optimal: Matching under Independent Vertex Arrivals
Sara Ahmadian, Edith Cohen, Mohammad Roghani
Resource allocation systems often restrict each request to a short list of options before coordinating assignments globally. We study this separation in stochastic bipartite matchi…
Stochastic Matching via Local Sparsification
Sara Ahmadian, Edith Cohen, Mohammad Roghani
The classic online stochastic matching problem typically requires immediate and irrevocable matching decisions. However, in many modern decentralized systems such as real-time ride…
The Cost of Compression: Tight Quadratic Black-Box Attacks on Sketches for Norm Estimation
Sara Ahmadian, Edith Cohen, Uri Stemmer
Dimensionality reduction via linear sketching is a powerful and widely used technique, but it is known to be vulnerable to adversarial inputs. We study the black-box adversarial se…
Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs
Sara Ahmadian, Edith Cohen
Cardinality sketches are popular data structures that enhance the efficiency of working with large data sets. The sketches are randomized representations of sets that are only of l…
Fair Active Ranking from Pairwise Preferences
Sruthi Gorantla, Sara Ahmadian
We investigate the problem of probably approximately correct and fair (PACF) ranking of items by adaptively evoking pairwise comparisons. Given a set of items that belong to di…