Xavier Molinero

Orcid: 0000-0002-5203-4347

Affiliations:
  • Polytechnic University of Catalonia, Barcelona, Spain


According to our database1, Xavier Molinero authored at least 36 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Multidimension: a dimensionality extension of simple games.
Comput. Appl. Math., December, 2023

On the generalized dimension and codimension of simple games.
Eur. J. Oper. Res., 2023

Markov chains applied to Parrondo's paradox: The coin tossing problem.
CoRR, 2023

2021
On Weights and Quotas for Weighted Majority Voting Games.
Games, 2021

Influence decision models: From cooperative game theory to social network analysis.
Comput. Sci. Rev., 2021

2020
Coalitional Power Indices Applied to Voting Systems.
Proceedings of the 9th International Conference on Operations Research and Enterprise Systems, 2020

2019
Measuring satisfaction and power in influence based decision systems.
Knowl. Based Syst., 2019

2018
Centrality measure in social networks based on linear threshold model.
Knowl. Based Syst., 2018

Satisfaction and Power in Unanimous Majority Influence Decision Models.
Electron. Notes Discret. Math., 2018

2016
On the complexity of exchanging.
Inf. Process. Lett., 2016

The Complexity of Measuring Power in Generalized Opinion Leader Decision Models.
Electron. Notes Discret. Math., 2016

Dimension and codimension of simple games.
Electron. Notes Discret. Math., 2016

Measuring satisfaction in societies with opinion leaders and mediators.
CoRR, 2016

On the Construction of High-Dimensional Simple Games.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015
Forms of representation for simple games: Sizes, conversions and equivalences.
Math. Soc. Sci., 2015

Cooperation through social influence.
Eur. J. Oper. Res., 2015

2014
Power Indices of Influence Games and New Centrality Measures for Agent Societies and Social Networks.
Proceedings of the Ambient Intelligence - Software and Applications, 2014

2013
Power indices of influence games and new centrality measures for social networks.
CoRR, 2013

Star-shaped mediation in influence games.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012
Social Influence as a Voting System: a Complexity Analysis of Parameters and Properties
CoRR, 2012

Complete voting systems with two classes of voters: weightedness and counting.
Ann. Oper. Res., 2012

Computation of several power indices by generating functions.
Appl. Math. Comput., 2012

2011
On the complexity of problems on simple games.
RAIRO Oper. Res., 2011

2010
Weighted games without a unique minimal representation in integers.
Optim. Methods Softw., 2010

Maximum Tolerance and Maximum Greatest Tolerance - Weights and Threshold of Strict Separating Systems.
Proceedings of the ICAART 2010 - Proceedings of the International Conference on Agents and Artificial Intelligence, Volume 1, 2010

2009
Simple games and weighted games: A theoretical and computational viewpoint.
Discret. Appl. Math., 2009

On the existence of a minimum integer representation for weighted voting systems.
Ann. Oper. Res., 2009

2008
The Greatest Allowed Relative Error in Weights and Threshold of Strict Separating Systems.
IEEE Trans. Neural Networks, 2008

The Complexity of Testing Properties of Simple Games
CoRR, 2008

2007
Minimal Representations for Majority Games.
Proceedings of the Computation and Logic in the Real World, 2007

2006
Some Advances in the Theory of Voting Systems Based on Experimental Algorithms.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2005
Efficient iteration in admissible combinatorial classes.
Theor. Comput. Sci., 2005

2004
An Experimental Study of Unranking Algorithms.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003
Generic Algorithms for the Generation of Combinatorial Objects.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2001
A generic approach for the unranking of labeled combinatorial classes.
Random Struct. Algorithms, 2001

Iterating Through Labelled Combinatorial Structures.
Electron. Notes Discret. Math., 2001


  Loading...