research
∙
09/24/2020
On One-way Functions and Kolmogorov Complexity
We prove that the equivalence of two fundamental problems in the theory ...
share
research
∙
08/04/2020
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort
We propose a conceptually simple oblivious sort and oblivious random per...
research
∙
07/22/2019
A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator
Brandenburger, Friedenberg, and Keisler provide an epistemic characteriz...
research
∙
06/26/2019
A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland
Consider the following two fundamental open problems in complexity theor...
research
∙
05/09/2018
Communication-Efficient Byzantine Agreement without Erasures
Byzantine agreement (BA) is one of the most fundamental building blocks ...
research
∙
11/29/2017
Paradoxes in Fair Computer-Aided Decision Making
Computer-aided decision making, where some classifier (e.g., an algorith...
research
∙
08/17/2013
Decision Theory with Resource-Bounded Agents
There have been two major lines of research aimed at capturing resource-...
research
∙
06/23/2009