Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets.
Vijay V. VaziraniMihalis YannakakisPublished in: CoRR (2020)
Keyphrases
- computational complexity
- matching scheme
- pattern matching
- matching criterion
- matching algorithm
- image matching
- special case
- computational cost
- high computational complexity
- electronic commerce
- computer vision
- recognition scheme
- graph matching
- low complexity
- np complete
- computational efficiency
- rate distortion
- memory requirements
- keypoints
- matching process
- classification scheme
- bit rate
- detection scheme
- np hard
- search range
- learning algorithm
- market equilibrium