Axis 1: Data valuation for decision making
BackCahiers du GERAD
407 results — page 3 of 21
We investigate the ratio \(\mathcal{I}(G)\)
of the average size of a maximal matching to the size of a maximum matching in a graph G. If many maximal mat...
The problem of portfolio management represents an important and challenging class of dynamic decision making problems, where rebalancing decisions need to be...
BibTeX referenceData-driven optimization with distributionally robust second-order stochastic dominance constraints
Optimization with stochastic dominance constraints has recently received an increasing amount of attention in the quantitative risk management literature. In...
BibTeX reference
Thermostatically-controlled loads have a significant impact on electricity demand after service is restored following an outage, a phenomenon known as cold l...
BibTeX reference
With the ongoing energy transition, electric power and energy systems are becoming increasingly multi-dimensional and complex with higher levels of uncertain...
BibTeX reference
The Tenth Montreal IPSW took place on August 13-27, 2020, and was jointly organized by the Centre de recherches mathématiques (CRM) and the Institute for Dat...
BibTeX reference
We propose a tone-based event study to reveal the aggregate abnormal tone dynamics in media articles around earnings announcements. We test whether they co...
BibTeX reference
The increasingly complex energy systems are turning the attention towards model-free control approaches such as reinforcement learning (RL). This work propos...
BibTeX reference
Distance metric learning algorithms aim to appropriately measure similarities and distances between data points. In the context of clustering, metric learnin...
BibTeX referenceDeep reinforcement learning for optimal stopping with application in financial engineering
Optimal stopping is the problem of deciding the right time at which to take a particular action in a stochastic system, in order to maximize an expected rewa...
BibTeX reference
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they indu...
BibTeX referenceTraining image free high-order stochastic simulation based on aggregated kernel statistics
A training-image free, high-order sequential simulation method is proposed herein, which is based on the efficient inference of high-order spatial statistics...
BibTeX reference
We study the average number \(A(G)\)
of colors in the non-equivalent colorings of a graph \(G\)
. We show some general properties of this graph invariant ...
The Bell numbers count the number of different ways to partition a set of \(n\)
elements while the graphical Bell numbers count the number of non-equivalen...
We empirically test the prediction of Pastor, stambaugh, and Taylor (2020) that green firms outperform brown firms when concerns about climate change increas...
BibTeX reference
Scholars and practitioners have long recognised the importance of data-driven operations and supply chain management (OSCM), which typically centres on produ...
BibTeX reference
We consider the problem of designing vehicle routes in a distribution system that are at the same time cost-effective and visually attractive. In this pape...
BibTeX reference
This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating conic program for...
BibTeX reference
Data acquisition and recording in the form of databases are routine operations. The process of collecting data, however, may experience irregularities, res...
BibTeX reference
Conditional estimation given specific covariate values (i.e., local conditional estimation or functional estimation) is ubiquitously useful with applications...
BibTeX reference