10 citations · 38 across the 23 of their papers we have counts for
7 papers · 1 filter
The neighbourhood convexity
Daniela Bubboloni, José Cáceres
In this paper, we investigate the neighbourhood convexity (-convexity) on graphs, a new finite convexity space grounded in the common closed neighbourhood closure operator. Unli…
Symmetry groups for social preference functions
Daniela Bubboloni, Francesco Nardi
We introduce the anonymity group, the neutrality group and the symmetry group of a social preference function. Inspired by a problem posed by Kelly in 1991 and remained unsolved, w…
Paths and flows for centrality measures in networks
Daniela Bubboloni, Michele Gori
We consider the number of paths that must pass through a subset of vertices of a network in a maximum sequence of arc-disjoint paths connecting two vertices and . We…
Breaking ties in collective decision making
Daniela Bubboloni, Michele Gori
Many classical social preference (multiwinner social choice) correspondences are resolute only when two alternatives and an odd number of individuals are considered. Thus, they gen…
Graph homomorphisms and components of quotient graphs
Daniela Bubboloni
We study how the number of components of a graph can be expressed through the number and properties of the components of a quotient graph We partially rely on…
On the reversal bias of the Minimax social choice correspondence
Daniela Bubboloni, Michele Gori
We introduce three different qualifications of the reversal bias in the framework of social choice correspondences. For each of them, we prove that the Minimax social choice corres…