scispace - formally typeset
A

Abraham D. Flaxman

Researcher at Institute for Health Metrics and Evaluation

Publications -  215
Citations -  106137

Abraham D. Flaxman is an academic researcher from Institute for Health Metrics and Evaluation. The author has contributed to research in topics: Population & Verbal autopsy. The author has an hindex of 66, co-authored 195 publications receiving 88582 citations. Previous affiliations of Abraham D. Flaxman include Microsoft & University of Queensland.

Papers
More filters
Book ChapterDOI

First-passage percolation on a width-2 strip and the path cost in a VCG auction

TL;DR: These statistics attempt to describe two seemingly unrelated phenomena, arising in physics and economics respectively: the first-passage percolation time predicts how long it takes for a fluid to spread through a random medium, while the VCG payment for the shortest path is the cost of maximizing social welfare among selfish agents.
Journal Article

First-passage percolation on a width-2 strip and the path cost in a VCG auction

TL;DR: In this paper, the Vickery-Clarke-Groves (VCG) payment for the shortest path on a width-2 strip with random edge costs is analyzed, and the first-passage percolation time predicts how long it takes for a fluid to spread through a random medium, while the VCG payment is the cost of maximizing social welfare among selfish agents.
Journal ArticleDOI

Differential privacy in the 2020 US census: what will it do? Quantifying the accuracy/privacy tradeoff.

TL;DR: An empirical measure of privacy loss is developed to compare the error and privacy of the new approach to that of a (non-differentially private) simple-random-sampling approach to protecting privacy and it is found that the empirical privacy loss of TopDown is substantially smaller than the theoretical guarantee for all privacy loss budgets.
Proceedings ArticleDOI

On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem

TL;DR: This paper analyzes the performance of 3 related approximation algorithms for the uncapacitated facility location problem and finds that, with high probability, these 3 algorithms do not find asymptotically optimal solutions, and a simple plane partitioning heuristic does find an asymptonically optimal solution.