scientific article; zbMATH DE number 2243357
From MaRDI portal
zbMath1080.68685arXiv1107.0023MaRDI QIDQ5715666
No author found.
Publication date: 4 January 2006
Full work available at URL: https://arxiv.org/abs/1107.0023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decision theory (91B06) Reasoning under uncertainty in the context of artificial intelligence (68T37) Individual preferences (91B08)
Related Items
A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games, Preference-Based Problem Solving for Constraint Programming, A general framework for preferences in answer set programming, Integrated preference argumentation and applications in consumer behaviour analyses, A graph theoretical approach to decisions in social choice, law, A.I., Database Preferences Queries – A Possibilistic Logic Approach with Symbolic Priorities, Łukasiewicz Games, Explaining robust additive utility models by sequences of preference swaps, Two alternatives for handling preferences in qualitative choice logic, Algorithms for Solving Satisfiability Problems with Qualitative Preferences, Preference change, Possibilistic Conditional Preference Networks, Conditional lexicographic orders in constraint satisfaction problems, On the hardness of bribery variants in voting with CP-nets, Preferences in artificial intelligence, Autonomous agents modelling other agents: a comprehensive survey and open problems, Extracting qualitative relations from categorical data, A generic framework to include belief functions in preference handling and multi-criteria decision, Often Harder than in the Constructive Case: Destructive Bribery in CP-nets, Database querying under changing preferences, Graphically structured value-function compilation, Heuristics for planning with penalties and rewards formulated in logic and computed through circuits, Label ranking by learning pairwise preferences, Scaling-invariant maximum margin preference learning, A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison, Enabling local computation for partially ordered preferences, Solving satisfiability problems with preferences, A reward-based approach for preference modeling: a case study, Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting, CP- and OCF-networks -- a comparison, Dealing with explicit preferences and uncertainty in answer set programming, Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives, Comparing multiagent systems research in combinatorial auctions and voting, Compactly representing utility functions using weighted goals and the Max aggregator, Multi resource allocation with partial preferences, Semiring-Based Soft Constraints, Incremental evaluation of continuous preference queries, Possibilistic preference networks, Relational networks of conditional preferences, The role of fuzzy sets in decision sciences: old techniques and new directions, Database preference queries -- a possibilistic logic approach with symbolic priorities, Aggregating preferences represented by conditional preference networks, Probabilistic lexicographic preference trees, Bribery in voting with CP-nets, Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities, Dependencies Between Players in Boolean Games, Logical formalisms for representing bipolar preferences, Voting almost maximizes social welfare despite limited communication, Computational techniques for a simple theory of conditional preferences, Contracting preference relations for database applications, The local geometry of multiattribute tradeoff preferences, Democratic approximation of lexicographic preference models, Specifying and computing preferred plans, Sequential decision making with partially ordered preferences, A general framework for explaining the results of a multi-attribute preference model, Voting in Combinatorial Domains: What Logic and AI Have to Say, A postulate-based analysis of comparative preference statements, A flexible model for the evaluation of soft conditional preferences in fuzzy databases, Axiomatic characterization of committee scoring rules, CP-Nets, $$\pi $$-pref Nets, and Pareto Dominance, Probabilistic TCP-net, Learning modulo theories for constructive preference elicitation, The representation of conditional relative importance between criteria, Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics, Mining top-\(k\) motifs with a SAT-based framework, Graph aggregation, On database queries involving competitive conditional preferences, A distributed social choice protocol for combinatorial domains, Editorial: Preference learning and ranking, Expressive efficiency of two kinds of specific CP-nets, Dependencies between players in Boolean games, A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence, What will they say? -- Public announcement games, Modeling Ceteris Paribus Preferences in Formal Concept Analysis, Incentive-based search for equilibria in Boolean games, The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP, Lexicographically-ordered constraint satisfaction problems, Reasoning with various kinds of preferences: logic, non-monotonicity, and algorithms, Computer science and decision theory, A Model of User-Oriented Reduct Construction for Machine Learning, Learning conditional preference networks, A logic of soft constraints based on partially ordered preferences, Hard and soft constraints for reasoning about qualitative conditional preferences, Integration and propagation of a multi-criteria decision making model in constraint programming, Making choices with a binary relation: relative choice axioms and transitive closures, The complexity of exact learning of acyclic conditional preference networks from swap examples, New complexity results on aggregating lexicographic preference trees using positional scoring rules, Inferring latent class lexicographic rules from choice data, Decision-making with Sugeno integrals. Bridging the gap between multicriteria evaluation and decision under uncertainty, Pruning external minimality checking for answer set programs using semantic dependencies, CP-nets, Representing Utility Functions via Weighted Goals, Comparing the notions of optimality in CP-nets, strategic games and soft constraints, Multi-context systems in dynamic environments, Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting, Kernel-based learning methods for preference aggregation, Sequential composition of voting rules in multi-issue domains, Representing interval orders by weighted bases: some complexity results, MiniBrass: soft constraints for MiniZinc, Cubic preferences and the character admissibility problem, Preference-based inconsistency-tolerant query answering under existential rules, Answer sets and qualitative decision making, Combinatorial voter control in elections, Extreme points of the credal sets generated by comparative probabilities, Erratum to: ``Database preference queries -- a possibilistic logic approach with symbolic priorities, From knowledge-based programs to graded belief-based programs. I: On-line reasoning
