37 citations · 87 across the 19 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.GT2019
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…
cs.CC2019
Is it Easier to Prove Theorems that are Guaranteed to be True?
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
Consider the following two fundamental open problems in complexity theory: (a) Does a hard-on-average language in NP imply the existence of one-way functions?, or (b) Does a hard-o…