On asymptotic fairness in voting with greedy sampling.
Abraham GutierrezSebastian MüllerStjepan SebekPublished in: CoRR (2021)
Keyphrases
- greedy algorithm
- resource allocation
- dynamic programming
- random sampling
- worst case
- voting schemes
- voting method
- search space
- sample size
- monte carlo
- sampling algorithm
- laplace transform
- machine learning
- sampling strategies
- sampling methods
- search algorithm
- feature selection
- sampling rate
- markov chain monte carlo
- greedy heuristic
- sampling strategy
- large deviations
- expected values
- objective function
- genetic algorithm