Matching Impatient and Heterogeneous Demand and Supply

Aveklouris, Angelos; DeValve, Levi; Ward, Amy R.

doi:10.48550/arxiv.2102.02710

Cited by 5 publications

(7 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Özkan and Ward (2020) study a dynamic stochastic matching problem with heterogeneous supply and demand types, where demand nodes should be matched immediately, but supply nodes can wait for matching until they depart. More recently, Aveklouris et al (2021) study the same bipartite model where both sides can arrive and renege. One takeaway of this line of work is that in the high-traffic regime, reviewing-based batched matching policies can obtain asymptotic near-optimal performance.…”

Section: Ec1 Further Related Workmentioning

confidence: 99%

Two-stage Matching and Pricing with Applications to Ride Hailing

2020

View full text Add to dashboard Cite

Section: Ec1 Further Related Workmentioning

confidence: 99%

Two-stage Matching and Pricing with Applications to Ride Hailing

2020

View full text Add to dashboard Cite

“…Let us observe that a current line of literature tackles this problem by constructing optimization schemes and optimal control for matching models (see e.g. [11], [3]) leading, in some cases, to the construction of structured optimal policies. However, in such cases one faces the usual 'simplicity vs complexity' dilemma.…”

Section: Discussionmentioning

confidence: 99%

New frontiers for stochastic matching

Mairesse

Moyal

2022

Queueing Syst

View full text Add to dashboard Cite

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

show abstract

“…Finally, Aveklouris et al (2021) consider a bipartite model with heterogeneous agents where the objective function is a tradeoff of matching value and waiting costs. Since the model is quite complex model, a Markovian analysis is not feasible.…”

Section: Related Literaturementioning

confidence: 99%

High Satisfaction in Thin Dynamic Matching Markets

Johannes¹,

Bullinger²,

Kober³

et al. 2022

Preprint

View full text Add to dashboard Cite

Dynamic matching markets are an ubiquitous object of study with applications in health, labor, or dating. There exists a rich literature on the formal modeling of such markets. Typically, these models consist of an arrival procedure, governing when and which agents enter the market, and a sojourn period of agents during which they may leave the market matched with another present agent, or after which they leave the market unmatched. One important focus lies on the design of mechanisms for the matching process aiming at maximizing the quality of the produced matchings or at minimizing waiting costs.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 objective is to maximize the number of matched agents. Our main result is to show that a mild guarantee on the maximum sojourn time of agents suffices to get almost optimal performance of instantaneous matching, despite operating in a thin market. This has the additional advantages of avoiding the risk of market congestion and guaranteeing short waiting times. We develop new techniques for proving our results going beyond commonly adopted methods for Markov processes.

show abstract

Matching Impatient and Heterogeneous Demand and Supply

Cited by 5 publications

References 0 publications

Two-stage Matching and Pricing with Applications to Ride Hailing

Two-stage Matching and Pricing with Applications to Ride Hailing

New frontiers for stochastic matching

High Satisfaction in Thin Dynamic Matching Markets

Contact Info

Product

Resources

About