
-
Statistical and computational thresholds for the planted k-densest sub-hypergraph problem
Recovery a planted signal perturbed by noise is a fundamental problem in...
read it
-
A Robust Framework for Analyzing Gradient-Based Dynamics in Bilinear Games
In this work, we establish a frequency-domain framework for analyzing gr...
read it
-
Solving Zero-Sum Games through Alternating Projections
In this work, we establish near-linear and strong convergence for a natu...
read it
-
Two-way Greedy: Algorithms for Imperfect Rationality
The realization that selfish interests need to be accounted for in the d...
read it
-
Exact Recovery for a Family of Community-Detection Generative Models
Generative models for networks with communities have been studied extens...
read it
-
Online scheduling of jobs with favorite machines
This work introduces a natural variant of the online machine scheduling ...
read it
-
On the approximation guarantee of obviously strategyproof mechanisms
The concept of obviously strategyproof (OSP) mechanisms has the merit to...
read it
-
Optimal Sorting with Persistent Comparison Errors
We consider the problem of sorting n elements in the case of persistent ...
read it
-
No truthful mechanism can be better than n approximate for two natural problems
This work gives the first natural non-utilitarian problems for which the...
read it
-
Selfish Jobs with Favorite Machines: Price of Anarchy vs Strong Price of Anarchy
We consider the well-studied game-theoretic version of machine schedulin...
read it