Loading...
Loading...

Go to the content (press return)

On the enumeration of bipartite simple games

Author
Freixas, J.; Samaniego, D.
Type of activity
Journal article
Journal
Discrete applied mathematics
Date of publication
2021-07-15
Volume
297
First page
129
Last page
141
DOI
10.1016/j.dam.2021.03.011
Project funding
Voting and cooperative games with applications to social networks and political sciences
Repository
http://hdl.handle.net/2117/346977 Open in new window
URL
https://www.sciencedirect.com/science/article/abs/pii/S0166218X21001232 Open in new window
Abstract
This paper provides a classification of all monotonic bipartite simple games. The problem we deal with is very versatile since simple games are inequivalent monotonic Boolean functions, functions that are used in many fields such as game theory, neural networks, artificial intelligence, reliability or multiple-criteria decision-making. The obtained classification can be implemented in an algorithm able to enumerate bipartite simple games. These numbers provide some light on enumerations of sever...
Citation
Freixas, J.; Samaniego, D. On the enumeration of bipartite simple games. "Discrete applied mathematics", 15 Juliol 2021, vol. 297, p. 129-141.
Keywords
Classification of bipartite simple games and bipartite Boolean functions, Dedekind numbers and simple games, Enumeration of bipartite simple games and bipartite Boolean functions, Enumeration of the bicameral meet and bicameral join voting systems, Inequivalent monotonic Boolean functions
Group of research
GRTJ - Game Theory Research Group

Participants