Compactly representing utility functions using weighted goals and the Max aggregator

DOI10.1016/j.artint.2010.07.003zbMath1210.91035OpenAlexW2023581071MaRDI QIDQ622111

Ulle Endriss, Joel Uckelman

Publication date: 31 January 2011

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://pure.uva.nl/ws/files/939015/87830_UckelmanEndrissAIJ2010.pdf

zbMATH Keywords

preference aggregationpreference representation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decision theory (91B06) Utility theory (91B16) Other applications of logic (03B80)

Related Items (3)

Approximating the Nash Social Welfare with Indivisible Items ⋮ Coalition formation in social environments with logic-based agents1 ⋮ Applications of Logic in Social Choice Theory

Uses Software

• CP-nets

Cites Work

• Logical preference representation and combinatorial vote
• Sequential composition of voting rules in multi-issue domains
• On the complexity of the parity argument and other inefficient proofs of existence
• Representing Utility Functions via Weighted Goals
• A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications
• Computing Utility from Weighted Description Logic Preference Formulas
• The complexity of promise problems with applications to public-key cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Compactly representing utility functions using weighted goals and the Max aggregator