Representing Utility Functions via Weighted Goals

DOI10.1002/MALQ.200810024MaRDI QIDQ3392304zbMATH OpenOpenAlexFDO

Authors Joel Uckelman, Yann Chevaleyre, Ulle Endriss, Jérôme Lang

Publication date 14 August 2009

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200810024

zbMATH Keywords

computational complexitycomputational social choicepreference representation

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Social choice (91B14)

Recommendations

• Compactly representing utility functions using weighted goals and the Max aggregator
• Multi-choice goal programming with utility functions
• scientific article; zbMATH DE number 3972659
• Axiomatization of weighted (separable) utility
• Representations of preferences with pseudolinear utility functions
• Ranked-weighted utilities and qualitative convolution
• Weighted utility theory with incomplete preferences
• Goal Programming in Preference Decomposition

Cites work

• k-order additive discrete fuzzy measures and their representation
• A Short Introduction to Computational Social Choice
• A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications
• Algorithm for optimal winner determination in combinatorial auctions
• Handbook of social choice and welfare. Vol. 1.
• scientific article; zbMATH DE number 44383 (Why is no real title available?)
• scientific article; zbMATH DE number 3560492 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1509480 (Why is no real title available?)
• scientific article; zbMATH DE number 774007 (Why is no real title available?)
• scientific article; zbMATH DE number 2243357 (Why is no real title available?)
• Logical preference representation and combinatorial vote
• Multiagent resource allocation in k-additive domains: preference representation and complexity
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Upper and Lower Probabilities Induced by a Multivalued Mapping

Cited in

(13)

• Propositional distances and compact preference representation
• Applications of logic in social choice theory (invited talk)
• A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications
• scientific article; zbMATH DE number 3972659 (Why is no real title available?)
• Computing subjective expected utility using probabilistic description logics
• scientific article; zbMATH DE number 1849163 (Why is no real title available?)
• Coalition formation in social environments with logic-based agents1
• What will they say? -- Public announcement games
• Compactly representing utility functions using weighted goals and the Max aggregator
• Voting almost maximizes social welfare despite limited communication
• Discrete preference games with logic-based agents: formal framework, complexity, and islands of tractability
• Compact representation of preferences
• Jérôme Lang's contributions at the interface of economic theory with artificial intelligence

Describes a project that uses

Uses Software

• CP-nets

This page was built for publication: Representing Utility Functions via Weighted Goals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392304)