64 citations · 106 across the 8 of their papers we have counts for
8 papers
Distributed course allocation with asymmetric friendships
Ilya Khakhiashvili, Lihi Dery, Tal Grinshpoun
Students' decisions on whether to take a class are strongly affected by whether their friends plan to take the class with them. A student may prefer to be assigned to a course they…
Efficient One Sided Kolmogorov Approximation
Liat Cohen, Tal Grinshpoun, Gera Weiss
We present an efficient algorithm that, given a discrete random variable and a number , computes a random variable whose support is of size at most and whose Kolmogorov…
Evaluation of Neural Networks Defenses and Attacks using NDCG and Reciprocal Rank Metrics
Haya Brama, Lihi Dery, Tal Grinshpoun
The problem of attacks on neural networks through input modification (i.e., adversarial examples) has attracted much attention recently. Being relatively easy to generate and hard…
Heat and Blur: An Effective and Fast Defense Against Adversarial Examples
Haya Brama, Tal Grinshpoun
The growing incorporation of artificial neural networks (NNs) into many fields, and especially into life-critical systems, is restrained by their vulnerability to adversarial examp…
Coalitional Games with Stochastic Characteristic Functions and Private Types
Dengji Zhao, Yiqing Huang, Liat Cohen +1
The research on coalitional games has focused on how to share the reward among a coalition such that players are incentivised to collaborate together. It assumes that the (determin…
A Privacy Preserving Collusion Secure DCOP Algorithm
Tamir Tassa, Tal Grinshpoun, Avishay Yanai
In recent years, several studies proposed privacy-preserving algorithms for solving Distributed Constraint Optimization Problems (DCOPs). All of those studies assumed that agents d…
Asymmetric Distributed Constraint Optimization Problems
Tal Grinshpoun, Alon Grubshtein, Roie Zivan +2
Distributed Constraint Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned by…
Completeness and Performance Of The APO Algorithm
Tal Grinshpoun, Amnon Meisels
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions t…