On the complexity of exchanging

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/86068

Title:	On the complexity of exchanging
Author:	Molinero Albareda, Xavier; Olsen, Martin; Serna Iglesias, María José
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtiques; Universitat Politècnica de Catalunya. Departament de Ciències de la Computació; Universitat Politècnica de Catalunya. GRTJ - Grup de Recerca en Teoria de Jocs; Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
Abstract:	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.
Abstract:	Peer Reviewed
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Teoria de jocs -Game theory -Computational complexity -Computational complexity -Simple games -Tradeness -Weighted games -Jocs, Teoria de -Complexitat computacional -Classificació AMS::68 Computer science::68Q Theory of computing -Classificació AMS::91 Game theory, economics, social and behavioral sciences::91A Game theory
Rights:	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Submitted version Article
Share: