Results 81 to 90 of about 5,397,625 (216)
Naval Research Logistics (NRL), Volume 73, Issue 5, Page 810-835, August 2026.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
Combinatorial Algorithms for Submodular Function Minimization and Related Problems [PDF]
, 2015 Submodular functions are common in combinatorics; examples include the cut capacity function of a graph and the rank function of a matroid. The submodular function minimization problem generalizes the classical minimum cut problem and also contains a ...
Price, Christopher
core
A Submodular Optimization Framework for Imbalanced Text Classification With Data Augmentation
IEEE Access, 2023 In the domain of text classification, imbalanced datasets are a common occurrence. The skewed distribution of the labels of these datasets poses a great challenge to the performance of text classifiers.
Eyor Alemayehu, Yi Fang
doaj +1 more source
Optimal Selling Mechanisms With Endogenous Seller Outside Offers
International Economic Review, Volume 67, Issue 3, Page 875-891, August 2026.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
Near Optimal Dynamic Mobile Advertisement Offloading With Time Constraints
IEEE Access, 2019 Owing to the accuracy and flexibility, mobile advertising has become a very attractive marketing method based on smart mobile terminals. The more common mobile advertisement distribution methods are based on location and content.
Wanru Xu, Chaocan Xiang, Chang Tian
doaj +1 more source
How to see the forest despite the trees
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract One of the major starting points of discrete optimization is the theorem of Nash‐Williams and Tutte on the existence of k$k$ disjoint spanning trees of a graph, along with its counterpart on the existence of k$k$ forests covering all edges of the graph.
Erika Bérczi‐Kovács, András Frank
wiley +1 more source
Near-Optimal Convergent Approach for Composed Influence Maximization Problem in Social Networks
IEEE Access, 2019 Crowd psychology is a critical factor when considering information diffusion, which has been modeled as composed influence. The composed influence is represented as a hyperedge in a graph model.
Jianming Zhu +3 more
doaj +1 more source
Application of an Open‐Source Modular Framework for Pharmacokinetic, Pharmacodynamic, and Safety Simulations to Anti‐Tuberculosis Drugs [PDF]
CPT Pharmacometrics Syst PharmacolABSTRACT Tuberculosis (TB) treatment requires long‐term multidrug regimens where dosing, efficacy, and safety optimization remain challenging. This tutorial establishes an integrated, open‐source, modular framework connecting high‐throughput PBPK (HT‐PBPK) simulations, mechanistic PBPK models, pharmacodynamic endpoints, and safety predictions for anti ...
Siccardi M +9 more
europepmc +2 more sources
Lower bounds for cube‐ideal set‐systems
Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.Abstract A set‐system S⊆{0,1}n$S\subseteq \lbrace 0,1\rbrace ^n$ is cube‐ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential lower bounds on the size of cube‐ideal set‐systems, and linear lower bounds on their ...
Ahmad Abdi +3 more
wiley +1 more source
Efficient investment, search, and sorting in matching markets
Theoretical Economics, Volume 21, Issue 3, Page 810-848, July 2026.We study markets where heterogeneous agents first make investment decisions and then engage in a costly search to form productive matches. The trading process is a random search and bargaining with explicit search costs. Despite potential hold‐up and matching problems, we prove that the constrained efficient allocation is an equilibrium: the agents ...
Alp Atakan, Michael Richter, Matan Tsur
wiley +1 more source