37 citations · 87 across the 19 of their papers we have counts for
Showing 2015 · cs.GTShow all
3 papers · 2 filters
cs.GT2015★ 2 cited
On the Non-Existence of Nash Equilibrium in Games with Resource-Bounded Players
Joseph Y. Halpern, Rafael Pass, Daniel Reichman
We consider sequences of games where, for all , has the same set of players. Such sequences arise in the analysis of running time of playe…
cs.GT2015★ 2 cited
Computational Extensive-Form Games
Joseph Y. Halpern, Rafael Pass, Lior Seeman
We define solution concepts appropriate for computationally bounded players playing a fixed finite game. To do so, we need to define what it means for a \emph{computational game},…
cs.GT2015
Stronger Impossibility Results for Strategy-Proof Voting with i.i.d. Beliefs
Samantha Leung, Edward Lui, Rafael Pass
The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must be dictatorial. In \cite{McL11}, McLennan showed t…