Loading...
Loading...

Go to the content (press return)

Tight upper bounds for the expected loss of lexicographic heuristics in binary multiattribute choice

Author
Carrasco, J.; Baucells, M.
Type of activity
Journal article
Journal
Mathematical social sciences
Date of publication
2008-03
Volume
55
Number
3
First page
156
Last page
189
Repository
http://hdl.handle.net/2117/21073 Open in new window
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 bound...
Citation
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.
Group of research
QINE - Low Power Design, Test, Verification and Security ICs

Participants

Attachments