Show simple item record

dc.contributor.authorFreixas Bosch, Josep
dc.contributor.authorMolinero Albareda, Xavier
dc.contributor.authorOlsen, Martin
dc.contributor.authorSerna Iglesias, María José
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2014-12-18T19:12:37Z
dc.date.available2014-12-18T19:12:37Z
dc.date.created2011-10
dc.date.issued2011-10
dc.identifier.citationFreixas, J. [et al.]. On the complexity of problems on simple games. "RAIRO. Operations research", Octubre 2011, p. 295-314.
dc.identifier.issn0399-0559
dc.identifier.urihttp://hdl.handle.net/2117/25093
dc.descriptionThe original publication is available at www.rairo-ro.org
dc.description.abstractSimple 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 game representation used as input. We consider four natural explicit representations: winning, losing, minimal winning, and maximal losing. We first analyze the complexity of testing whether a game is simple and testing whether a game is weighted. We show that, for the four types of representations, both problems can be solved in polynomial time. Finally, we provide results on the complexity of testing whether a simple game or a weighted game is of a special type. We analyze strongness, properness, weightedness, homogeneousness, decisiveness and majorityness, which are desirable properties to be fulfilled for a simple game. Finally, we consider the possibility of representing a game in a more succinct and natural way and show that the corresponding recognition problem is hard.
dc.format.extent20 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Teoria de jocs
dc.subject.lcshVoting--Mathematical models
dc.subject.lcshGame theory
dc.subject.otherSimple
dc.subject.otherWeighted
dc.subject.otherMajority games
dc.subject.otherNP-completeness
dc.titleOn the complexity of problems on simple games
dc.typeArticle
dc.subject.lemacVot -- Models matemàtics
dc.subject.lemacJocs, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. GRTJ - Grup de Recerca en Teoria de Jocs
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.identifier.doi10.1051/ro/2011115
dc.description.peerreviewedPeer Reviewed
dc.subject.amsClassificació AMS::91 Game theory, economics, social and behavioral sciences::91A Game theory
dc.rights.accessOpen Access
local.identifier.drac9431557
dc.description.versionPostprint (published version)
local.citation.authorFreixas, J.; Molinero, X.; Olsen, M.; Serna, M.
local.citation.publicationNameRAIRO. Operations research
local.citation.startingPage295
local.citation.endingPage314


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder