The Study of Lattice Structure of Bipartite Stable Matchings With Flexible Agents
In this paper, we obtain a set of pairwise stable outcomes in two-sided hybrid matching market with price externalities. In this market, the valuation of agents depends upon money. The most important feature of our work is to devise an algorithm that characterizes the stable matchings as fixed point...
Main Authors: | B. Shaukat, Q. Kiran, W. Shatanawi, Y. Ali |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8755978/ |
Similar Items
-
哈林图的偶匹配可扩性(Bipartite matching-extendability of Halin graphs)
by: HUIZhi-hao(惠志昊), et al.
Published: (2009-09-01) -
Data Acquisition Based on Stable Matching of Bipartite Graph in Cooperative Vehicle–Infrastructure Systems
by: Xiaolan Tang, et al.
Published: (2017-06-01) -
UAV Network Channel Allocation Method Based on Bipartite Graph Popular Matching Algorithm
by: Weihan Li, et al.
Published: (2024-01-01) -
Maximum Semi-Matching Problem in Bipartite Graphs
by: Katrenič Ján, et al.
Published: (2013-07-01) -
Generalized Matching Preclusion in Bipartite Graphs
by: Zachary Wheeler, et al.
Published: (2018-01-01)