Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On the complexity of exchanging

Autor
Molinero, X.; Olsen, M.; Serna, M.
Tipus d'activitat
Document cientificotècnic
Data
2015-03-24
Repositori
http://hdl.handle.net/2117/27400 Obrir en finestra nova
URL
http://arxiv.org/abs/1503.06052v2 Obrir en finestra nova
Resum
We analyze the computational complexity of the problem of deciding whether, for a given simple game, there exists the possibility of rearranging the participants in a set of j given losing coalitions into a set of j winning coalitions. We also look at the problem of turning winning coalitions into losing coalitions. We analyze the problem when the simple game is represented by a list of wining, losing, minimal winning or maximal loosing coalitions.
Citació
Molinero, X.; Olsen, M.; Serna, M. "On the complexity of exchanging". 2015.
Paraules clau
Computational Complexity, Tradeness of Simple Games
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
GRTJ - Grup de Recerca en Teoria de Jocs

Participants