1 citations · 4 across the 10 of their papers we have counts for
5 papers · 1 filter
Settling the complexity of Nash equilibrium in congestion games
Yakov Babichenko, Aviad Rubinstein
We consider (i) the problem of finding a (possibly mixed) Nash equilibrium in congestion games, and (ii) the problem of finding an (exponential precision) fixed point of the gradie…
Bayesian Persuasion under Ex Ante and Ex Post Constraints
Yakov Babichenko, Inbal Talgam-Cohen, Konstantin Zabarnyi
Bayesian persuasion is the study of information sharing policies among strategic agents. A prime example is signaling in online ad auctions: what information should a platform sign…
Communication complexity of Nash equilibrium in potential games
Yakov Babichenko, Aviad Rubinstein
We prove communication complexity lower bounds for (possibly mixed) Nash equilibrium in potential games. In particular, we show that finding a Nash equilibrium requires c…
Incentive-Compatible Selection Mechanisms for Forests
Yakov Babichenko, Oren Dean, Moshe Tennenholtz
Given a directed forest-graph, a probabilistic \emph{selection mechanism} is a probability distribution over the vertex set. A selection mechanism is \emph{incentive-compatible} (I…
Feasible Joint Posterior Beliefs
Itai Arieli, Yakov Babichenko, Fedor Sandomirskiy +1
We study the set of possible joint posterior belief distributions of a group of agents who share a common prior regarding a binary state, and who observe some information structure…