Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets.
Vijay V. VaziraniMihalis YannakakisPublished in: ITCS (2021)
Keyphrases
- computational complexity
- matching scheme
- matching criterion
- np complete
- np hard
- feature points
- electronic commerce
- matching process
- shape matching
- multi agent systems
- special case
- search range
- high computational complexity
- image retrieval
- image matching
- keypoints
- pattern matching
- computationally efficient
- worst case
- motion estimation
- computational cost