Results 21 to 30 of about 11,336 (151)
Performance guarantees for greedy maximization of non-submodular controllability metrics
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
Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity
ITCS2019
Wei Chen 0013 +2 more
openaire +4 more sources
ABSTRACT This paper examines the impacts of Volume‐Based Procurement (VBP) policies on pharmaceutical supply chains, with a focus on the strategic behaviors of manufacturers. VBP aims to reduce costs and stabilize supplies by centralizing procurement through competition based on volumes and prices.
Nani Zhou, Tong Wang, Guohua Wan
wiley +1 more source
ABSTRACT We are concerned with the stability of a transferable‐utility cooperative (TU) game. First, the concept of core can be weakened so that the blocking of changes is limited to only those with multilateral backings. This principle of consensual blocking, as well as the traditional core‐defining one of unilateral blocking and one straddling in ...
Jian Yang
wiley +1 more source
Streaming Algorithms for Submodular Function Maximization
We consider the problem of maximizing a nonnegative submodular set function $f:2^{\mathcal{N}} \rightarrow \mathbb{R}^+$ subject to a $p$-matchoid constraint in the single-pass streaming setting.
A Badanidiyuru Varadaraja +16 more
core +1 more source
Resource redeployment as an entry advantage in resource‐poor settings
Abstract Research Summary Scarcity of productive factors poses a challenge for firms entering underdeveloped regions. We theorize that incumbent firms can overcome scarcity of skilled human capital in local labor markets by redeploying workers from existing units.
Jasmina Chauvin +2 more
wiley +1 more source
An improved approximation algorithm for maximizing a DR-submodular function over a convex set
Maximizing a DR-submodular function subject to a general convex set is an NP-hard problem arising from many applications in combinatorial optimization and machine learning. While it is highly desirable to design efficient approximation algorithms under this general setting where neither the objective function is monotonic nor the feasible set is down ...
Donglei Du +4 more
openaire +2 more sources
ABSTRACT Networked control systems (NCSs) often suffer from performance degradation due to limited communication bandwidth, which can cause data transmission conflicts and packet loss. Existing scheduling strategies may fail to simultaneously meet the real‐time requirements and the importance of multisensor data, and they are particularly vulnerable ...
Da Chen +5 more
wiley +1 more source
Monotonic Decompositions of Submodular Set Functions
26 ...
Kristóf Bérczi +4 more
openaire +2 more sources
Optimal Selling Mechanisms With Endogenous Seller Outside Offers
ABSTRACT We examine a two‐stage selling mechanism design problem, where the buyer makes her report and the seller endogenously decides his effort (hidden investment) to generate a possibly better outside offer. The optimal mechanism shows that the seller's effort depends on the reported value of the buyer; a higher value lowers the seller's incentive ...
Xiaogang Che +3 more
wiley +1 more source

