Skip to content

Latest commit

 

History

History
9 lines (5 loc) · 466 Bytes

README.md

File metadata and controls

9 lines (5 loc) · 466 Bytes

Separability

Tags: game theory, graphical games, hypergraphs, potential games, influence networks.

This project contains datatypes and procedures that allow finding the minimal hypergraph of a finite strategic form game. In game theory, this problem consists in identifying the minimal pattern of dependencies among players.

For more information we refer to the paper Separable games.