Loading...
Loading...

Go to the content (press return)

Forms of representation for simple games: sizes, conversions and equivalences

Author
Molinero, X.; Riquelme, F.; Serna, M.
Type of activity
Journal article
Journal
Mathematical social sciences
Date of publication
2015-07-01
Volume
76
First page
87
Last page
102
DOI
https://doi.org/10.1016/j.mathsocsci.2015.04.008 Open in new window
Project funding
Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals ALBCOM
Computational Models and Methods for Massive Structured Data
Teoría de juegos: fundamentos matemáticos y aplicaciones
Repository
http://hdl.handle.net/2117/77521 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S016548961500044X Open in new window
Abstract
Simple games are cooperative games in which the benefit that a coalition may have is always binary, i.e., a coalition may either win or loose. This paper surveys different forms of representation of simple games, and those for some of their subfamilies like regular games and weighted games. We analyze the forms of representations that have been proposed in the literature based on different data structures for sets of sets. We provide bounds on the computational resources needed to transform a ga...
Citation
Molinero, X., Riquelme, F., Serna, M. Forms of representation for simple games: sizes, conversions and equivalences. "Mathematical social sciences", 01 Juliol 2015, vol. 76, p. 87-102.
Keywords
ALGORITHMS, BINARY DECISION DIAGRAMS, BOOLEAN FUNCTIONS, BRANCHING PROGRAMS, COMPLEXITY, DUALIZATION, POWER INDEXES, SET, SHORTEST-PATH GAMES, WEIGHTED MAJORITY GAMES
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods
GRTJ - Game Theory Research Group

Participants

Attachments