Log In Sign Up

Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates

by   Natalie Collina, et al.

We study a dynamic non-bipartite matching problem. There is a fixed set of agent types, and agents of a given type arrive and depart according to type-specific Poisson processes. Agent departures are not announced in advance. The value of a match is determined by the types of the matched agents. We present an online algorithm that is (1/8)-competitive with respect to the value of the optimal-in-hindsight policy, for arbitrary weighted graphs. Our algorithm treats agents heterogeneously, interpolating between immediate and delayed matching in order to thicken the market while still matching valuable agents opportunistically.


page 1

page 2

page 3

page 4


Dynamic Bipartite Matching Market with Arrivals and Departures

In this paper, we study a matching market model on a bipartite network w...

High Satisfaction in Thin Dynamic Matching Markets

Dynamic matching markets are an ubiquitous object of study with applicat...

Optimal Control of Dynamic Bipartite Matching Models

A dynamic bipartite matching model is given by a bipartite matching grap...

Maximizing Efficiency in Dynamic Matching Markets

We study the problem of matching agents who arrive at a marketplace over...

Maximum Weight Online Matching with Deadlines

We study the problem of matching agents who arrive at a marketplace over...

Decentralized Matching in a Probabilistic Environment

We consider a model for repeated stochastic matching where compatibility...

Single parameter model of marriage divorce dynamics with countries classification

We investigate a marriage divorces problem via agent - based modeling. C...