research
∙
07/12/2021
Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores
Competitive equilibrium with equal income (CEEI) is considered one of th...
share
research
∙
07/21/2020
Smoothed Complexity of 2-player Nash Equilibria
We prove that computing a Nash equilibrium of a two-player (n × n) game ...
research
∙
02/17/2020
Pandora's Box Problem with Order Constraints
The Pandora's Box Problem, originally formalized by Weitzman in 1979, mo...
research
∙
06/24/2019
Online Revenue Maximization for Server Pricing
Efficient and truthful mechanisms to price resources on remote servers/m...
research
∙
09/07/2018
Smoothed Efficient Algorithms and Reductions for Network Coordination Games
Worst-case hardness results for most equilibrium computation problems ha...
research
∙
09/07/2018
Nash Equilibrium in Smoothed Polynomial Time for Network Coordination Games
Extensive work in the last two decades has led to deep insights into the...
research
∙
07/28/2018
Revealed Preference Dimension via Matrix Sign Rank
Given a data-set of consumer behaviour, the Revealed Preference Graph su...
research
∙
06/05/2018
