A comparison of the notions of optimality in soft constraints and graphical games

Details A comparison of the notions of optimality in soft constraints and graphical games A comparison of the notions of optimality in soft constraints and graphical games

2008-10-16

arxiv.org/abs/0810.2861v1

Computer Science

Artificial Intelligence

18 pages. To appear in Recent Advances in Constraints, (F. Fages, S. Soliman and F. Rossi, eds.) Springer Lecture Notes in Art

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A comparison of the notions of optimality in soft constraints and graphical games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A comparison of the notions of optimality in soft constraints and graphical games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A comparison of the notions of optimality in soft constraints and graphical games will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-367708