Computational complexity of the Hylland-Zeckhauser scheme for one-sided matching markets (Q7229348)
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 8186847
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of the Hylland-Zeckhauser scheme for one-sided matching markets |
scientific article; zbMATH DE number 8186847 |
Statements
Computational complexity of the Hylland-Zeckhauser scheme for one-sided matching markets (English)
0 references
15 April 2026
0 references
Hyland-Zeckhauser scheme
0 references
one-sided matching markets
0 references
mechanism design
0 references
dichotomous utilities
0 references
PPAD
0 references
FIXP
0 references
0 references
0 references
0 references
0 references
0 references
