5 citations · 5 across the 4 of their papers we have counts for
4 papers
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…
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…
An optimal approximation of discrete random variables with respect to the Kolmogorov distance
Liat Cohen, Dror Fried, Gera Weiss
We present an algorithm that takes a discrete random variable and a number and computes a random variable whose support (set of possible outcomes) is of size at most an…
Estimating the Probability of Meeting a Deadline in Hierarchical Plans
Liat Cohen, Solomon Eyal Shimony, Gera Weiss
Given a hierarchical plan (or schedule) with uncertain task times, we propose a deterministic polynomial (time and memory) algorithm for estimating the probability that its meets a…