Search Results for author:
Found 11 papers, 3 papers with code
Robust Allocations with Diversity Constraints
We show in a formal sense that the Nash Welfare rule that maximizes product of agent values is uniquely positioned to be robust when diversity constraints are introduced, while almost all other natural allocation rules fail this criterion.
GNSS Radio Occultation on Aerial Platforms with Commercial Off-The-Shelf Receivers
In recent decades, GNSS Radio Occultation soundings have proven an invaluable input to global weather forecasting.
Satellite Navigation for the Age of Autonomy
Global Navigation Satellite Systems (GNSS) brought navigation to the masses.
The impossibility of low rank representations for triangle-rich complex networks
The study of complex networks is a significant development in modern science, and has enriched the social sciences, biology, physics, and computer science.
Who is in Your Top Three? Optimizing Learning in Elections with Many Candidates
Each K-Approval or K-partial ranking mechanism (with a corresponding positional scoring rule) induces a learning rate for the speed at which the election correctly recovers the asymptotic outcome.
Random Dictators with a Random Referee: Constant Sample Complexity Mechanisms for Social Choice
Constant sample complexity means that the mechanism (potentially randomized) only uses a constant number of ordinal queries regardless of the number of voters and alternatives.
Sequential Deliberation for Social Choice
In large scale collective decision making, social choice is a normative study of how one ought to design a protocol for reaching consensus.
Computer Science and Game Theory Multiagent Systems
Personalized PageRank Estimation and Search: A Bidirectional Approach
First, for the problem of estimating Personalized PageRank (PPR) from a source distribution to a target node, we present a new bidirectional estimator with simple yet strong guarantees on correctness and performance, and 3x to 8x speedup over existing estimators in experiments on a diverse set of networks.
Dimension Independent Similarity Computation
All of our results are provably independent of dimension, meaning apart from the initial cost of trivially reading in the data, all subsequent operations are independent of the dimension, thus the dimension can be very large.
Fast Incremental and Personalized PageRank
We show that if we store $R>q\ln n$ random walks starting from every node for large enough constant $q$ (using the approach outlined for global PageRank), then the expected number of calls made to the distributed social network database is $O(k/(R^{(1-\alpha)/\alpha}))$.
Perfect Matchings in O(n \log n) Time in Regular Bipartite Graphs
Our techniques also give an algorithm that successively finds a matching in the support of a doubly stochastic matrix in expected time O(n\log^2 n) time, with O(m) pre-processing time; this gives a simple O(m+mn\log^2 n) time algorithm for finding the Birkhoff-von Neumann decomposition of a doubly stochastic matrix.
Data Structures and Algorithms Discrete Mathematics
