Preference Aggregation Model
Jump to navigation
Jump to search
A Preference Aggregation Model is an aggregation model that combines individual preferences into collective rankings through mathematical frameworks handling preference relations.
- AKA: Preference Combination Model, Ranking Aggregation Model, Choice Aggregation Model, Preference Fusion Model.
- Context:
- It can typically handle Incomplete Preferences from partial comparisons.
- It can typically produce Global Rankings from local preferences.
- It can often address Preference Cycles violating transitivity.
- It can often incorporate Preference Strengths beyond binary choices.
- It can support Social Choice Theory applications in voting systems.
- It can enable Consensus Rankings from diverse opinions.
- It can facilitate Preference Learning in recommendation systems.
- It can integrate with Uncertainty Modeling for probabilistic preferences.
- It can range from being a Deterministic Aggregation Model to being a Probabilistic Aggregation Model, depending on its uncertainty handling.
- It can range from being a Cardinal Preference Model to being an Ordinal Preference Model, depending on its preference type.
- It can range from being a Pairwise Aggregation Model to being a Listwise Aggregation Model, depending on its comparison structure.
- It can range from being a Parametric Aggregation Model to being a Non-Parametric Aggregation Model, depending on its model assumptions.
- ...
- Examples:
- Pairwise Preference Models, such as:
- Listwise Preference Models, such as:
- Voting-Based Models, such as:
- ...
- Counter-Examples:
- Individual Preference Model, which lacks aggregation.
- Absolute Rating Model, which avoids relative comparison.
- Random Ranking Model, which ignores preference structure.
- See: Aggregation Model, Bradley-Terry Model, Thurstone Preference Model, Pairwise Preference Method, Human Parity Metric, Statistical Evaluation Model, Ranking Algorithm, Social Choice Theory.