research
∙
06/18/2023
A Smoothed FPTAS for Equilibria in Congestion Games
We present a fully polynomial-time approximation scheme (FPTAS) for comp...
share
research
∙
11/14/2022
On the Smoothed Complexity of Combinatorial Local Search
We propose a unifying framework for smoothed analysis of combinatorial l...
research
∙
03/04/2021
On the Complexity of Equilibrium Computation in First-Price Auctions
We consider the problem of computing a (pure) Bayes-Nash equilibrium in ...
research
∙
05/20/2020
A Unifying Approximate Potential for Weighted Congestion Games
We provide a unifying, black-box tool for establishing existence of appr...
research
∙
05/20/2020
A New Lower Bound for Deterministic Truthful Scheduling
We study the problem of truthfully scheduling m tasks to n selfish unrel...
research
∙
02/18/2020
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games
We study the existence of approximate pure Nash equilibria (α-PNE) in we...
research
∙
07/09/2019
Robust Revenue Maximization Under Minimal Statistical Information
We study the problem of multi-dimensional revenue maximization when sell...
research
∙
10/30/2018
An Improved Algorithm for Computing Approximate Equilibria in Weighted Congestion Games
We present a polynomial-time algorithm for computing d^d+o(d)-approximat...
research
∙
10/01/2018
Optimal Pricing For MHR Distributions
We study the performance of anonymous posted-price selling mechanisms fo...
research
∙
09/10/2018
The Pareto Frontier of Inefficiency in Mechanism Design
We study the trade-off between the Price of Anarchy (PoA) and the Price ...
research
∙
02/27/2018