| Revista: | Computación y sistemas |
| Base de datos: | |
| Número de sistema: | 000560605 |
| ISSN: | 1405-5546 |
| Autores: | Königsberg, Zvi Retchkiman1 |
| Instituciones: | 1Instituto Politécnico Nacional, Centro de Investigación en Computación, Ciudad de México. México |
| Año: | 2021 |
| Periodo: | Jul-Sep |
| Volumen: | 25 |
| Número: | 3 |
| Paginación: | 515-521 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Resumen en inglés | In game theory, a cooperative game (or coalitional game) is a game with competition between groups of players (coalitions) due to the possibility of external enforcement of cooperative behavior (e.g. through contract law). Those are opposed to non-cooperative games in which there is either no possibility to forge alliances or all agreements need to be self-enforcing (e.g. through credible threats). Cooperative games are often analyzed through the framework of cooperative game theory, which focuses on predicting which coalitions will form, the joint actions that groups take and the resulting collective payoffs. It is opposed to the traditional non-cooperative game theory which focuses on predicting individual players’ actions and payoffs and analyzing Nash equilibriums. In this work, the cooperative and non-cooperative game problem is modeled by means of a modal logic formula. Then, using the concept of logic implication, and transforming this logical implication relation into a set of clauses, a modal resolution qualitative method for verification (satisfiability) as well as performance issues, for some queries is applied. |
| Disciplinas: | Ciencias de la computación |
| Palabras clave: | Procesamiento de datos |
| Keyword: | Cooperative game, Non-cooperative game, Modal logic, Model, Verification, Unsatisfiability, Modal resolution method, Data processing |
| Texto completo: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
