Tight upper bounds for the expected loss of lexicographic heuristics in binary multiattribute choice
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/21073
Tipus de documentArticle
Data publicació2008-03
EditorNorth Holland Mathematical Library
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
Tight upper bounds for the expected loss of the DEBA (Deterministic-Elimination-By-Aspects) lexicographic selection heuristic are obtained for the case of an additive separable utility function
with unknown non-negative, non-increasing attribute weights for numbers of alternatives
and attributes as large as 10 under two probabilistic models: one in which attributes are assumed to be independent Bernouilli random variables and another one with positive inter-attribute correlation.
The upper bounds improve substantially previous bounds and extend significantly the
cases in which a good performance of DEBA can be guaranteed under the assumed cognitive
limitations.
CitacióCarrasco, J.; Baucells, M. Tight upper bounds for the expected loss of lexicographic heuristics in binary multiattribute choice. "Mathematical social sciences", Març 2008, vol. 55, núm. 3, p. 156-189.
ISSN0165-4896
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
MSS_08.pdf | 632,9Kb | Visualitza/Obre |