activity
20082026
most citedThe Complexity of Testing Properties of Simple Games

5 citations · 6 across the 5 of their papers we have counts for

collaborators
Showing cs.GTShow all

6 papers · 1 filter

cs.GT2026

Principal Component Analysis and Power Indices

Xavier Molinero, Enric Monsó, Daniel Samaniego

Measuring the influence of a player in a simple game is a widely studied topic. Shapley-Shubik power index is perhaps the maximum exponent in terms of relevance. Furthermore, other…

cs.GT2023

Markov chains applied to Parrondo's paradox: The coin tossing problem

Xavier Molinero, Camille Mègnien

Parrondo's paradox was introduced by Juan Parrondo in 1996. In game theory, this paradox is described as: A combination of losing strategies becomes a winning strategy. At first gl…

cs.GT2016

Measuring satisfaction in societies with opinion leaders and mediators

Xavier Molinero, Fabián Riquelme, Maria Serna

An opinion leader-follower model (OLF) is a two-action collective decision-making model for societies, in which three kinds of actors are considered: "opinion leaders", "followers"…

cs.GT2016

Dimension and codimension of simple games

Sascha Kurz, Xavier Molinero, Martin Olsen +1

This paper studies the complexity of computing a representation of a simple game as the intersection (union) of weighted majority games, as well as, the dimension or the codimensio…

cs.GT2015★ 1 cited

On the Complexity of Exchanging

X. Molinero, M. Olsen, M. Serna

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 gi…

cs.GT2008★ 5 cited

The Complexity of Testing Properties of Simple Games

Josep Freixas, Xavier Molinero, Martin Olsen +1

Simple games cover voting systems in which a single alternative, 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…