The following pages link to (Q3093337):
Displaying 14 items.
- Democratic approximation of lexicographic preference models (Q646538) (← links)
- On the complexity of learning strings and sequences (Q688167) (← links)
- Fast, frugal, and fit: simple heuristics for paired comparison (Q1611614) (← links)
- Lexicographic preferences for predictive modeling of human decision making: a new machine learning method with an application in accounting (Q1698914) (← links)
- Editorial: Preference learning and ranking (Q2251428) (← links)
- Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains (Q2278102) (← links)
- New complexity results on aggregating lexicographic preference trees using positional scoring rules (Q2290373) (← links)
- Voting on multi-issue domains with conditionally lexicographic preferences (Q2315365) (← links)
- Meta-inductive prediction based on attractivity weighting: mathematical and empirical performance evaluation (Q2332810) (← links)
- Tight upper bounds for the expected loss of lexicographic heuristics in binary multi-attribute choice (Q2427207) (← links)
- Naturalism, tractability and the adaptive toolbox (Q2695383) (← links)
- Randomized Algorithms for Lexicographic Inference (Q5126607) (← links)
- Building rankings encompassing multiple criteria to support qualitative decision-making (Q6126680) (← links)
- An extended knowledge compilation map for conditional preference statements-based and generalized additive utilities-based languages (Q6630721) (← links)
