24 citations · 73 across the 36 of their papers we have counts for
3 papers · 1 filter
Random Extensive Form Games and its Application to Bargaining
Itai Arieli, Yakov Babichenko
We consider two-player random extensive form games where the payoffs at the leaves are independently drawn uniformly at random from a given feasible set C. We study the asymptotic…
Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash
Yakov Babichenko, Christos Papadimitriou, Aviad Rubinstein
We conjecture that PPAD has a PCP-like complete problem, seeking a near equilibrium in which all but very few players have very little incentive to deviate. We show that, if one as…
Pareto Efficient Nash Implementation Via Approval Voting
Yakov Babichenko, Leonard J. Schulman
We study implementation of a social choice correspondence in the case of two players who have von Neumann - Morgenstern utilities over a finite set of social alternatives, and the…