A Minimum-Risk Dynamic Assignment Mechanism Along with an Approximation, Heuristics, and Extension from Single to Batch Assignments

07/02/2020
by   Kirk Bansak, et al.
0

In the classic linear assignment problem, items must be assigned to agents in a manner that minimizes the sum of the costs for each item-agent assignment, where the costs of all possible item-agent pairings are observed in advance. This is a well-known and well-characterized problem, and algorithms exist to attain the solution. In contrast, less attention has been given to the dynamic version of this problem where each item must be assigned to an agent sequentially upon arrival without knowledge of the future items to arrive. This study proposes an assignment mechanism that combines linear assignment programming solutions with stochastic programming methods to minimize the expected loss when assignments must be made in this dynamic sequential fashion, and offers an algorithm for implementing the mechanism. The study also presents an approximate version of the mechanism and accompanying algorithm that is more computationally efficient, along with even more efficient heuristic alternatives. In addition, the study provides an extension to dynamic batch assignment, where items arrive and must be assigned sequentially in groups. An application on assigning refugees to geographic areas in the United States is presented to illustrate the methods.

READ FULL TEXT

page 14

page 16

page 25

page 26

page 27

research
10/13/2022

Online Algorithms for the Santa Claus Problem

The Santa Claus problem is a fundamental problem in fair division: the g...
research
05/23/2014

LASS: a simple assignment model with Laplacian smoothing

We consider the problem of learning soft assignments of N items to K cat...
research
05/04/2020

Foraging-based Optimization of Menu Systems

Computational design of menu systems has been solved in limited cases su...
research
09/21/2022

On Reachable Assignments under Dichotomous Preferences

We consider the problem of determining whether a target item assignment ...
research
08/16/2022

Random Assignment of Indivisible Goods under Constraints

We consider the problem of random assignment of indivisible goods, in wh...
research
09/11/2022

Exploiting Expert Knowledge for Assigning Firms to Industries: A Novel Deep Learning Method

Industry assignment, which assigns firms to industries according to a pr...
research
01/11/2021

A Cooperative Dynamic Task Assignment Framework for COTSBot AUVs

This paper presents a cooperative dynamic task assignment framework for ...

Please sign up or login with your details

Forgot password? Click here to reset