research
∙
05/18/2023
Mode Connectivity in Auction Design
Optimal auction design is a fundamental problem in algorithmic game theo...
share
research
∙
07/12/2021
Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets
We study the equilibrium computation problem in the Fisher market model ...
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
∙
08/02/2020
Chaos of Learning Beyond Zero-sum and Coordination via Game Decompositions
Machine learning processes, e.g. ”learning in games”, can be viewed as n...
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
∙
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/12/2018
Dynamics of Distributed Updating in Fisher Markets
A major goal in Algorithmic Game Theory is to justify equilibrium concep...
research
∙
04/15/2014
