Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On the complexity of problems on simple games

Autor
Freixas, J.; Molinero, X.; Olsen, M.; Serna, M.
Tipus d'activitat
Article en revista
Revista
RAIRO. Operations research
Data de publicació
2011-10
Pàgina inicial
295
Pàgina final
314
DOI
https://doi.org/10.1051/ro/2011115 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/25093 Obrir en finestra nova
Resum
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...
Citació
Freixas, J. [et al.]. On the complexity of problems on simple games. "RAIRO. Operations research", Octubre 2011, p. 295-314.
Paraules clau
Majority games, NP-completeness, Simple, Weighted
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
GRTJ - Grup de Recerca en Teoria de Jocs

Participants