Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Solving Non-binary CSPs Using the Hidden Variable Encoding
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Hard and soft constraints for reasoning about qualitative conditional preferences
Journal of Heuristics
Journal of Artificial Intelligence Research
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
Comparing the notions of optimality in CP-nets, strategic games and soft constraints
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of two formalisms used for different purposes and in different research areas: graphical games and soft constraints. We relate the notion of optimality used in the area of soft constraint satisfaction problems (SCSPs) to that used in graphical games, showing that for a large class of SCSPs that includes weighted constraints every optimal solution corresponds to a Nash equilibrium that is also a Pareto efficient joint strategy. We also study alternative mappings including one that maps graphical games to SCSPs, for which Pareto efficient joint strategies and optimal solutions coincide.