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

Simple item page
dc.creatorApt, Krzysztof R.
dc.creatorRossi, Francesca
dc.creatorVenable, K. Brent
dc.date2008-10-16
dc.date.accessioned2026-07-07T10:10:37Z
dc.date.available2026-07-07T10:10:37Z
dc.descriptionThe 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.
dc.description18 pages. To appear in Recent Advances in Constraints, (F. Fages, S. Soliman and F. Rossi, eds.) Springer Lecture Notes in Artificial Intelligence 5129, 2008
dc.identifierhttps://arxiv.org/abs/0810.2861
dc.identifierhttp://arxiv.org/abs/0810.2861
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/171647
dc.subjectArtificial Intelligence
dc.subjectComputer Science and Game Theory
dc.subjectI.2.11; D.3.3
dc.titleA comparison of the notions of optimality in soft constraints and graphical games
dc.typetext

Files

Collections

arXiv