A Clustering Approach to Solving Large Stochastic Matching Problems

by   Milos Hauskrecht, et al.

In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The problem is best described in terms of future buy and sell contracts. By buying less reliable, but less expensive, buy (supply) contracts, a company or a trader can cover a position of more reliable and more expensive sell contracts. The goal is to maximize the expected net gain (profit) by constructing a dose to optimum portfolio out of the available buy and sell contracts. This stochastic planning problem can be formulated as a two-stage stochastic linear programming problem with recourse. However, this formalization leads to solutions that are exponential in the number of possible failure combinations. Thus, this approach is not feasible for large scale problems. In this work we investigate heuristic approximation techniques alleviating the efficiency problem. We primarily focus on the clustering approach and devise heuristics for finding clusterings leading to good approximations. We illustrate the quality and feasibility of the approach through experimental data.


page 1

page 2

page 5

page 6


Agreements between Enterprises digitized by Smart Contracts in the Domain of Industry 4.0

The digital transformation of companies is expected to increase the digi...

What are the Actual Flaws in Important Smart Contracts (and How Can We Find Them)?

We summarize and systematically categorize results from more than 20 sec...

Neur2SP: Neural Two-Stage Stochastic Programming

Stochastic programming is a powerful modeling framework for decision-mak...

Adaptive Partition-based SDDP Algorithms for Multistage Stochastic Linear Programming

In this paper, we extend the adaptive partition-based approach for solvi...

Verifying Catamorphism-Based Contracts using Constrained Horn Clauses

We address the problem of verifying that the functions of a program meet...

Fast Continuous and Integer L-shaped Heuristics Through Supervised Learning

We propose a methodology at the nexus of operations research and machine...