Unpopularity Factor in the Marriage and Roommates Problems
Given a set A of n people, with each person having a preference list that ranks a subset of A as his/her acceptable partners in order of preference, we consider the Roommates Problem ( rp ) and the Marriage Problem ( mp ) of matching people with their partners. In rp there is no further restriction,...
Saved in:
| Published in | Theory of computing systems Vol. 65; no. 3; pp. 579 - 592 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer US
01.04.2021
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1432-4350 1433-0490 |
| DOI | 10.1007/s00224-020-09978-5 |
Cover
| Abstract | Given a set
A
of
n
people, with each person having a
preference list
that ranks a subset of
A
as his/her acceptable partners in order of preference, we consider the
Roommates Problem
(
rp
) and the
Marriage Problem
(
mp
) of matching people with their partners. In
rp
there is no further restriction, while in
mp
only people of opposite genders can be acceptable partners. For a pair of matchings
X
and
Y
, let
ϕ
(
X
,
Y
) denote the number of people who prefer a person they get matched by
X
to a person they get matched by
Y
, and define an
unpopularity factor
u
(
M
) of a matching
M
to be the maximum ratio
ϕ
(
M
′
,
M
)
/
ϕ
(
M
,
M
′
)
among all other possible matchings
M
′
. In this paper, we develop an algorithm to compute the unpopularity factor of a given matching in
O
(
m
n
log
2
n
)
time for
rp
and in
O
(
m
n
log
n
)
time for
mp
, where
m
is the total length of people’s preference lists. We also generalize the notion of unpopularity factor to a weighted setting where people are given different voting weights and show that our algorithm can be slightly modified to support that setting with the same running time. |
|---|---|
| AbstractList | Given a set
A
of
n
people, with each person having a
preference list
that ranks a subset of
A
as his/her acceptable partners in order of preference, we consider the
Roommates Problem
(
rp
) and the
Marriage Problem
(
mp
) of matching people with their partners. In
rp
there is no further restriction, while in
mp
only people of opposite genders can be acceptable partners. For a pair of matchings
X
and
Y
, let
ϕ
(
X
,
Y
) denote the number of people who prefer a person they get matched by
X
to a person they get matched by
Y
, and define an
unpopularity factor
u
(
M
) of a matching
M
to be the maximum ratio
ϕ
(
M
′
,
M
)
/
ϕ
(
M
,
M
′
)
among all other possible matchings
M
′
. In this paper, we develop an algorithm to compute the unpopularity factor of a given matching in
O
(
m
n
log
2
n
)
time for
rp
and in
O
(
m
n
log
n
)
time for
mp
, where
m
is the total length of people’s preference lists. We also generalize the notion of unpopularity factor to a weighted setting where people are given different voting weights and show that our algorithm can be slightly modified to support that setting with the same running time. Given a set A of n people, with each person having a preference list that ranks a subset of A as his/her acceptable partners in order of preference, we consider the Roommates Problem (rp) and the Marriage Problem (mp) of matching people with their partners. In rp there is no further restriction, while in mp only people of opposite genders can be acceptable partners. For a pair of matchings X and Y, let ϕ(X,Y ) denote the number of people who prefer a person they get matched by X to a person they get matched by Y, and define an unpopularity factoru(M) of a matching M to be the maximum ratio ϕ(M′,M)/ϕ(M,M′) among all other possible matchings M′. In this paper, we develop an algorithm to compute the unpopularity factor of a given matching in O(mnlog2n) time for rp and in O(mnlogn) time for mp, where m is the total length of people’s preference lists. We also generalize the notion of unpopularity factor to a weighted setting where people are given different voting weights and show that our algorithm can be slightly modified to support that setting with the same running time. |
| Author | Ruangwises, Suthee Itoh, Toshiya |
| Author_xml | – sequence: 1 givenname: Suthee orcidid: 0000-0002-2820-1301 surname: Ruangwises fullname: Ruangwises, Suthee email: ruangwises.s.aa@m.titech.ac.jp organization: Department of Mathematical and Computing Science, Tokyo Institute of Technology – sequence: 2 givenname: Toshiya surname: Itoh fullname: Itoh, Toshiya organization: Department of Mathematical and Computing Science, Tokyo Institute of Technology |
| BookMark | eNp9kE1Lw0AQhhepYFv9A54CnldnP5JNvEmxVagoYs_LZrOpKclu3N0e-u-NjSB46GmG4X1mhmeGJtZZg9A1gVsCIO4CAKUcAwUMRSFynJ6hKeGMYeAFTI49xZylcIFmIewAgOUAU3S_sb3r963yTTwkS6Wj80ljk_hpkhflfaO2JlG2St6d6zoVTUjevCtb04VLdF6rNpir3zpHm-Xjx-IJr19Xz4uHNdacZBETRWvNS67LwpCqEIykIhsmdamrjJYVLxnjWhSMCG5oLRRTpkpLw4RhlNcVm6ObcW_v3dfehCh3bu_tcFLSlAHNOeHZkKJjSnsXgje17H3TKX-QBOSPIzk6koMjeXQk0wHK_0G6iSo2zkavmvY0ykY0DHfs1vi_r05Q39hYfSM |
| CitedBy_id | crossref_primary_10_1145_3708507 crossref_primary_10_1016_j_geb_2024_01_015 crossref_primary_10_1007_s00453_024_01215_6 |
| Cites_doi | 10.1145/3155301 10.1257/000282805774670167 10.1137/S0097539792231179 10.1080/00029890.1962.11989827 10.1016/j.jda.2008.11.008 10.1002/bs.3830200304 10.7155/jgaa.00513 10.1086/261272 10.1257/000282805774669637 10.1016/0196-6774(85)90033-1 10.1007/978-3-540-78773-0_51 10.1007/11786986_62 10.1137/1.9781611975482.173 10.1007/978-3-540-69903-3_13 10.1007/11785293_9 10.1007/978-3-030-19955-5_29 10.1007/978-3-642-02927-1_48 10.1137/1.9781611975482.174 10.1007/978-3-642-23719-5_15 10.1145/1134707.1134733 10.1017/CCOL052139015X 10.1007/978-3-642-13073-1_10 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media, LLC, part of Springer Nature 2020 Springer Science+Business Media, LLC, part of Springer Nature 2020. |
| Copyright_xml | – notice: Springer Science+Business Media, LLC, part of Springer Nature 2020 – notice: Springer Science+Business Media, LLC, part of Springer Nature 2020. |
| DBID | AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L6V L7M L~C L~D M0C M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS PYYUZ Q9U |
| DOI | 10.1007/s00224-020-09978-5 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials - QC ProQuest Central (New) Business Premium Collection Technology Collection ProQuest One ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Science Database (via ProQuest SciTech Premium Collection) Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ABI/INFORM Collection China ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ABI/INFORM China ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1433-0490 |
| EndPage | 592 |
| ExternalDocumentID | 10_1007_s00224_020_09978_5 |
| GroupedDBID | --Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 123 1N0 2.D 203 29Q 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 7WY 88I 8AO 8FE 8FG 8FL 8TC 8UJ 8V8 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADPHR ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMOZ AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGWIL AGWZB AGYKE AHAVH AHBYD AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AOCGG ARAPS ARCSS ARMRJ AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP D0L DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBA EBLON EBR EBS EBU ECS EDO EIOEI EJD EMK EPL ESBYG EST ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ3 GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV L6V LAS LLZTM M0C M0N M2P M4Y M7S MA- MK~ ML~ NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF- PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS R89 R9I RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TH9 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 XOL YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ~8M AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB PUEGO 7SC 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c416t-1a2fc4b4cb9e1d9731576fc4fbcd62bd4b334c793174e2f7a3aed5be37e324fd3 |
| IEDL.DBID | BENPR |
| ISSN | 1432-4350 |
| IngestDate | Sat Aug 23 12:48:11 EDT 2025 Thu Apr 24 22:58:54 EDT 2025 Wed Oct 01 02:51:53 EDT 2025 Fri Feb 21 02:48:17 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Marriage problem Roommates problem Popular matching Perfect matching Unpopularity factor |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c416t-1a2fc4b4cb9e1d9731576fc4fbcd62bd4b334c793174e2f7a3aed5be37e324fd3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-2820-1301 |
| PQID | 2530284146 |
| PQPubID | 48907 |
| PageCount | 14 |
| ParticipantIDs | proquest_journals_2530284146 crossref_primary_10_1007_s00224_020_09978_5 crossref_citationtrail_10_1007_s00224_020_09978_5 springer_journals_10_1007_s00224_020_09978_5 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2021-04-01 |
| PublicationDateYYYYMMDD | 2021-04-01 |
| PublicationDate_xml | – month: 04 year: 2021 text: 2021-04-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Theory of computing systems |
| PublicationTitleAbbrev | Theory Comput Syst |
| PublicationYear | 2021 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | Irving (CR16) 1985; 6 CR18 CR17 CR15 CR14 CR13 CR12 Roth (CR22) 1984; 92 Manlove, Sng (CR19) 2010; 8 Abdulkadiroğlu, Pathak, Roth (CR1) 2005; 95 Duan, Pettie, Su (CR7) 2018; 14 CR4 CR3 CR6 CR5 CR8 Gärdenfors (CR10) 1975; 20 Goldberg (CR11) 1995; 24 CR25 CR23 CR21 CR20 Gale, Shapley (CR9) 1962; 69 Abdulkadiroğlu, Pathak, Roth, Sönmez (CR2) 2005; 95 Ruangwises, Itoh (CR24) 2019; 23 R Duan (9978_CR7) 2018; 14 9978_CR12 9978_CR13 A Abdulkadiroğlu (9978_CR1) 2005; 95 AV Goldberg (9978_CR11) 1995; 24 9978_CR14 9978_CR15 9978_CR17 9978_CR18 RW Irving (9978_CR16) 1985; 6 AE Roth (9978_CR22) 1984; 92 D Manlove (9978_CR19) 2010; 8 D Gale (9978_CR9) 1962; 69 P Gärdenfors (9978_CR10) 1975; 20 9978_CR3 9978_CR4 9978_CR8 9978_CR5 9978_CR6 9978_CR20 A Abdulkadiroğlu (9978_CR2) 2005; 95 9978_CR21 9978_CR23 9978_CR25 S Ruangwises (9978_CR24) 2019; 23 |
| References_xml | – ident: CR18 – ident: CR4 – volume: 14 start-page: 8:1 issue: 1 year: 2018 end-page: 8:35 ident: CR7 article-title: Scaling Algorithms for Weighted Matching in General Graphs publication-title: ACM Trans. Algorithm. doi: 10.1145/3155301 – ident: CR14 – volume: 95 start-page: 364 issue: 2 year: 2005 end-page: 367 ident: CR1 article-title: The New York City high school match publication-title: Amer. Econ. Rev. doi: 10.1257/000282805774670167 – ident: CR12 – volume: 24 start-page: 494 issue: 3 year: 1995 end-page: 504 ident: CR11 article-title: Scaling algorithms for the shortest paths problem publication-title: SIAM J. Comput. doi: 10.1137/S0097539792231179 – volume: 69 start-page: 9 year: 1962 end-page: 15 ident: CR9 article-title: College admissions and the stability of marriage publication-title: Am. Math. Mon. doi: 10.1080/00029890.1962.11989827 – ident: CR6 – volume: 8 start-page: 102 issue: 2 year: 2010 end-page: 116 ident: CR19 article-title: Popular matchings in the weighted capacitated house allocation problem publication-title: J Discret. Algorithm. doi: 10.1016/j.jda.2008.11.008 – ident: CR8 – ident: CR25 – ident: CR23 – volume: 20 start-page: 166 year: 1975 end-page: 173 ident: CR10 article-title: Match making: assignments based on bilateral preferences publication-title: Behav. Sci. doi: 10.1002/bs.3830200304 – ident: CR21 – volume: 23 start-page: 815 issue: 5 year: 2019 end-page: 835 ident: CR24 article-title: Random Popular Matchings with Incomplete Preference Lists publication-title: J. Graph Algorithm. Appl. doi: 10.7155/jgaa.00513 – ident: CR3 – ident: CR15 – volume: 92 start-page: 991 issue: 6 year: 1984 end-page: 1016 ident: CR22 article-title: The evolution of the labor market for medical interns and residents: a case study in game theory publication-title: J. Polit. Econ. doi: 10.1086/261272 – ident: CR17 – ident: CR13 – volume: 95 start-page: 368 issue: 2 year: 2005 end-page: 371 ident: CR2 article-title: The Boston public school match publication-title: Amer. Econ. Rev. doi: 10.1257/000282805774669637 – volume: 6 start-page: 577 year: 1985 end-page: 595 ident: CR16 article-title: An efficient algorithm for the “stable roommates” problem publication-title: J. Algorithm. doi: 10.1016/0196-6774(85)90033-1 – ident: CR5 – ident: CR20 – volume: 20 start-page: 166 year: 1975 ident: 9978_CR10 publication-title: Behav. Sci. doi: 10.1002/bs.3830200304 – ident: 9978_CR13 – ident: 9978_CR20 doi: 10.1007/978-3-540-78773-0_51 – ident: 9978_CR6 – ident: 9978_CR21 doi: 10.1007/11786986_62 – volume: 6 start-page: 577 year: 1985 ident: 9978_CR16 publication-title: J. Algorithm. doi: 10.1016/0196-6774(85)90033-1 – ident: 9978_CR8 doi: 10.1137/1.9781611975482.173 – ident: 9978_CR15 doi: 10.1007/978-3-540-69903-3_13 – volume: 23 start-page: 815 issue: 5 year: 2019 ident: 9978_CR24 publication-title: J. Graph Algorithm. Appl. doi: 10.7155/jgaa.00513 – volume: 92 start-page: 991 issue: 6 year: 1984 ident: 9978_CR22 publication-title: J. Polit. Econ. doi: 10.1086/261272 – ident: 9978_CR4 doi: 10.1007/11785293_9 – volume: 14 start-page: 8:1 issue: 1 year: 2018 ident: 9978_CR7 publication-title: ACM Trans. Algorithm. doi: 10.1145/3155301 – ident: 9978_CR25 doi: 10.1007/978-3-030-19955-5_29 – ident: 9978_CR3 – volume: 95 start-page: 364 issue: 2 year: 2005 ident: 9978_CR1 publication-title: Amer. Econ. Rev. doi: 10.1257/000282805774670167 – ident: 9978_CR17 doi: 10.1007/978-3-642-02927-1_48 – ident: 9978_CR12 doi: 10.1137/1.9781611975482.174 – ident: 9978_CR14 doi: 10.1007/978-3-642-23719-5_15 – volume: 95 start-page: 368 issue: 2 year: 2005 ident: 9978_CR2 publication-title: Amer. Econ. Rev. doi: 10.1257/000282805774669637 – volume: 24 start-page: 494 issue: 3 year: 1995 ident: 9978_CR11 publication-title: SIAM J. Comput. doi: 10.1137/S0097539792231179 – ident: 9978_CR18 doi: 10.1145/1134707.1134733 – volume: 8 start-page: 102 issue: 2 year: 2010 ident: 9978_CR19 publication-title: J Discret. Algorithm. doi: 10.1016/j.jda.2008.11.008 – volume: 69 start-page: 9 year: 1962 ident: 9978_CR9 publication-title: Am. Math. Mon. doi: 10.1080/00029890.1962.11989827 – ident: 9978_CR23 doi: 10.1017/CCOL052139015X – ident: 9978_CR5 doi: 10.1007/978-3-642-13073-1_10 |
| SSID | ssj0003800 |
| Score | 2.2764788 |
| Snippet | Given a set
A
of
n
people, with each person having a
preference list
that ranks a subset of
A
as his/her acceptable partners in order of preference, we... Given a set A of n people, with each person having a preference list that ranks a subset of A as his/her acceptable partners in order of preference, we... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 579 |
| SubjectTerms | Algorithms Computer Science Matching Special Issue on Computer Science Symposium in Russia Theory of Computation |
| SummonAdditionalLinks | – databaseName: SpringerLink Journals (ICM) dbid: U2A link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED90vuiDH1NxfpEH3zSwpknb-TbEMYSJiIW9hXxVBK1jnf-_l6ztUFTwtcmFcrnL_ULu7gdwoRxPmTAZdTYqKCJwRwfWGMpUn-siE6lzIUH2Phnn_G4qpnVRWNVkuzdPkuGkbovdQrih_rrjqz0zKtZhQ_h2XmjFORu252-chcITBAK-Hkj061KZn9f4Go5WGPPbs2iINqNd2K5hIhku93UP1lzZhZ2GgoHUHtmFrUnbdrXah-u8nAVCLs9IR0aBSoe8lASnkImao609O6JKSx4RLr95lEkeloQy1QHko9unmzGtyRGoQQy1oJFiheGaGz1wkfUEVHhzwC-FNjZh2nIdx9yg9-GVw7EiVbFyVmgXpw4xVGHjQ-iU76U7AqKiLLVJ3xSp7_5mrELQpoRV_kUS5UQPokZH0tSdwz2Bxatsex4HvUrUqwx6lShz2crMln0z_px92qhe1j5USeYJjfAfeNKDq2Y7VsO_r3b8v-knsMl8okpIxzmFzmL-4c4QaSz0eTCsT8WQyIk priority: 102 providerName: Springer Nature |
| Title | Unpopularity Factor in the Marriage and Roommates Problems |
| URI | https://link.springer.com/article/10.1007/s00224-020-09978-5 https://www.proquest.com/docview/2530284146 |
| Volume | 65 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: Academic Search Ultimate customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 1433-0490 dateEnd: 20241102 omitProxy: true ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: ABDBF dateStart: 19970101 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 1433-0490 dateEnd: 20241102 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: ADMLS dateStart: 19970101 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost – providerCode: PRVEBS databaseName: Mathematics Source customDbUrl: eissn: 1433-0490 dateEnd: 20241102 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: AMVHM dateStart: 19970101 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/mathematics-source providerName: EBSCOhost – providerCode: PRVLSH databaseName: SpringerLink Journals customDbUrl: mediaType: online eissn: 1433-0490 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: AFBBN dateStart: 19670301 isFulltext: true providerName: Library Specific Holdings – providerCode: PRVPQU databaseName: ProQuest Technology Collection customDbUrl: eissn: 1433-0490 dateEnd: 20241102 omitProxy: true ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: 8FG dateStart: 20020101 isFulltext: true titleUrlDefault: https://search.proquest.com/technologycollection1 providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK - Czech Republic Consortium customDbUrl: eissn: 1433-0490 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: AGYKE dateStart: 19970101 isFulltext: true titleUrlDefault: http://link.springer.com providerName: Springer Nature – providerCode: PRVAVX databaseName: SpringerLink Journals (ICM) customDbUrl: eissn: 1433-0490 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0003800 issn: 1432-4350 databaseCode: U2A dateStart: 19970101 isFulltext: true titleUrlDefault: http://www.springerlink.com/journals/ providerName: Springer Nature |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3PS8MwFH7M7aIHf4vTOXLwpsE1bdcqiGyyKsrKEAd6KmmSiqDddPP_972s7VDQUyG_Di95yZfmve8DOJbGC4SvQm60k3FE4Iafa6W4kB0vzUI_MMYGyMbd27F39-Q_1SAuc2EorLLcE-1GrSeK_pGfCZK3CT107KvpByfVKHpdLSU0ZCGtoC8txdgKNAQxY9Wh0R_Eo4dqb3ZDm5SCIIFyhfxOkUZjk-nsccbpOkXZpCH3fx5VS_z568nUnkTRJqwXEJL1FnO-BTWTb8NGKc_ACm_dhrVhRck624GLcT61Yl2kVsciK7PDXnOGTdhQfuI6fDFM5po9IJR-JwTKRguxmdkujKPB4_UtL4QTuEJ8NeeOFJnyUk-l58bRJE6FtwosyVKluyLVXuq6nkLPxOuIEVkgXWm0nxo3MIivMu3uQT2f5GYfmHTCQHc7KguIGU5piYBO-lrSayX285vglDZKVMEqTuIWb0nFh2ztmqBdE2vXBPucVH2mC06Nf1u3StMnhX_NkuVqaMJpOR3L6r9HO_h_tENYFRS0YkNzWlCff36ZI0Qd87QNK2F004ZGL-r3Y_rePN8P2sUCw9qx6H0D4L3W8A |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3JTsMwEB0VOAAHdsRSwAc4gUXjOE2KVCGWVoUuQohK3IJjOwgJQqFFiJ_j2xi7TiuQ4MY1Xg7jsec5njcPYFdoHrJARlQrL6WIwDWtKCkpEyWepFEQam0TZDvlRpdf3ga3BfjMuTAmrTI_E-1BrZ6l-Ud-yIy8TcRxYx_3XqhRjTKvq7mEhnDSCqpqS4w5YkdTf7zjFa5fvTjH9d5jrF67OWtQpzJAJYKRAfUESyVPuEwq2lNGyQkhOH5JE6nKLFE88X0u0Y0Ru2uWhsIXWgWJ9kONYCRVPs47AVPc5xW8_E2d1jpX16NY4EeWBIOgxHCTgpKj7Vjyng2f1FzfDHs1osH30DjGuz-eaG3kqy_AnIOs5GToY4tQ0NkSzOdyEMSdDksw2x6VgO0vw1E361lxMKOOR-pW1oc8ZAS7kLZ4Rb-_10RkilwjdH8yiJdcDcVt-ivQ_RcTrsJk9pzpNSDCi0JVLsk0NJXopBIIIEWghHkdxXHBOni5jWLpqpgbMY3HeFR_2do1RrvG1q4xjtkfjekNa3j82buYmz52-7kfj71vHQ7y5Rg3_z7bxt-z7cB046bdilsXneYmzDCTMGPTgoowOXh901uIeAbJtnMrAnf_7clfinEQtA |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LS8NAEB5qBdGDj6r4qLoHPelis0maVBARNT6qImLBW9zsbkTQWNuK-Nf8dc5skxYFvfWa7Oxh9svOt9mZ-QA2pfEC4auQG-2kHBm44Q2tFBey5iVp6AfG2ATZ6_pZy7u49-9L8FXUwlBaZbEn2o1avyr6R74rSN4m9EigJc3TIm6Oo4P2GycFKbppLeQ0-hBpms8PPL5198-Pca23hIhO7o7OeK4wwBUSkR53pEiVl3gqaRhHk4oT0m98kiZK10WivcR1PYUQRt5uRBpIVxrtJ8YNDBKRVLs47xiMB9TFnarUo9NBFHBDW_6CdISqkvxaXrBjy_Zs4OR0cKO61ZD7P4PikOn-upy1MS-ahemcrLLDPrrmoGSyCswUQhAs3xcqMHU1aP7anYe9Vta2smCki8ciK-jDnjKGQ9iV7CDiHw2TmWa3SNpfiOuym76sTXcBWiNx4CKUs9fMLAGTThjoek2lAfWgU1oidZS-lnQvinb-MjiFj2KV9y8nGY3neNB52fo1Rr_G1q8x2mwPbNr97h3_jq4Wro_zL7kbD3G3DDvFcgxf_z3byv-zbcAE4je-PL9ursKkoEwZmw9UhXKv827WkOr0knWLKQYPowbxNwjdDk4 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Unpopularity+Factor+in+the+Marriage+and+Roommates+Problems&rft.jtitle=Theory+of+computing+systems&rft.au=Ruangwises%2C+Suthee&rft.au=Itoh%2C+Toshiya&rft.date=2021-04-01&rft.issn=1432-4350&rft.eissn=1433-0490&rft.volume=65&rft.issue=3&rft.spage=579&rft.epage=592&rft_id=info:doi/10.1007%2Fs00224-020-09978-5&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00224_020_09978_5 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-4350&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-4350&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-4350&client=summon |