On the Complexity of Exchanging
Computer Science and Game Theory
2015-03-25 v2
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 given losing coalitions into a set of 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.
Keywords
Cite
@article{arxiv.1503.06052,
title = {On the Complexity of Exchanging},
author = {X. Molinero and M. Olsen and M. Serna},
journal= {arXiv preprint arXiv:1503.06052},
year = {2015}
}