Search Results for author:
Found 3 papers, 1 papers with code
When Can Liquid Democracy Unveil the Truth?
Interestingly, under some hypothesis on either the accuracies of voters or the connectivity of the network, we obtain a polynomial-time $1/2$-approximation algorithm.
Fairness in Influence Maximization through Randomization
Maybe non-surprisingly, we show that the ex-ante values of the computed probabilistic strategies are significantly larger than the (ex-post) fairness values of previous methods.
Fairness
Social and Information Networks
Data Structures and Algorithms
Computer Science and Game Theory
Subspace Determination through Local Intrinsic Dimensional Decomposition: Theory and Experimentation
For each point, the recently-proposed Local Intrinsic Dimension (LID) model is used in identifying the axis directions along which features have the greatest local discriminability, or equivalently, the fewest number of components of LID that capture the local complexity of the data.
