Results 41 to 50 of about 11,336 (151)
Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications [PDF]
We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a difference between submodular functions. Similar to [30], our new algorithms are guaranteed to monotonically reduce the objective function at every step.
Bilmes, Jeff, Iyer, Rishabh
core +1 more source
Data and Competition: A Simple Framework
ABSTRACT Does enhanced access to data foster or hinder competition among firms? Using a competition‐in‐utility framework that encompasses many situations where firms use data, we model data as a revenue‐shifter and identify two opposite effects: a mark‐up effect according to which data induces firms to compete harder, and a surplus‐extraction effect ...
Alexandre de Cornière, Greg Taylor
wiley +1 more source
Multivariate Incomplete Information in the Mixture Model of Contests
ABSTRACT A general mixture model of contests is introduced, combining stochastic performance and multivariate incomplete information. Performance is determined by a mixture distribution with endogenous weights on a good and bad distribution, respectively.
René Kirkegaard
wiley +1 more source
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
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
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
The Maximum Traveling Salesman Problem with Submodular Rewards [PDF]
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
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
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

