The Complexity of Interactively Learning a Stable Matching by Trial and Error

Ehsan Emamjomeh-Zadeh, Yannai A. Gonczarowski, David Kempe 0001. The Complexity of Interactively Learning a Stable Matching by Trial and Error. In Péter Biró, Jason Hartline, Michael Ostrovsky, Ariel D. Procaccia, editors, EC '20: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, July 13-17, 2020. pages 599, ACM, 2020. [doi]

Authors

Ehsan Emamjomeh-Zadeh

This author has not been identified. Look up 'Ehsan Emamjomeh-Zadeh' in Google

Yannai A. Gonczarowski

This author has not been identified. Look up 'Yannai A. Gonczarowski' in Google

David Kempe 0001

This author has not been identified. Look up 'David Kempe 0001' in Google