Some new results on recursive aggregation rules

As pointed by Cutello and Montero in a previous paper, consis tency of an aggregation rule based upon a sequence of binary opera tors can be justied from an operational argument, by imposing a recursive calculus. Following this recursive approach, it was later proven that under certain regularity co...

Descripción completa

Detalles Bibliográficos
Autores: Gómez González, Daniel, Montero De Juan, Francisco Javier
Tipo de recurso: capítulo de libro
Fecha de publicación:2004
País:España
Institución:Universidad Complutense de Madrid (UCM)
Repositorio:Docta Complutense
Idioma:inglés
OAI Identifier:oai:docta.ucm.es:20.500.14352/53435
Acceso en línea:https://hdl.handle.net/20.500.14352/53435
Access Level:acceso abierto
Palabra clave:510.64
Aggregation functions
Recursive rules
Fuzzy Sets
Lógica simbólica y matemática (Matemáticas)
1102.14 Lógica Simbólica
id ES_5fa95cf2a52f77a080280efd81f3ec02
oai_identifier_str oai:docta.ucm.es:20.500.14352/53435
network_acronym_str ES
network_name_str España
repository_id_str
spelling Some new results on recursive aggregation rulesGómez González, DanielMontero De Juan, Francisco Javier510.64Aggregation functionsRecursive rulesFuzzy SetsLógica simbólica y matemática (Matemáticas)1102.14 Lógica SimbólicaAs pointed by Cutello and Montero in a previous paper, consis tency of an aggregation rule based upon a sequence of binary opera tors can be justied from an operational argument, by imposing a recursive calculus. Following this recursive approach, it was later proven that under certain regularity conditions, strict increasingness leads to quasi-additive solutions. In this paper we propose an alternative and more general result, avoiding some of those regularity conditions. Moreover, we point out that in practice we should evaluate only those aggregations being allowed by the decision maker. Preference structures are considered as an illustrative example.Università degli Studi di Roma "La Sapienzia"Universidad Complutense de Madrid20042004-01-0120042004-01-01book parthttp://purl.org/coar/resource_type/c_3248info:eu-repo/semantics/bookPartapplication/pdfhttps://hdl.handle.net/20.500.14352/53435reponame:Docta Complutenseinstname:Universidad Complutense de Madrid (UCM)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:docta.ucm.es:20.500.14352/534352026-06-02T12:44:21Z
dc.title.none.fl_str_mv Some new results on recursive aggregation rules
title Some new results on recursive aggregation rules
spellingShingle Some new results on recursive aggregation rules
Gómez González, Daniel
510.64
Aggregation functions
Recursive rules
Fuzzy Sets
Lógica simbólica y matemática (Matemáticas)
1102.14 Lógica Simbólica
title_short Some new results on recursive aggregation rules
title_full Some new results on recursive aggregation rules
title_fullStr Some new results on recursive aggregation rules
title_full_unstemmed Some new results on recursive aggregation rules
title_sort Some new results on recursive aggregation rules
dc.creator.none.fl_str_mv Gómez González, Daniel
Montero De Juan, Francisco Javier
author Gómez González, Daniel
author_facet Gómez González, Daniel
Montero De Juan, Francisco Javier
author_role author
author2 Montero De Juan, Francisco Javier
author2_role author
dc.contributor.none.fl_str_mv Universidad Complutense de Madrid
dc.subject.none.fl_str_mv 510.64
Aggregation functions
Recursive rules
Fuzzy Sets
Lógica simbólica y matemática (Matemáticas)
1102.14 Lógica Simbólica
topic 510.64
Aggregation functions
Recursive rules
Fuzzy Sets
Lógica simbólica y matemática (Matemáticas)
1102.14 Lógica Simbólica
description As pointed by Cutello and Montero in a previous paper, consis tency of an aggregation rule based upon a sequence of binary opera tors can be justied from an operational argument, by imposing a recursive calculus. Following this recursive approach, it was later proven that under certain regularity conditions, strict increasingness leads to quasi-additive solutions. In this paper we propose an alternative and more general result, avoiding some of those regularity conditions. Moreover, we point out that in practice we should evaluate only those aggregations being allowed by the decision maker. Preference structures are considered as an illustrative example.
publishDate 2004
dc.date.none.fl_str_mv 2004
2004-01-01
2004
2004-01-01
dc.type.none.fl_str_mv book part
http://purl.org/coar/resource_type/c_3248
dc.type.openaire.fl_str_mv info:eu-repo/semantics/bookPart
format bookPart
dc.identifier.none.fl_str_mv https://hdl.handle.net/20.500.14352/53435
url https://hdl.handle.net/20.500.14352/53435
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Università degli Studi di Roma "La Sapienzia"
publisher.none.fl_str_mv Università degli Studi di Roma "La Sapienzia"
dc.source.none.fl_str_mv reponame:Docta Complutense
instname:Universidad Complutense de Madrid (UCM)
instname_str Universidad Complutense de Madrid (UCM)
reponame_str Docta Complutense
collection Docta Complutense
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869409223472840704
score 15.301603

Similares en LA Referencia