-
Smoothed Complexity of 2-player Nash Equilibria
We prove that computing a Nash equilibrium of a two-player (n × n) game ...
07/21/2020 ∙ by Shant Boodaghians, et al. ∙
0
∙
share
read it
-
Pandora's Box Problem with Order Constraints
The Pandora's Box Problem, originally formalized by Weitzman in 1979, mo...
02/17/2020 ∙ by Shant Boodaghians, et al. ∙
0
∙
share
read it
-
Online Revenue Maximization for Server Pricing
Efficient and truthful mechanisms to price resources on remote servers/m...
06/24/2019 ∙ by Shant Boodaghians, et al. ∙
0
∙
share
read it
-
Smoothed Efficient Algorithms and Reductions for Network Coordination Games
Worst-case hardness results for most equilibrium computation problems ha...
09/07/2018 ∙ by Shant Boodaghians, et al. ∙
0
∙
share
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...
09/07/2018 ∙ by Shant Boodaghians, et al. ∙
0
∙
share
read it
-
Revealed Preference Dimension via Matrix Sign Rank
Given a data-set of consumer behaviour, the Revealed Preference Graph su...
07/28/2018 ∙ by Shant Boodaghians, et al. ∙
0
∙
share
read it
-
Eliciting Binary Performance Metrics
Given a binary prediction problem, which performance metric should the c...
06/05/2018 ∙ by Gaurush Hiranandani, et al. ∙
0
∙
share
read it
