Pages that link to "Item:Q2457617"
From MaRDI portal
The following pages link to Constraint-based optimization and utility elicitation using the minimax decision criterion (Q2457617):
Displaying 26 items.
- Preferences in artificial intelligence (Q314443) (← links)
- On the value of using group discounts under price competition (Q460621) (← links)
- Invariants for time-series constraints (Q823762) (← links)
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies (Q969536) (← links)
- Efficient pairwise preference elicitation allowing for indifference (Q1651537) (← links)
- Heuristics for selecting pair-wise elicitation questions in multiple criteria choice problems (Q1683102) (← links)
- Monotone decomposition of 2-additive generalized additive independence models (Q1748545) (← links)
- Easy and optimal queries to reduce set uncertainty (Q1752234) (← links)
- Relational networks of conditional preferences (Q1945137) (← links)
- Robust winner determination in positional scoring rules with uncertain weights (Q1986068) (← links)
- Exploiting bounded rationality in risk-based cyber camouflage games (Q2056937) (← links)
- Simple ranking method using reference profiles: incremental elicitation of the preference parameters (Q2168782) (← links)
- On the equivalence of optimal recommendation sets and myopically optimal query sets (Q2211851) (← links)
- Learning modulo theories for constructive preference elicitation (Q2238637) (← links)
- Preference elicitation and robust winner determination for single- and multi-winner social choice (Q2287202) (← links)
- Combining local search and elicitation for multi-objective combinatorial optimization (Q2290362) (← links)
- Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems (Q2407884) (← links)
- A multi-objective supplier selection framework based on user-preferences (Q2669455) (← links)
- A decomposition based minimax regret approach for inverse multiple criteria sorting problem (Q2688883) (← links)
- Simultaneous elicitation of scoring rule and agent preferences for robust winner determination (Q2695426) (← links)
- Incremental elicitation of preferences: optimist or pessimist? (Q2695428) (← links)
- Interactive optimization of submodular functions under matroid constraints (Q2695451) (← links)
- Active Preference Elicitation by Bayesian Updating on Optimality Polyhedra (Q3297806) (← links)
- An Interactive Polyhedral Approach for Multi-objective Combinatorial Optimization with Incomplete Preference Information (Q3297811) (← links)
- Preference Elicitation with Uncertainty: Extending Regret Based Methods with Belief Functions (Q3297814) (← links)
- Minimax regret stability in the graph model for conflict resolution (Q6556107) (← links)
