Cargando…
How hard is it to tell which is a Condorcet committee?()
This paper establishes the computational complexity status for a problem of deciding on the quality of a committee. Starting with individual preferences over alternatives, we analyse when it can be determined efficiently if a given committee [Formula: see text] satisfies a weak (resp. strong) Condor...
| Autor principal: | |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
North-Holland
2013
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4376023/ https://www.ncbi.nlm.nih.gov/pubmed/25843993 http://dx.doi.org/10.1016/j.mathsocsci.2013.06.004 |