Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings (Q5095181)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings |
scientific article; zbMATH DE number 7568784
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings |
scientific article; zbMATH DE number 7568784 |
Statements
Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings (English)
0 references
5 August 2022
0 references
stable matchings
0 references
distributive lattice
0 references
rotations
0 references
school choice problem
0 references
legal assignments
0 references
EADAM algorithm
0 references
Latin marriages
0 references
0 references
0.8176111
0 references
0.8175843
0 references
0 references
0.8126261
0 references
0.81140375
0 references
0.81107366
0 references
0.81106484
0 references
0.8062495
0 references
0.80622387
0 references
0.80622387
0 references
