research
∙
04/08/2022
Stable Matching: Choosing Which Proposals to Make
Why does stable matching work well in practice despite agents only provi...
share
research
∙
06/15/2021
Selecting a Match: Exploration vs Decision
In a dynamic matching market, such as a marriage or job market, how shou...
research
∙
12/04/2020
Non-quasi-linear Agents in Quasi-linear Mechanisms
Mechanisms with money are commonly designed under the assumption that ag...
research
∙
08/02/2019
Balancing the Robustness and Convergence of Tatonnement
A major goal in Algorithmic Game Theory is to justify equilibrium concep...
research
∙
06/17/2019
On the Existence of Pareto Efficient and Envy Free Allocations
Envy-freeness and Pareto Efficiency are two major goals in welfare econo...
research
∙
03/19/2019
A Truthful Cardinal Mechanism for One-Sided Matching
We consider the design of randomized mechanisms for one-sided matching m...
research
∙
11/13/2018
Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism
Several works have shown linear speedup is achieved by an asynchronous p...
research
∙
11/08/2018
(Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup
When solving massive optimization problems in areas such as machine lear...
research
∙
08/15/2018
An Analysis of Asynchronous Stochastic Accelerated Coordinate Descent
Gradient descent, and coordinate descent in particular, are core tools i...
research
∙
06/27/2018
Amortized Analysis of Asynchronous Price Dynamics
We extend a recently developed framework for analyzing asynchronous coor...
research
∙
06/12/2018