We study the independent approval model (IAM) for approval elections, where each candidate has its own approval probability and is approved independently of the other ones. This model generalizes, e.g., the impartial culture, the Hamming noise model, and the resampling model. We propose algorithms for learning IAMs and their mixtures from data, using either maximum likelihood estimation or Bayesian learning. We then apply these algorithms to a large set of elections from the Pabulib database. In particular, we find that single-component models are rarely sufficient to capture the complexity of real-life data, whereas their mixtures perform well.
@article{arxiv.2601.18651,
title = {Learning Real-Life Approval Elections},
author = {Piotr Faliszewski and Łukasz Janeczko and Andrzej Kaczmarczyk and Marcin Kurdziel and Grzegorz Pierczyński and Stanisław Szufa},
journal= {arXiv preprint arXiv:2601.18651},
year = {2026}
}