9 citations · 16 across the 8 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2020
The Complexity of Interactively Learning a Stable Matching by Trial and Error
Ehsan Emamjomeh-Zadeh, Yannai A. Gonczarowski, David Kempe
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…
cs.GT2015★ 9 cited
Mixture Selection, Mechanism Design, and Signaling
Yu Cheng, Ho Yee Cheung, Shaddin Dughmi +3
We pose and study a fundamental algorithmic problem which we term mixture selection, arising as a building block in a number of game-theoretic applications: Given a function fr…