A Polynomial-Time Algorithm for a Stable Matching Problem with Linear Valuations and Bounded Side Payments
Farooq, Rashid
Japan J. Indust. Appl. Math., Tome 25 (2008) no. 1, p. 83-98 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We study an extension of the Gale--Shapley marriage model and the Shapley--Shubik assignment model by considering linear valuations and bounded side payments. Our model includes the Eriksson--Karlander hybrid model as a special case. We propose a polynomial-time algorithm which finds a pairwise-stable outcome.
Publié le : 2008-02-15
Classification:  stable marriage model,  assignment game 
@article{1208196866,
     author = {Farooq, Rashid},
     title = {A Polynomial-Time Algorithm for a Stable Matching Problem with Linear Valuations and Bounded Side Payments},
     journal = {Japan J. Indust. Appl. Math.},
     volume = {25},
     number = {1},
     year = {2008},
     pages = { 83-98},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1208196866}
}

Farooq, Rashid. A Polynomial-Time Algorithm for a Stable Matching Problem with Linear Valuations and Bounded Side Payments. Japan J. Indust. Appl. Math., Tome 25 (2008) no. 1, pp.  83-98. http://gdmltest.u-ga.fr/item/1208196866/