Online contextual learning with perishable resources allocation

Xin Pan, Jie Song, Jingtong Zhao and Van-Anh Truong

IISE Transactions, 2020, vol. 52, issue 12, 1343-1357

Abstract: We formulate a novel class of online matching problems with learning. In these problems, randomly arriving customers must be matched to perishable resources so as to maximize a total expected reward. The matching accounts for variations in rewards among different customer–resource pairings. It also accounts for the perishability of the resources. Our work is motivated by a healthcare application, but it can be easily extended to other service applications. Our work belongs to the online resource allocation streams in service systems. We propose the first online algorithm for contextual learning and resource allocation with perishable resources. Our algorithm explores and exploits in distinct interweaving phases. We prove that our algorithm achieves an expected regret per period that increases sub-linearly with the number of planning cycles.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/24725854.2020.1752958 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:52:y:2020:i:12:p:1343-1357

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/24725854.2020.1752958

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().