Heuristic methods of constructing the median in group choice (Q1114568)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Heuristic methods of constructing the median in group choice |
scientific article; zbMATH DE number 4083316
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic methods of constructing the median in group choice |
scientific article; zbMATH DE number 4083316 |
Statements
Heuristic methods of constructing the median in group choice (English)
0 references
1988
0 references
A popular and theoretically sound method of reaching a group decision involves construction of the median of a given set of relations. In this paper, we describe a local optimization algorithm for a functional in an arbitrary given class of relations, which generalizes various known algorithms of ranking, classification, and ordered classification. Under natural distributional assumptions on the set of individual expert decisions, we prove consistency of the exact and locally optimal medians.
0 references
group decision
0 references
median of a given set of relations
0 references
local optimization
0 references
ranking
0 references
classification
0 references
expert decisions
0 references
consistency
0 references