37 citations · 87 across the 19 of their papers we have counts for
15 papers · 1 filter
A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator
Joseph Y. Halpern, Rafael Pass
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (IA), also known as iterated deletion of weakly dominated strategies, where…
Socially Optimal Mining Pools
Ben A. Fisch, Rafael Pass, Abhi Shelat
Mining for Bitcoins is a high-risk high-reward activity. Miners, seeking to reduce their variance and earn steadier rewards, collaborate in pooling strategies where they jointly mi…
Bayesian Games with Intentions
Adam Bjorndahl, Joseph Y. Halpern, Rafael Pass
We show that standard Bayesian games cannot represent the full spectrum of belief-dependent preferences. However, by introducing a fundamental distinction between intended and actu…
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…
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},…
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…