5 papers
A Complete Characterization of the Inverse Eigenvector Centrality Problem for Undirected Graphs
Mauro Passacantando, Fabio Raciti
We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We p…
Optimizing edge weights in the inverse eigenvector centrality problem
Mauro Passacantando, Fabio Raciti
In this paper we study the inverse eigenvector centrality problem on directed graphs: given a prescribed node centrality profile, we seek edge weights that realize it. Since this i…
Least cores in energy community games
Giancarlo Bigi, Davide Fioriti, Antonio Frangioni +2
An energy community is modeled as a cooperative game, where a veto player is needed beyond the prosumers to manage the community, and the worth of a coalition is its benefit compar…
Solving non-monotone equilibrium problems via a DIRECT-type approach
Stefano Lucidi, Mauro Passacantando, Francesco Rinaldi
A global optimization approach for solving non-monotone equilibrium problems (EPs) is proposed. The class of (regularized) gap functions is used to reformulate any EP as a constrai…
A Game-Theoretic Approach for Runtime Capacity Allocation in MapReduce
Eugenio Gianniti, Danilo Ardagna, Michele Ciavotta +1
Nowadays many companies have available large amounts of raw, unstructured data. Among Big Data enabling technologies, a central place is held by the MapReduce framework and, in par…