Results 121 to 130 of about 1,352 (208)
Submodular optimization is a fundamental problem with many applications in machine learning, often involving decision-making over datasets with sensitive attributes such as gender or age. In such settings, it is often desirable to produce a diverse solution set that is fairly distributed with respect to these attributes.
Wenjing Chen +3 more
openaire +4 more sources
Multilayer hypergraphs provide a unified representation of influence diffusion in complex networks by coupling relation layers through shared entities and encoding higher-order group interactions as hyperedges.
Yanan Zhang +5 more
doaj +1 more source
Fairness-Aware Opinion Seeding in Undirected Signed Friedkin–Johnsen Networks
Opinion-maximization methods often optimize an aggregate network response and may therefore distribute target-aligned intervention gains unevenly across groups.
Zenan Lu +4 more
doaj +1 more source
Ordinal notions of submodularity
We consider several ordinal formulations of submodularity, defined for arbitrary binary relations on lattices. Two of these formulations are essentially due to Kreps [Kreps, D.M., 1979.
Chambers, Christopher P. +1 more
core
Efficient Sensor Node Selection for Observability Gramian Optimization. [PDF]
Yamada K +5 more
europepmc +1 more source
Extremality of submodular functions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms. [PDF]
Yang Y, Chen PA, Lee YC, Fanchiang YY.
europepmc +1 more source
The generalized influence blocking maximization problem. [PDF]
Erd FC, Vignatti AL, Silva MVGD.
europepmc +1 more source
Conserved and Taxon-Specific Patterns of Phenotypic Modularity in the Mammalian Dentition. [PDF]
Takenaka R, Clay SM, Yoo S, Hlusko LJ.
europepmc +1 more source
Submodularity and supermodularity in contest games
This paper presents various examples of two-player submodular or supermodular contest games. Emphasizing the three main elements of a contest model, our examples revolve around situations where (i) contest success function allows for a draw, (ii) winning
Karagözoğlu, Emin +2 more
core +1 more source

