Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets

We study a dynamic matching procedure where homogeneous agents arrive at random according to a Poisson process and form edges at random yielding a sparse market. Agents leave according to a certain departure distribution and may leave early by forming a pair with a compatible agent. The primary obje...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bäumler, Johannes, Bullinger, Martin, Kober, Stefan, Zhu, Donghao
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Bäumler, Johannes
Bullinger, Martin
Kober, Stefan
Zhu, Donghao
description We study a dynamic matching procedure where homogeneous agents arrive at random according to a Poisson process and form edges at random yielding a sparse market. Agents leave according to a certain departure distribution and may leave early by forming a pair with a compatible agent. The primary objective is to maximize the number of matched agents. Our main result is to show that a mild condition on the departure distribution suffices to get almost optimal performance of instantaneous matching, despite operating in a thin market. We are thus the first to provide a natural condition under which instantaneous decisions are superior in a market that is both sparse and thin. This result is surprising because similar results in the previous literature are based on market thickness. In addition, instantaneous matching performs well with respect to further objectives such as minimizing waiting times and avoiding the risk of market congestion. We develop new techniques for proving our results going beyond commonly adopted methods for Markov processes.
doi_str_mv 10.48550/arxiv.2206.10287
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2206_10287</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2206_10287</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-c28b25ff3ff76976678f63e851d1c8df85bfb975182657380859abf8de0b51f43</originalsourceid><addsrcrecordid>eNotj7tOwzAYhb0woMIDMOEXSPCltv-MqIVSqYiB7JHt-G8tqFPZKSJvTyhIR-eyHOkj5I6zeglKsQebv-NXLQTTNWcCzDXZvJ9PIcchx3GiA9JtKqNNs8JwLnQdfCxxSIXGRNvDbOsp2WP09NWOft77ueSPMJYbcoX2s4Tb_1yQ9vmpXb1Uu7fNdvW4q6w2pvICnFCIEtHoxmhtALUMoHjPPfQIyqFrjOIgtDISGKjGOoQ-MKc4LuWC3P_dXki6U45Hm6ful6i7EMkfgoNGZA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets</title><source>arXiv.org</source><creator>Bäumler, Johannes ; Bullinger, Martin ; Kober, Stefan ; Zhu, Donghao</creator><creatorcontrib>Bäumler, Johannes ; Bullinger, Martin ; Kober, Stefan ; Zhu, Donghao</creatorcontrib><description>We study a dynamic matching procedure where homogeneous agents arrive at random according to a Poisson process and form edges at random yielding a sparse market. Agents leave according to a certain departure distribution and may leave early by forming a pair with a compatible agent. The primary objective is to maximize the number of matched agents. Our main result is to show that a mild condition on the departure distribution suffices to get almost optimal performance of instantaneous matching, despite operating in a thin market. We are thus the first to provide a natural condition under which instantaneous decisions are superior in a market that is both sparse and thin. This result is surprising because similar results in the previous literature are based on market thickness. In addition, instantaneous matching performs well with respect to further objectives such as minimizing waiting times and avoiding the risk of market congestion. We develop new techniques for proving our results going beyond commonly adopted methods for Markov processes.</description><identifier>DOI: 10.48550/arxiv.2206.10287</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms</subject><creationdate>2022-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2206.10287$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2206.10287$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bäumler, Johannes</creatorcontrib><creatorcontrib>Bullinger, Martin</creatorcontrib><creatorcontrib>Kober, Stefan</creatorcontrib><creatorcontrib>Zhu, Donghao</creatorcontrib><title>Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets</title><description>We study a dynamic matching procedure where homogeneous agents arrive at random according to a Poisson process and form edges at random yielding a sparse market. Agents leave according to a certain departure distribution and may leave early by forming a pair with a compatible agent. The primary objective is to maximize the number of matched agents. Our main result is to show that a mild condition on the departure distribution suffices to get almost optimal performance of instantaneous matching, despite operating in a thin market. We are thus the first to provide a natural condition under which instantaneous decisions are superior in a market that is both sparse and thin. This result is surprising because similar results in the previous literature are based on market thickness. In addition, instantaneous matching performs well with respect to further objectives such as minimizing waiting times and avoiding the risk of market congestion. We develop new techniques for proving our results going beyond commonly adopted methods for Markov processes.</description><subject>Computer Science - Data Structures and Algorithms</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj7tOwzAYhb0woMIDMOEXSPCltv-MqIVSqYiB7JHt-G8tqFPZKSJvTyhIR-eyHOkj5I6zeglKsQebv-NXLQTTNWcCzDXZvJ9PIcchx3GiA9JtKqNNs8JwLnQdfCxxSIXGRNvDbOsp2WP09NWOft77ueSPMJYbcoX2s4Tb_1yQ9vmpXb1Uu7fNdvW4q6w2pvICnFCIEtHoxmhtALUMoHjPPfQIyqFrjOIgtDISGKjGOoQ-MKc4LuWC3P_dXki6U45Hm6ful6i7EMkfgoNGZA</recordid><startdate>20220621</startdate><enddate>20220621</enddate><creator>Bäumler, Johannes</creator><creator>Bullinger, Martin</creator><creator>Kober, Stefan</creator><creator>Zhu, Donghao</creator><scope>ADEOX</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220621</creationdate><title>Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets</title><author>Bäumler, Johannes ; Bullinger, Martin ; Kober, Stefan ; Zhu, Donghao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-c28b25ff3ff76976678f63e851d1c8df85bfb975182657380859abf8de0b51f43</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><toplevel>online_resources</toplevel><creatorcontrib>Bäumler, Johannes</creatorcontrib><creatorcontrib>Bullinger, Martin</creatorcontrib><creatorcontrib>Kober, Stefan</creatorcontrib><creatorcontrib>Zhu, Donghao</creatorcontrib><collection>arXiv Economics</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bäumler, Johannes</au><au>Bullinger, Martin</au><au>Kober, Stefan</au><au>Zhu, Donghao</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets</atitle><date>2022-06-21</date><risdate>2022</risdate><abstract>We study a dynamic matching procedure where homogeneous agents arrive at random according to a Poisson process and form edges at random yielding a sparse market. Agents leave according to a certain departure distribution and may leave early by forming a pair with a compatible agent. The primary objective is to maximize the number of matched agents. Our main result is to show that a mild condition on the departure distribution suffices to get almost optimal performance of instantaneous matching, despite operating in a thin market. We are thus the first to provide a natural condition under which instantaneous decisions are superior in a market that is both sparse and thin. This result is surprising because similar results in the previous literature are based on market thickness. In addition, instantaneous matching performs well with respect to further objectives such as minimizing waiting times and avoiding the risk of market congestion. We develop new techniques for proving our results going beyond commonly adopted methods for Markov processes.</abstract><doi>10.48550/arxiv.2206.10287</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2206.10287
ispartof
issn
language eng
recordid cdi_arxiv_primary_2206_10287
source arXiv.org
subjects Computer Science - Data Structures and Algorithms
title Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T12%3A49%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Superiority%20of%20Instantaneous%20Decisions%20in%20Thin%20Dynamic%20Matching%20Markets&rft.au=B%C3%A4umler,%20Johannes&rft.date=2022-06-21&rft_id=info:doi/10.48550/arxiv.2206.10287&rft_dat=%3Carxiv_GOX%3E2206_10287%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true