ML Anthology

Quota and Gmin Merging Operators

Patricia Everaere, Sébastien Konieczny, Pierre Marquis
IJCAI 2005 pp. 424-429
/ijcai/2005/everaere2005ijcai-quota/

Abstract

In this paper, two families of merging operators are considered: quota operators and Gmin operators. Quota operators rely on a simple idea: any possible world is viewed as a model of the result of the merging when it satisfies “sufficiently many” bases from the given profile (a multi-set of bases). Different interpretations of the “sufficiently many” give rise to specific operators. Each Gmin operator is parameterized by a pseudo-distance and each of them is intended to refine the quota operators (i.e., to preserve more information). Quota and Gmin operators are evaluated and compared along four dimensions: rationality, computational complexity, strategy-proofness, and discriminating power. Those two families are shown as interesting alternatives to the formula-based merging operators (which selects some formulas in the union of the bases). 1

PDF Semantic Scholar

Cite

Text

Everaere et al. "Quota and Gmin Merging Operators." International Joint Conference on Artificial Intelligence, 2005.

Markdown

[Everaere et al. "Quota and Gmin Merging Operators." International Joint Conference on Artificial Intelligence, 2005.](https://mlanthology.org/ijcai/2005/everaere2005ijcai-quota/)

BibTeX

@inproceedings{everaere2005ijcai-quota,
  title     = {{Quota and Gmin Merging Operators}},
  author    = {Everaere, Patricia and Konieczny, Sébastien and Marquis, Pierre},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2005},
  pages     = {424-429},
  url       = {https://mlanthology.org/ijcai/2005/everaere2005ijcai-quota/}
}