
RegretMinimizing Bayesian Persuasion
We study a Bayesian persuasion setting with binary actions (adopt and re...
read it

Sequential Naive Learning
We analyze boundedly rational updating from aggregate statistics in a mo...
read it

Settling the complexity of Nash equilibrium in congestion games
We consider (i) the problem of finding a (possibly mixed) Nash equilibri...
read it

Bayesian Persuasion under Ex Ante and Ex Post Constraints
Bayesian persuasion, as introduced by Kamenica and Gentzkow in 2011, is ...
read it

Communication complexity of Nash equilibrium in potential games
We prove communication complexity lower bounds for (possibly mixed) Nash...
read it

IncentiveCompatible Selection Mechanisms for Forests
Given a directed forestgraph, a probabilistic selection mechanism is a ...
read it

Feasible Joint Posterior Beliefs
We study the set of possible joint posterior belief distributions of a g...
read it

IncentiveCompatible Classification
We investigate the possibility of an incentivecompatible (IC, a.k.a. st...
read it

Golden games
We consider extensive form winlose games over a complete binarytree of...
read it

Paradoxes in Sequential Voting
We analyse strategic, complete information, sequential voting with ordin...
read it

Sequential Voting with Confirmation Network
We discuss voting scenarios in which the set of voters (agents) and the ...
read it

IncentiveCompatible Diffusion
Our work bridges the literature on incentivecompatible mechanism design...
read it

The Communication Complexity of Local Search
We study the following communication variant of local search. There is s...
read it

Learning of Optimal Forecast Aggregation in Partial Evidence Environments
We consider the forecast aggregation problem in repeated settings, where...
read it
Yakov Babichenko
is this you? claim profile