19 citations · 81 across the 40 of their papers we have counts for
5 papers · 1 filter
Good, Better, Best! - Unbeatable Protocols for Consensus and Set Consensus
Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
While the very first consensus protocols for the synchronous model were designed to match the worst-case lower bound, deciding in exactly t+1 rounds in all runs, it was soon realiz…
Timely Common Knowledge
Yannai A. Gonczarowski, Yoram Moses
Coordinating activities at different sites of a multi-agent system typically imposes epistemic constraints on the participants. Specifying explicit bounds on the relative times at…
Manipulation of Stable Matchings using Minimal Blacklists
Yannai A. Gonczarowski
Gale and Sotomayor (1985) have shown that in the Gale-Shapley matching algorithm (1962), the proposed-to side W (referred to as women there) can strategically force the W-optimal s…
"Secret Santa" and the Combined Length of Spanned Cycles in a Random Permutation
Yannai A. Gonczarowski
In many schools throughout the United States, it is customary to hold a yearly "Secret Santa" event. With the approach of Christmas, all the students place their names in a hat; ea…
Satisfiability and Canonisation of Timely Constraints
Yannai A. Gonczarowski
We abstractly formulate an analytic problem that arises naturally in the study of coordination in multi-agent systems. Let I be a set of arbitrary cardinality (the set of actions)…