Algorithmics of matching under preferences:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Hackensack, New Jersey
World Scientific
[2013]
|
| Schriftenreihe: | Series on theoretical computer science
v. 2 |
| Schlagworte: | |
| Beschreibung: | Print version record |
| Beschreibung: | 1 online resource (xxxi, 415 pages) |
| ISBN: | 9789814425254 9814425257 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV045350014 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 181210s2013 |||| o||u| ||||||eng d | ||
| 020 | |a 9789814425254 |9 978-981-4425-25-4 | ||
| 020 | |a 9814425257 |9 981-4425-25-7 | ||
| 035 | |a (ZDB-4-ITC)ocn840497867 | ||
| 035 | |a (OCoLC)840497867 | ||
| 035 | |a (DE-599)BVBBV045350014 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 511.66 |2 23 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Manlove, David F. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithmics of matching under preferences |c by David Manlove, University of Glasgow, UK ; with a foreword by Kurt Mehlhorn |
| 264 | 1 | |a Hackensack, New Jersey |b World Scientific |c [2013] | |
| 264 | 4 | |c 2013 | |
| 300 | |a 1 online resource (xxxi, 415 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Series on theoretical computer science |v v. 2 | |
| 500 | |a Print version record | ||
| 505 | 8 | |a Matching problems with preferences are all around us - they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists. In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. This book describes the most important results in this area, providing a timely update to The Stable Marriage Problem: Structure and Algorithms (D Gusfield and R W Irving, MIT Press, 1989) in connection with stable matching problems, whilst also broadening the scope to include matching problems with preferences under a range of alternative optimality criteria | |
| 650 | 7 | |a MATHEMATICS / Combinatorics |2 bisacsh | |
| 650 | 7 | |a Matching theory |2 fast | |
| 650 | 4 | |a Matching theory | |
| 650 | 0 | 7 | |a Präferenz |0 (DE-588)4121501-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Matching-Problem |0 (DE-588)4198185-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Matching-Problem |0 (DE-588)4198185-6 |D s |
| 689 | 0 | 1 | |a Präferenz |0 (DE-588)4121501-1 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Mehlhorn, Kurt |d 1949- |4 aui | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Manlove, David |t Algorithmics of matching under preferences |d Singapore ; Hackensack, NJ : World Scientific Pub. Co., 2013 |z 9789814425247 |
| 912 | |a ZDB-4-ITC | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030736668 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804179174344097792 |
|---|---|
| any_adam_object | |
| author | Manlove, David F. |
| author2 | Mehlhorn, Kurt 1949- |
| author2_role | aui |
| author2_variant | k m km |
| author_facet | Manlove, David F. Mehlhorn, Kurt 1949- |
| author_role | aut |
| author_sort | Manlove, David F. |
| author_variant | d f m df dfm |
| building | Verbundindex |
| bvnumber | BV045350014 |
| classification_rvk | ST 130 |
| collection | ZDB-4-ITC |
| contents | Matching problems with preferences are all around us - they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists. In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. This book describes the most important results in this area, providing a timely update to The Stable Marriage Problem: Structure and Algorithms (D Gusfield and R W Irving, MIT Press, 1989) in connection with stable matching problems, whilst also broadening the scope to include matching problems with preferences under a range of alternative optimality criteria |
| ctrlnum | (ZDB-4-ITC)ocn840497867 (OCoLC)840497867 (DE-599)BVBBV045350014 |
| dewey-full | 511.66 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.66 |
| dewey-search | 511.66 |
| dewey-sort | 3511.66 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02807nmm a2200505zcb4500</leader><controlfield tag="001">BV045350014</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">181210s2013 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814425254</subfield><subfield code="9">978-981-4425-25-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9814425257</subfield><subfield code="9">981-4425-25-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-4-ITC)ocn840497867</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)840497867</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045350014</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.66</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Manlove, David F.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmics of matching under preferences</subfield><subfield code="c">by David Manlove, University of Glasgow, UK ; with a foreword by Kurt Mehlhorn</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Hackensack, New Jersey</subfield><subfield code="b">World Scientific</subfield><subfield code="c">[2013]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xxxi, 415 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Series on theoretical computer science</subfield><subfield code="v">v. 2</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Print version record</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Matching problems with preferences are all around us - they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists. In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. This book describes the most important results in this area, providing a timely update to The Stable Marriage Problem: Structure and Algorithms (D Gusfield and R W Irving, MIT Press, 1989) in connection with stable matching problems, whilst also broadening the scope to include matching problems with preferences under a range of alternative optimality criteria</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Combinatorics</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Matching theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matching theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Präferenz</subfield><subfield code="0">(DE-588)4121501-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Matching-Problem</subfield><subfield code="0">(DE-588)4198185-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Matching-Problem</subfield><subfield code="0">(DE-588)4198185-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Präferenz</subfield><subfield code="0">(DE-588)4121501-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mehlhorn, Kurt</subfield><subfield code="d">1949-</subfield><subfield code="4">aui</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Manlove, David</subfield><subfield code="t">Algorithmics of matching under preferences</subfield><subfield code="d">Singapore ; Hackensack, NJ : World Scientific Pub. Co., 2013</subfield><subfield code="z">9789814425247</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-ITC</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030736668</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV045350014 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:15:40Z |
| institution | BVB |
| isbn | 9789814425254 9814425257 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030736668 |
| oclc_num | 840497867 |
| open_access_boolean | |
| physical | 1 online resource (xxxi, 415 pages) |
| psigel | ZDB-4-ITC |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | World Scientific |
| record_format | marc |
| series2 | Series on theoretical computer science |
| spelling | Manlove, David F. Verfasser aut Algorithmics of matching under preferences by David Manlove, University of Glasgow, UK ; with a foreword by Kurt Mehlhorn Hackensack, New Jersey World Scientific [2013] 2013 1 online resource (xxxi, 415 pages) txt rdacontent c rdamedia cr rdacarrier Series on theoretical computer science v. 2 Print version record Matching problems with preferences are all around us - they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists. In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. This book describes the most important results in this area, providing a timely update to The Stable Marriage Problem: Structure and Algorithms (D Gusfield and R W Irving, MIT Press, 1989) in connection with stable matching problems, whilst also broadening the scope to include matching problems with preferences under a range of alternative optimality criteria MATHEMATICS / Combinatorics bisacsh Matching theory fast Matching theory Präferenz (DE-588)4121501-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Matching-Problem (DE-588)4198185-6 gnd rswk-swf Matching-Problem (DE-588)4198185-6 s Präferenz (DE-588)4121501-1 s Algorithmus (DE-588)4001183-5 s 1\p DE-604 Mehlhorn, Kurt 1949- aui Erscheint auch als Druck-Ausgabe Manlove, David Algorithmics of matching under preferences Singapore ; Hackensack, NJ : World Scientific Pub. Co., 2013 9789814425247 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Manlove, David F. Algorithmics of matching under preferences Matching problems with preferences are all around us - they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists. In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. This book describes the most important results in this area, providing a timely update to The Stable Marriage Problem: Structure and Algorithms (D Gusfield and R W Irving, MIT Press, 1989) in connection with stable matching problems, whilst also broadening the scope to include matching problems with preferences under a range of alternative optimality criteria MATHEMATICS / Combinatorics bisacsh Matching theory fast Matching theory Präferenz (DE-588)4121501-1 gnd Algorithmus (DE-588)4001183-5 gnd Matching-Problem (DE-588)4198185-6 gnd |
| subject_GND | (DE-588)4121501-1 (DE-588)4001183-5 (DE-588)4198185-6 |
| title | Algorithmics of matching under preferences |
| title_auth | Algorithmics of matching under preferences |
| title_exact_search | Algorithmics of matching under preferences |
| title_full | Algorithmics of matching under preferences by David Manlove, University of Glasgow, UK ; with a foreword by Kurt Mehlhorn |
| title_fullStr | Algorithmics of matching under preferences by David Manlove, University of Glasgow, UK ; with a foreword by Kurt Mehlhorn |
| title_full_unstemmed | Algorithmics of matching under preferences by David Manlove, University of Glasgow, UK ; with a foreword by Kurt Mehlhorn |
| title_short | Algorithmics of matching under preferences |
| title_sort | algorithmics of matching under preferences |
| topic | MATHEMATICS / Combinatorics bisacsh Matching theory fast Matching theory Präferenz (DE-588)4121501-1 gnd Algorithmus (DE-588)4001183-5 gnd Matching-Problem (DE-588)4198185-6 gnd |
| topic_facet | MATHEMATICS / Combinatorics Matching theory Präferenz Algorithmus Matching-Problem |
| work_keys_str_mv | AT manlovedavidf algorithmicsofmatchingunderpreferences AT mehlhornkurt algorithmicsofmatchingunderpreferences |