
Smoothed Complexity of 2player Nash Equilibria
We prove that computing a Nash equilibrium of a twoplayer (n × n) game ...
read it

Pandora's Box Problem with Order Constraints
The Pandora's Box Problem, originally formalized by Weitzman in 1979, mo...
read it

Online Revenue Maximization for Server Pricing
Efficient and truthful mechanisms to price resources on remote servers/m...
read it

Smoothed Efficient Algorithms and Reductions for Network Coordination Games
Worstcase hardness results for most equilibrium computation problems ha...
read it

Nash Equilibrium in Smoothed Polynomial Time for Network Coordination Games
Extensive work in the last two decades has led to deep insights into the...
read it

Revealed Preference Dimension via Matrix Sign Rank
Given a dataset of consumer behaviour, the Revealed Preference Graph su...
read it

Eliciting Binary Performance Metrics
Given a binary prediction problem, which performance metric should the c...
read it
Shant Boodaghians
is this you? claim profile