1 citations · 3 across the 8 of their papers we have counts for
5 papers · 1 filter
Paradoxes in Sequential Voting
Oren Dean, Yakov Babichenko, Moshe Tennenholtz
We analyse strategic, complete information, sequential voting with ordinal preferences over the alternatives. We consider several voting mechanisms: plurality voting and approval v…
Sequential Voting with Confirmation Network
Yakov Babichenko, Oren Dean, Moshe Tennenholtz
We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such…
Incentive-Compatible Diffusion
Yakov Babichenko, Oren Dean, Moshe Tennenholtz
Our work bridges the literature on incentive-compatible mechanism design and the literature on diffusion algorithms. We introduce the study of finding an incentive-compatible (stra…
The Communication Complexity of Local Search
Yakov Babichenko, Shahar Dobzinski, Noam Nisan
We study the following communication variant of local search. There is some fixed, commonly known graph . Alice holds and Bob holds , both are functions that specify…
Learning of Optimal Forecast Aggregation in Partial Evidence Environments
Yakov Babichenko, Dan Garber
We consider the forecast aggregation problem in repeated settings, where the forecasts are done on a binary event. At each period multiple experts provide forecasts about an event.…