We consider an infinite sequence consisting of agents of several types and goods of several types, with a bipartite compatibility graph between agent and good types. Goods are matched with agents that appear earlier in the sequence using FCFS matching, if such are available, and are lost otherwise. This model may be used for two sided queueing applications such as ride sharing, web purchases, organ transplants, and for abandon at completion redundancy parallel service queues. For this model we calculate matching rates and delays. These can be used to obtain waiting times and help with design questions for related service systems. We explore some relations of this model to other FCFS stochastic matching models.

中文翻译：

---

有向 FCFS 无限二分匹配

我们考虑由多种类型的代理和多种类型的商品组成的无限序列，以及代理和商品类型之间的二部兼容性图。货物与使用 FCFS 匹配出现在序列中较早的代理（如果可用）进行匹配，否则将丢失。该模型可用于双侧排队应用，例如拼车、网络购买、器官移植以及完成时放弃冗余并行服务队列。对于这个模型，我们计算匹配率和延迟。这些可用于获取等待时间并帮助解决相关服务系统的设计问题。我们探讨了该模型与其他 FCFS 随机匹配模型的一些关系。