Results 81 to 90 of about 2,699,353 (198)
Assortative Matching on Income
We analyze marital matching on income using an extremely rich Dutch data set containing all income tax files over seven years. We develop a novel methodology that directly extends previous contributions to allow for highly flexible matching patterns. Investigating all marriages that took place between 2013 and 2019, we find that marital patterns are ...
Pierre‐André Chiappori +3 more
wiley +1 more source
Limits on Computationally Efficient VCG-Based Mechanisms for Combinatorial Auctions and Public Projects [PDF]
A natural goal in designing mechanisms for auctions and public projects is to maximize the social welfare while incentivizing players to bid truthfully.
Buchfuhrer, David Isaac
core +1 more source
A Universal Meta‐Heuristic Framework for Influence Maximisation in Hypergraphs
ABSTRACT Influence maximisation (IM) aims to select a small number of nodes that are able to maximise their influence in a network and covers a wide range of applications. Despite numerous attempts to provide effective solutions in simple networks, higher‐order interactions between entities in various real‐world systems are usually not taken into ...
Ming Xie +5 more
wiley +1 more source
Fossil Fuels and Renewable Energy: Mix or Match?
ABSTRACT This article investigates the influence of technological ownership on pricing strategies and productive efficiency. Our motivation comes from the evolving landscape of electricity markets where firms are transitioning from diversified to specialized portfolios, focusing on renewable energy or fossil fuels.
Natalia Fabra, Gerard Llobet
wiley +1 more source
On the Supremum of Singleton Ratios in Submodular Functions
Let N be a finite set of cardinality n, and let a∈N. A submodular function f on N with f(a)=1 is defined to be a-reduced if, for any decomposition f=g+h into submodular functions, where h does not depend on a, it follows that h is identically zero.
Laszlo Csirmaz
doaj +1 more source
Influence Maximization in Signed Social Networks With Opinion Formation
Influence maximization (IM) has been widely studied in recent years. Given fixed number of seed users and certain diffusion models, the IM problem aims to select proper seed users in a social networks such that they can achieve the maximal spread of ...
Wenxin Liang +5 more
doaj +1 more source
Learning with submodular functions: A convex optimization perspective [PDF]
International audienceSubmodular functions are relevant to machine learning for at least two reasons: (1) some problems may be expressed directly as the optimization of submodular functions and (2) the lovasz extension of submodular functions provides a ...
Bach, Francis, Francis Bach
core +1 more source
Same/Other/All K‐Fold Cross‐Validation for Estimating Similarity of Patterns in Data Subsets
ABSTRACT In many real‐world applications of machine learning, we are interested to know if it is possible to train on the data that we have gathered so far, and obtain accurate predictions on a new test data subset that is qualitatively different in some respect (time period, geographic region, etc.).
Toby Dylan Hocking +5 more
wiley +1 more source
Submodular Functions: from Discrete to Continous Domains [PDF]
International audienceSubmodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time.
Bach, Francis, Francis Bach
core +1 more source
Maximizing submodular functions using probabilistic graphical models [PDF]
We consider the problem of maximizing submodular functions; while this problem is known to be NP-hard, several numerically efficient local search techniques with approximation guarantees are available.
Sesh Kumar, K. S., Bach, Francis
core +3 more sources

