Results 71 to 80 of about 12,182 (176)
, 2015 We address the problem of maximizing an unknown submodular function that can only be accessed via noisy evaluations. Our work is motivated by the task of summarizing content, e.g., image collections, by leveraging users' feedback in form of clicks or ...
Krause, Andreas +2 more
core +1 more source
Data and Competition: A Simple Framework
The RAND Journal of Economics, Volume 56, Issue 4, Page 494-510, Winter 2025.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
IET Renewable Power Generation, 2023 This paper aims to present an optimization method for the best bus selection (BBS) in the large‐scale power systems in order to send the input signals to the damping controllers.
Mohsen Darabian +2 more
doaj +1 more source
, 2017 We start with an overview of a class of submodular functions called SCMMs (sums of concave composed with non-negative modular functions plus a final arbitrary modular). We then define a new class of submodular functions we call {\em deep submodular functions} or DSFs. We show that DSFs are a flexible parametric family of submodular functions that share
Bilmes, Jeffrey, Bai, Wenruo
openaire +2 more sources
Multivariate Incomplete Information in the Mixture Model of Contests
The RAND Journal of Economics, Volume 56, Issue 4, Page 607-624, Winter 2025.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
Applied Sciences, 2019 Competitive Influence Maximization ( CIM ) problem, which seeks a seed set nodes of a player or a company to propagate their product’s information while at the same time their competitors are conducting similar strategies, has been paid much ...
Canh V. Pham +3 more
doaj +1 more source
Submodular Function Maximization for Group Elevator Scheduling
, 2017 We propose a novel approach for group elevator scheduling by formulating it as the maximization of submodular function under a matroid constraint. In particular, we propose to model the total waiting time of passengers using a quadratic Boolean function.
Nikovski, Daniel +2 more
core +1 more source
Journal of Economic Surveys, Volume 39, Issue 5, Page 1971-1998, December 2025.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
Hypergraph cuts with edge-dependent vertex weights
Applied Network Science, 2022 We develop a framework for incorporating edge-dependent vertex weights (EDVWs) into the hypergraph minimum s-t cut problem. These weights are able to reflect different importance of vertices within a hyperedge, thus leading to better characterized cut ...
Yu Zhu, Santiago Segarra
doaj +1 more source
Maximizing k -Submodular Functions and Beyond [PDF]
ACM Transactions on Algorithms, 2016 We consider the maximization problem in the value oracle model of functions defined on k -tuples of sets that are submodular in every orthant and r -wise monotone, where k ⩾ 2 and 1 ⩽ r ⩽ k .
Ward, J, Zivny, S
openaire +3 more sources