Comparing the notions of optimality in CP-nets, strategic games and soft constraints

DOI10.1007/S10472-008-9095-4zbMath1165.91357arXiv0711.2909OpenAlexW2147591394MaRDI QIDQ1029586

Francesca Rossi, Kristen Brent Venable, Krzysztof R. Apt

Publication date: 13 July 2009

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.2909

Mathematics Subject Classification ID

Knowledge representation (68T30) Group preferences (91B10) General equilibrium theory (91B50) General topics in artificial intelligence (68T01)

Uses Software

• CP-nets

Cites Work

• On the order of eliminating dominated strategies
• Semiring-based constraint satisfaction and optimization
• Contagion
• A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparing the notions of optimality in CP-nets, strategic games and soft constraints