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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
18 pages. To appear in Recent Advances in Constraints, (F. Fages, S. Soliman and F. Rossi, eds.) Springer Lecture Notes in Artificial Intelligence 5129, 2008

Keywords

Artificial Intelligence, Computer Science and Game Theory, I.2.11; D.3.3

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/171647

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0810.2861
 http://arxiv.org/abs/0810.2861

Collections

arXiv