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]

Abstract

Abstract is missing.