Matching supply and demand in a sharing economy: Classification, computational complexity, and application

•We analyze the structure of deterministic problems matching supply and demand in a sharing environment.•We provide a classification of these optimization problems.•We provide an analysis of computational complexity of several problems.•We consider the case of sharing parking space and explore the p...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research Vol. 278; no. 2; pp. 578 - 595
Main Authors: Boysen, Nils, Briskorn, Dirk, Schwerdfeger, Stefan
Format: Journal Article
Language:English
Published: Elsevier B.V 16.10.2019
Subjects:
Classification
Computational complexity
Matching
Sharing economy
Matching
Computational complexity
Sharing economy
Classification
ISSN:0377-2217, 1872-6860
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•We analyze the structure of deterministic problems matching supply and demand in a sharing environment.•We provide a classification of these optimization problems.•We provide an analysis of computational complexity of several problems.•We consider the case of sharing parking space and explore the potential contribution of solving deterministic problems. The sharing economy, i.e., the cooperative consumption of goods and services offered by private households or companies via online market places, gains more and more attention. Most sharing platforms coordinate transactions by generating each consumer an individual list of suited and available resources to choose from. If plenty online requests arrive rather simultaneously and compete for the scarce shared resources, however, an optimization-based coordination of supply and demand promises much better matches (e.g., more satisfied requests). This paper focuses deterministic matching problems and provides a classification scheme for the resulting optimization problems occurring in different areas of the sharing economy. These matching problems vary, for instance, if immobile (e.g., parking space) or mobile resources (e.g., vehicles of a car sharing provider) are shared. With the help of this classification, we give a detailed overview on known and novel complexity results. Furthermore, we apply the example of sharing parking space and explore the potential contribution of deterministic matchings when applied in a dynamic, uncertain, and opportunistic environment.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2019.04.032