activity
20102023
most citedConvergence of Tâtonnement in Fisher Markets

9 citations · 15 across the 6 of their papers we have counts for

collaborators

7 papers

cs.LG2023

Consistent Text Categorization using Data Augmentation in e-Commerce

Guy Horowitz, Stav Yanovsky Daye, Noa Avigdor-Elgrabli +1

The categorization of massive e-Commerce data is a crucial, well-studied task, which is prevalent in industrial settings. In this work, we aim to improve an existing product catego…

cs.LG2018★ 1 cited

Interpreting Complex Regression Models

Noa Avigdor-Elgrabli, Alex Libov, Michael Viderman +1

Interpretation of a machine learning induced models is critical for feature engineering, debugging, and, arguably, compliance. Yet, best of breed machine learning models tend to be…

cs.DS2015

Offline and Online Models of Budget Allocation for Maximizing Influence Spread

Noa Avigdor-Elgrabli, Gideon Blocq, Iftah Gamzu +1

The research of influence propagation in social networks via word-of-mouth processes has been given considerable attention in recent years. Arguably, the most fundamental problem i…

cs.GT2014★ 9 cited

Convergence of Tâtonnement in Fisher Markets

Noa Avigdor-Elgrabli, Yuval Rabani, Gala Yadgar

Analyzing simple and natural price-adjustment processes that converge to a market equilibrium is a fundamental question in economics. Such an analysis may have implications in econ…

cs.DS2013

An Optimal Randomized Online Algorithm for Reordering Buffer Management

Noa Avigdor-elgrabli, Yuval Rabani

We give an -competitive randomized online algorithm for reordering buffer management, where is the buffer size. Our bound matches the lower bound of Adamaszek et…

cs.DS2012

A Constant Factor Approximation Algorithm for Reordering Buffer Management

Noa Avigdor-Elgrabli, Yuval Rabani

In the reordering buffer management problem (RBM) a sequence of colored items enters a buffer with limited capacity . When the buffer is full, one item is removed to the out…

cs.DS2010★ 5 cited

An Improved Algorithm for Bipartite Correlation Clustering

Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty

Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. T…