Results 51 to 60 of about 9,676,389 (199)
An improved approximation algorithm for maximizing a DR-submodular function over a convex set
CoRR, 2022 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
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
Maximizing non-monotone submodular set functions subject to different constraints: Combined algorithms [PDF]
Operations Research Letters, 2011 We study the problem of maximizing constrained non-monotone submodular functions and provide approximation algorithms that improve existing algorithms in terms of either the approximation factor or simplicity. Our algorithms combine existing local search and greedy based algorithms. Different constraints that we study are exact cardinality and multiple
Salman Fadaei +2 more
openaire +4 more sources
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
New Query Lower Bounds for Submodular Function Minimization [PDF]
, 2020 We consider submodular function minimization in the oracle model: given black-box access to a submodular set function f:2^[n] → ℝ, find an element of arg min_S {f(S)} using as few queries to f(⋅) as possible. State-of-the-art algorithms succeed with Õ(n²)
Graur, Andrei +4 more
core +1 more source
On the Supremum of Singleton Ratios in Submodular Functions
MathematicsLet 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
Approximation Algorithms for Stochastic Boolean Function Evaluation and Stochastic Submodular Set Cover [PDF]
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013 Stochastic Boolean Function Evaluation is the problem of determining the value of a given Boolean function f on an unknown input x, when each bit of x_i of x can only be determined by paying an associated cost c_i. The assumption is that x is drawn from a given product distribution, and the goal is to minimize the expected cost.
Amol Deshpande +2 more
openaire +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
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
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