4 citations · 14 across the 8 of their papers we have counts for
9 papers
LSP : Acceleration and Regularization of Graph Neural Networks via Locality Sensitive Pruning of Graphs
Eitan Kosman, Joel Oren, Dotan Di Castro
Graph Neural Networks (GNNs) have emerged as highly successful tools for graph-related tasks. However, real-world problems involve very large graphs, and the compute resources need…
Sampling Multiple Nodes in Large Networks: Beyond Random Walks
Omri Ben-Eliezer, Talya Eden, Joel Oren +1
Sampling random nodes is a fundamental algorithmic primitive in the analysis of massive networks, with many modern graph mining algorithms critically relying on it. We consider the…
SOLO: Search Online, Learn Offline for Combinatorial Optimization Problems
Joel Oren, Chana Ross, Maksym Lefarov +5
We study combinatorial problems with real world applications such as machine scheduling, routing, and assignment. We propose a method that combines Reinforcement Learning (RL) and…
Practical Risk Measures in Reinforcement Learning
Dotan Di Castro, Joel Oren, Shie Mannor
Practical application of Reinforcement Learning (RL) often involves risk considerations. We study a generalized approximation scheme for risk measures, based on Monte-Carlo simulat…
Shapley Values in Weighted Voting Games with Random Weights
Yuval Filmus, Joel Oren, Kannan Soundararajan
We investigate the distribution of the well-studied Shapley--Shubik values in weighted voting games where the agents are stochastically determined. The Shapley--Shubik value measur…
Power Distribution in Randomized Weighted Voting: the Effects of the Quota
Joel Oren, Yuval Filmus, Yair Zick +1
We study the Shapley value in weighted voting games. The Shapley value has been used as an index for measuring the power of individual agents in decision-making bodies and politica…
The Pricing War Continues: On Competitive Multi-Item Pricing
Omer Lev, Joel Oren, Craig Boutilier +1
We study a game with \emph{strategic} vendors who own multiple items and a single buyer with a submodular valuation function. The goal of the vendors is to maximize their revenue v…
Truthful Mechanisms for Competing Submodular Processes
Allan Borodin, Mark Braverman, Brendan Lucier +1
Motivated by applications to word-of-mouth advertising, we consider a game-theoretic scenario in which competing advertisers want to target initial adopters in a social network. Ea…
Efficient Sum-Based Hierarchical Smoothing Under \ell_1-Norm
Siavosh Benabbas, Hyun Chul Lee, Joel Oren +1
We introduce a new regression problem which we call the Sum-Based Hierarchical Smoothing problem. Given a directed acyclic graph and a non-negative value, called target value, for…