no code implementations • 7 Nov 2023 • Yannai A. Gonczarowski, Yoram Moses
Formally, for common knowledge to arise in a dynamic setting, knowledge that it has arisen must be simultaneously attained by all players.
no code implementations • NeurIPS 2023 • Yannai A. Gonczarowski, Gregory Kehne, Ariel D. Procaccia, Ben Schiffer, Shirley Zhang
In computational social choice, the distortion of a voting rule quantifies the degree to which the rule overcomes limited preference information to select a socially desirable outcome.
no code implementations • 11 Feb 2023 • Ran Canetti, Amos Fiat, Yannai A. Gonczarowski
Commitment is achieved by public declaration, which enables players to verify incentive properties in advance and the outcome in retrospect.
no code implementations • 27 Sep 2022 • Yannai A. Gonczarowski, Ori Heffetz, Clayton Thomas
A menu description presents a mechanism to player $i$ in two steps.
no code implementations • 18 Feb 2020 • 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 which is either that the proposed matching is stable, or a blocking pair (chosen adversarially) indicating that this matching is unstable.
no code implementations • 7 Aug 2018 • Yannai A. Gonczarowski, S. Matthew Weinberg
We consider the sample complexity of revenue maximization for multiple bidders in unrestricted multi-dimensional settings.
no code implementations • NeurIPS 2017 • Noga Alon, Moshe Babaioff, Yannai A. Gonczarowski, Yishay Mansour, Shay Moran, Amir Yehudayoff
In this work we derive a variant of the classic Glivenko-Cantelli Theorem, which asserts uniform convergence of the empirical Cumulative Distribution Function (CDF) to the CDF of the underlying distribution.