Motivated by growing applications in two-sided markets, we study a parallel matching queue with reneging. Demand and supply units arrive to the system and are matched in an FCFS manner according to a compatibility graph specified by an N-system. If they cannot be matched upon arrival, they queue and may abandon the system as time goes by. We derive explicit product forms of the steady state distributions of this system by identifying a partial balance condition.

中文翻译：

---

匹配队列与reneging：产品形式解决方案

受双边市场中不断增长的应用程序的启发，我们研究了一个带有 reneging 的并行匹配队列。需求和供应单元到达系统并根据 N 系统指定的兼容性图以 FCFS 方式进行匹配。如果他们在到达时无法匹配，他们会排队并随着时间的推移可能会放弃系统。我们通过识别部分平衡条件推导出该系统稳态分布的显式乘积形式。