The following pages link to CP-nets (Q14114):
Displaying 50 items.
- Preference change (Q302212) (← links)
- On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
- Extracting qualitative relations from categorical data (Q322069) (← links)
- The role of fuzzy sets in decision sciences: old techniques and new directions (Q429410) (← links)
- Database preference queries -- a possibilistic logic approach with symbolic priorities (Q429433) (← links)
- A postulate-based analysis of comparative preference statements (Q472801) (← links)
- Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics (Q507531) (← links)
- Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
- Graph aggregation (Q514143) (← links)
- A distributed social choice protocol for combinatorial domains (Q524881) (← links)
- Expressive efficiency of two kinds of specific CP-nets (Q527168) (← links)
- What will they say? -- Public announcement games (Q542137) (← links)
- Enabling local computation for partially ordered preferences (Q606907) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Compactly representing utility functions using weighted goals and the Max aggregator (Q622111) (← links)
- Voting almost maximizes social welfare despite limited communication (Q646516) (← links)
- Computational techniques for a simple theory of conditional preferences (Q646519) (← links)
- Contracting preference relations for database applications (Q646521) (← links)
- The local geometry of multiattribute tradeoff preferences (Q646524) (← links)
- Democratic approximation of lexicographic preference models (Q646538) (← links)
- Specifying and computing preferred plans (Q646542) (← links)
- Sequential decision making with partially ordered preferences (Q646545) (← links)
- A general framework for explaining the results of a multi-attribute preference model (Q646550) (← links)
- Two alternatives for handling preferences in qualitative choice logic (Q835189) (← links)
- Conditional lexicographic orders in constraint satisfaction problems (Q846134) (← links)
- Profit-based latency problems on the line (Q943793) (← links)
- Learning conditional preference networks (Q991013) (← links)
- Making choices with a binary relation: relative choice axioms and transitive closures (Q992691) (← links)
- Comparing the notions of optimality in CP-nets, strategic games and soft constraints (Q1029586) (← links)
- Kernel-based learning methods for preference aggregation (Q1040731) (← links)
- Sequential composition of voting rules in multi-issue domains (Q1042318) (← links)
- Representing interval orders by weighted bases: some complexity results (Q1042324) (← links)
- Autonomous agents modelling other agents: a comprehensive survey and open problems (Q1639697) (← links)
- A generic framework to include belief functions in preference handling and multi-criteria decision (Q1644894) (← links)
- CP- and OCF-networks -- a comparison (Q1677939) (← links)
- Axiomatic characterization of committee scoring rules (Q1729676) (← links)
- Dealing with explicit preferences and uncertainty in answer set programming (Q1928820) (← links)
- Relational networks of conditional preferences (Q1945137) (← links)
- Incentive-based search for equilibria in Boolean games (Q2009196) (← links)
- The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP (Q2011611) (← links)
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- Preference-based inconsistency-tolerant query answering under existential rules (Q2093372) (← links)
- Incremental evaluation of continuous preference queries (Q2195389) (← links)
- Possibilistic preference networks (Q2198214) (← links)
- Learning modulo theories for constructive preference elicitation (Q2238637) (← links)
- Editorial: Preference learning and ranking (Q2251428) (← links)
- Lexicographically-ordered constraint satisfaction problems (Q2267804) (← links)
- Reasoning with various kinds of preferences: logic, non-monotonicity, and algorithms (Q2271867) (← links)
- The complexity of exact learning of acyclic conditional preference networks from swap examples (Q2289025) (← links)
