Loading...
Loading...

Go to the content (press return)

On the complexity of problems on simple games

Author
Freixas, J.; Molinero, X.; Olsen, M.; Serna, M.
Type of activity
Journal article
Journal
RAIRO. Operations research
Date of publication
2011-10
First page
295
Last page
314
DOI
https://doi.org/10.1051/ro/2011115 Open in new window
Repository
http://hdl.handle.net/2117/25093 Open in new window
Abstract
Simple games cover voting systems in which a single alter- native, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of “yea” votes yield passage of the issue at hand. Each of these collections of “yea” voters forms a winning coalition. We are interested in performing a complexity analysis on problems defined on such families of games. This analysis as usual depends on the g...
Citation
Freixas, J. [et al.]. On the complexity of problems on simple games. "RAIRO. Operations research", Octubre 2011, p. 295-314.
Keywords
Majority games, NP-completeness, Simple, Weighted
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods
GRTJ - Game Theory Research Group

Participants