The envy-free matching problem with pairwise preferences (Q2234784)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7411495
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The envy-free matching problem with pairwise preferences |
scientific article; zbMATH DE number 7411495 |
Statements
The envy-free matching problem with pairwise preferences (English)
0 references
19 October 2021
0 references
matching
0 references
envy-freeness
0 references
pairwise preference
0 references
algorithms
0 references
0.817398726940155
0 references
0.8073738217353821
0 references
0.8045552968978882
0 references
0.7971913814544678
0 references
0.7948158979415894
0 references
