# Representing and Reasoning with Multi-Stakeholder Qualitative Preference Queries

arXiv: https://arxiv.org/abs/2307.16307 · HTML: https://mlsanity.com/paper/2307.16307/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 3 of its 40 references that are in the map.
- First posted on arXiv 30 Jul 2023.

## Builds on (most cited first, 3 of 3)

- [The Computational Complexity of Dominance and Consistency in CP-Nets](https://mlsanity.com/paper/1401.3453/) (2014)
- [CRISNER: A Practically Efficient Reasoner for Qualitative Preferences](https://mlsanity.com/paper/1507.08559/) (2015)
- [A CP-Net based Qualitative Composition Approach for an IaaS Provider](https://mlsanity.com/paper/2102.12221/) (2021)

## Abstract (arXiv)

Many decision-making scenarios, e.g., public policy, healthcare, business, and disaster response, require accommodating the preferences of multiple stakeholders. We offer the first formal treatment of reasoning with multi-stakeholder qualitative preferences in a setting where stakeholders express their preferences in a qualitative preference language, e.g., CP-net, CI-net, TCP-net, CP-Theory. We introduce a query language for expressing queries against such preferences over sets of outcomes that satisfy specified criteria, e.g., mlangprefpsi1psi2A (read loosely as the set of outcomes satisfying psi1 that are preferred over outcomes satisfying psi2 by a set of stakeholders A). Motivated by practical application scenarios, we introduce and analyze several alternative semantics for such queries, and examine their interrelationships. We provide a provably correct algorithm for answering multi-stakeholder qualitative preference queries using model checking in alternation-free μ-calculus. We present experimental results that demonstrate the feasibility of our approach.