On the Complexity of Exchanging

Xavier Molinero; Martin Olsen; Maria Serna

doi:10.1016/j.ipl.2016.01.004

On the Complexity of Exchanging

Xavier Molinero, Martin Olsen, Maria Serna

Department of Business Development and Technology

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

3 Citations (Scopus)

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.

Original language	English
Journal	Information Processing Letters
Volume	116
Issue	6
Pages (from-to)	437-441
Number of pages	5
ISSN	0020-0190
DOIs	https://doi.org/10.1016/j.ipl.2016.01.004
Publication status	Published - 1 Jun 2016

Keywords

Computational complexity
Simple games
Tradeness
Weighted games

Access to Document

10.1016/j.ipl.2016.01.004

Cite this

@article{1705d4441303423693dcf44a47cb157b,

title = "On the Complexity of Exchanging",

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.",

keywords = "Computational complexity, Simple games, Tradeness, Weighted games",

author = "Xavier Molinero and Martin Olsen and Maria Serna",

year = "2016",

month = jun,

day = "1",

doi = "10.1016/j.ipl.2016.01.004",

language = "English",

volume = "116",

pages = "437--441",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - On the Complexity of Exchanging

AU - Molinero, Xavier

AU - Olsen, Martin

AU - Serna, Maria

PY - 2016/6/1

Y1 - 2016/6/1

N2 - 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.

AB - 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.

KW - Computational complexity

KW - Simple games

KW - Tradeness

KW - Weighted games

UR - http://www.scopus.com/inward/record.url?scp=84957927957&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2016.01.004

DO - 10.1016/j.ipl.2016.01.004

M3 - Journal article

SN - 0020-0190

VL - 116

SP - 437

EP - 441

JO - Information Processing Letters

JF - Information Processing Letters

IS - 6

ER -

On the Complexity of Exchanging

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this