8 citations · 20 across the 7 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.CC2018★ 4 cited
Smoothed Efficient Algorithms and Reductions for Network Coordination Games
Shant Boodaghians, Rucha Kulkarni, Ruta Mehta
Worst-case hardness results for most equilibrium computation problems have raised the need for beyond-worst-case analysis. To this end, we study the smoothed complexity of finding…
cs.GT2018
Revealed Preference Dimension via Matrix Sign Rank
Shant Boodaghians
Given a data-set of consumer behaviour, the Revealed Preference Graph succinctly encodes inferred relative preferences between observed outcomes as a directed graph. Not all graphs…
stat.ML2018★ 1 cited
Performance Metric Elicitation from Pairwise Classifier Comparisons
Gaurush Hiranandani, Shant Boodaghians, Ruta Mehta +1
Given a binary prediction problem, which performance metric should the classifier optimize? We address this question by formalizing the problem of Metric Elicitation. The goal of m…