✦ LIBER ✦

The singleton core in the college admissions problem and its application to the National Resident Matching Program (NRMP)

✍ Scribed by Jinpeng Ma

Book ID: 116506221
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 256 KB
Volume: 69
Category: Article
ISSN: 0899-8256
DOI: 10.1016/j.geb.2009.12.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Stable matchings and the small core in N

Stable matchings and the small core in Nash equilibrium in the college admissions problem

✍ Jinpeng Ma 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 147 KB

On the inverse problem of linear program

On the inverse problem of linear programming and its application to minimum weight perfect k-matching

✍ Siming Huang; Zhenhong Liu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 107 KB

The relaxation method of finding the com

The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming

✍ L.M. Bregman 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 824 KB

Realization Theory of Ladder Networks in

Realization Theory of Ladder Networks in Terms of the Poles and Zeros of Reflection Coefficient and its Application to a Bandpass Matching Problem

✍ R. Srinivasagopalan; B.A. Shenoi 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 774 KB

Neceaaary and su&%ient condition8 for the realization of 1088k38, tOWpaSS, ladder network8 terminated by a resietance are presented, in term.8 of the poles and zero8 of the resection coeficient. These condition8 yield explicit expre88ion.s for the element VdUe8. They are then extended to highpa netw