Representing Utility Functions via Weighted Goals

DOI10.1002/malq.200810024zbMath1180.91118OpenAlexW2072665610MaRDI QIDQ3392304

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

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)

Related Items (6)

Compactly representing utility functions using weighted goals and the Max aggregator ⋮ Voting almost maximizes social welfare despite limited communication ⋮ Coalition formation in social environments with logic-based agents1 ⋮ What will they say? -- Public announcement games ⋮ Applications of Logic in Social Choice Theory ⋮ A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications

Uses Software

• CP-nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logical preference representation and combinatorial vote
• \(k\)-order additive discrete fuzzy measures and their representation
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• Handbook of social choice and welfare. Vol. 1.
• Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity
• A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications
• A Short Introduction to Computational Social Choice
• Upper and Lower Probabilities Induced by a Multivalued Mapping
• Algorithm for optimal winner determination in combinatorial auctions

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