The Complexity of Interactively Learning a Stable Matching by Trial and Error
EC '20: The 21st ACM Conference on Economics and Computation Virtual Event Hungary July, 2020, pp. 5992020.
In a stable matching setting, we consider a query model that allows for an interactive learning algorithm to make precisely one type of query: proposing a matching, the response to which is either that the proposed matching is stable, or a blocking pair (chosen adversarially) indicating that this matching is unstable. For one-to-one match...More
PPT (Upload PPT)