Results 91 to 100 of about 13,203 (237)
Hypergraph cuts with edge-dependent vertex weights
Applied Network Science, 2022 We develop a framework for incorporating edge-dependent vertex weights (EDVWs) into the hypergraph minimum s-t cut problem. These weights are able to reflect different importance of vertices within a hyperedge, thus leading to better characterized cut ...
Yu Zhu, Santiago Segarra
doaj +1 more source
Worst-case Optimal Submodular Extensions for Marginal Estimation [PDF]
, 2018 Submodular extensions of an energy function can be used to efficiently compute approximate marginals via variational inference. The accuracy of the marginals depends crucially on the quality of the submodular extension.
Kumar, M. Pawan +2 more
core +1 more source
Data and Competition: A Simple Framework
The RAND Journal of Economics, Volume 56, Issue 4, Page 494-510, Winter 2025.ABSTRACT Does enhanced access to data foster or hinder competition among firms? Using a competition‐in‐utility framework that encompasses many situations where firms use data, we model data as a revenue‐shifter and identify two opposite effects: a mark‐up effect according to which data induces firms to compete harder, and a surplus‐extraction effect ...
Alexandre de Cornière, Greg Taylor
wiley +1 more source
Polarity related influence maximization in signed social networks. [PDF]
PLoS ONE, 2014 Influence maximization in social networks has been widely studied motivated by applications like spread of ideas or innovations in a network and viral marketing of products.
Dong Li +5 more
doaj +1 more source
Multivariate Incomplete Information in the Mixture Model of Contests
The RAND Journal of Economics, Volume 56, Issue 4, Page 607-624, Winter 2025.ABSTRACT A general mixture model of contests is introduced, combining stochastic performance and multivariate incomplete information. Performance is determined by a mixture distribution with endogenous weights on a good and bad distribution, respectively.
René Kirkegaard
wiley +1 more source
A T2T-Based Offloading Method: Virtual Bank With Movement Prediction
IEEE Access, 2018 Rapid developments in network technologies and mobile devices improve our lives, but the resultant fast-growing traffic leads to a lack of cellular network resources and breaks the balance between profit and costs for network providers.
Lifeng Mai +3 more
doaj +1 more source
Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints [PDF]
, 2013 We investigate two new optimization problems -- minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint (submodular knapsack ...
Bilmes, Jeff, Iyer, Rishabh
core +1 more source
Journal of Economic Surveys, Volume 39, Issue 5, Page 1971-1998, December 2025.ABSTRACT This study reports the results of a systematic literature review on auctions mechanism. Auctions are a very popular practice employed in many fields but does not exist a research that investigates the use of auctions under a cross‐disciplinary approach. This work is focused on analyzing which are the areas where auctions are mostly adopted and
Alberto Michele Felicetti +3 more
wiley +1 more source
Performance guarantees for greedy maximization of non-submodular controllability metrics
, 2018 A key problem in emerging complex cyber-physical networks is the design of information and control topologies, including sensor and actuator selection and communication network design.
barabási +6 more
core +1 more source
Discretised sum‐product theorems by Shannon‐type inequalities
Journal of the London Mathematical Society, Volume 112, Issue 6, December 2025.Abstract By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if A⊂[1,2]$A \subset [1,2]$ is a (δ,σ)$(\delta,\sigma)$‐set, with |A|=δ−σ$|A| = \delta ^{-\sigma }$, then A+A$A+A$ or AA$AA$ has δ$\delta$‐covering number at least δ−c|A|$\delta ^{-c}|A|$ for ...
András Máthé, William O'Regan
wiley +1 more source