Results 71 to 80 of about 11,284 (160)
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
Discretised sum‐product theorems by Shannon‐type inequalities
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
Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas
We investigate the approximability of several classes of real-valued functions by functions of a small number of variables ({\em juntas}). Our main results are tight bounds on the number of variables required to approximate a function $f:\{0,1\}^n ...
Feldman, Vitaly, Vondrak, Jan
core +1 more source
Does Twin Transition Facilitate Exporting? The Case of Logistics Innovation
ABSTRACT Firms need to overcome two hurdles to enter foreign markets: deciding whether to export and the intensity of their export sales. Although logistics plays a crucial role in exporting, the link between logistics innovation and exporting remains unexplored.
Areti Gkypali +2 more
wiley +1 more source
Submodularity of a Set Label Disagreement Function
A set label disagreement function is defined over the number of variables that deviates from the dominant label. The dominant label is the value assumed by the largest number of variables within a set of binary variables. The submodularity of a certain family of set label disagreement function is discussed in this manuscript. Such disagreement function
openaire +2 more sources
ABSTRACT We study the target return strategy (TRS), which exits the market once the return reaches a preset target. We show that the holding‐period return (HPR) cannot mean‐variance dominate TRS, but TRS can mean‐variance dominate HPR. We theoretically analyze TRS and quantitatively illustrate that training targets by a mean‐variance utility ...
Ying Xue, Zheng Wen, Xu Jiang
wiley +1 more source
Maximizing General Set Functions by Submodular Decomposition
We present a branch and bound method for maximizing an arbitrary set function h mapping 2^V to R. By decomposing h as f-g, where f is a submodular function and g is the cut function of a (simple, undirected) graph G with vertex set V, our original problem is reduced to a sequence of submodular maximization problems.
openaire +2 more sources
Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack [PDF]
We present a new approximation algorithm for the stochastic submodular set cover (SSSC) problem called adaptive dual greedy . We use this algorithm to obtain a 3-approximation algorithm solving the stochastic Boolean function evaluation (SBFE) problem for linear threshold formulas (LTFs).
Amol Deshpande +2 more
openaire +1 more source
A note on Laplacian bounds, deformation properties, and isoperimetric sets in metric measure spaces
Abstract In the setting of length PI spaces satisfying a suitable deformation property, it is known that each isoperimetric set has an open representative. In this paper, we construct an example of a length PI space (without the deformation property) where an isoperimetric set does not have any representative whose topological interior is nonempty ...
Enrico Pasqualetto, Tapio Rajala
wiley +1 more source
A Mazur-Orlicz type theorem for submodular set functions
Let \({\mathcal L}\) be a lattice of subsets of a given set \(\Omega\) with \(\emptyset \in {\mathcal L}\). A function \(\gamma:{\mathcal L}\to {\mathbb{R}}\cup \{- \infty \}\) is called a submodular (modular) set function if \(\gamma (\emptyset)=0\) and \[ \gamma (A\cup B)+\gamma (A\cap B)\leq (=)\gamma (A)+\gamma (B),\quad A\in {\mathcal L},\quad B ...
openaire +2 more sources

