Results 81 to 90 of about 11,284 (160)
An improved approximation algorithm for maximizing a DR-submodular function over a convex set
, 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 ...
Du, Donglei +4 more
openaire +2 more sources
The Maximum Traveling Salesman Problem with Submodular Rewards [PDF]
, 2012 In this paper, we look at the problem of finding the tour of maximum reward on an undirected graph where the reward is a submodular function, that has a curvature of $\kappa$, of the edges in the tour. This problem is known to be NP-hard.
Jawaid Stephen, L. Smith, Syed Talha
core
Econometrica, Volume 93, Issue 6, Page 2007-2042, November 2025.We study reputation formation where a long‐run player repeatedly observes private signals and takes actions. Short‐run players observe the long‐run player's past actions but not her past signals. The long‐run player can thus develop a reputation for playing a distribution over actions, but not necessarily for playing a particular mapping from signals ...
Daniel Luo, Alexander Wolitzky
wiley +1 more source
Existence of a non‐stationary equilibrium in search‐and‐matching models: TU and NTU
Theoretical Economics, Volume 20, Issue 4, Page 1411-1460, November 2025.This paper proves the existence of a non‐stationary equilibrium in the canonical search‐and‐matching model with heterogeneous agents. Non‐stationarity entails that the number and characteristics of unmatched agents evolve endogenously over time.
Christopher Sandmann, Nicolas Bonneton
wiley +1 more source
Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity
, 2018 ITCS2019
Chen, Wei +2 more
openaire +4 more sources
Journal of Numerical Analysis and Approximation Theory, 2018 In this paper, for the univariate Bernstein-Kantorovich-Choquet, Szasz-Kantorovich-Choquet, Baskakov-Kantorovich-Choquet and Bernstein-Durrmeyer-Choquet operators written in terms of the Choquet integrals with respect to monotone and submodular set ...
Sorin Gal
doaj +2 more sources
Journal of Mathematical Analysis and Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gal, Sorin G., Opris, Bogdan D.
openaire +2 more sources
Balanced sets in an independence structure induced by a submodular function
Journal of Mathematical Analysis and Applications, 1983 AbstractA submodular (and non-decreasing) function on a set induces an independence structure; the notion of a “balanced” set in this situation helps us determine whether a given independence structure is induced by any submodular function other than its own rank function, answering a question of U. S. R. Murty and I. Simon.
openaire +1 more source
On the Initial Set of Constraints for Graph-Based Submodular Function Maximization
Acta CyberneticaA crucial problem in combinatorial optimization is the submodular function maximization (SFM), and in many cases it involves graphs on which the maximization is specified. The problem is well-studied and hence there are several proposed algorithms in the literature.
Eszter Csókás, Tamás Vinkó
openaire +1 more source
Maximizing Submodular Set Functions Subject to Multiple Linear Constraints [PDF]
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009 Ariel Kulik, Hadas Shachnai, Tami Tamir
openaire +1 more source