Skip to content

Algorithms for finding the minimal hypergraphical representation of games.

Notifications You must be signed in to change notification settings

laura-arditti/separability

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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.

About

Algorithms for finding the minimal hypergraphical representation of games.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages