The Combinatorial World (of Auctions) According to GARP. - Shant Boodaghians; Adrian Vetta (SAGT, 2015)

Testing Consumer Rationality Using Perfect Graphs and Oriented Discs. - Shant Boodaghians; Adrian Vetta (WINE, 2015)

Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets. - Gerardo Berbeglia; Shant Boodaghians; Adrian Vetta (SAGT, 2018)

Revealed Preference Dimension via Matrix Sign Rank. - Shant Boodaghians (WINE, 2018)

Eliciting Binary Performance Metrics. - Gaurush Hiranandani; Shant Boodaghians; Ruta Mehta; Oluwasanmi Koyejo (CoRR, 2018)

Nash Equilibrium in Smoothed Polynomial Time for Network Coordination Games. - Shant Boodaghians; Rucha Kulkarni; Ruta Mehta (CoRR, 2018)

Performance Metric Elicitation from Pairwise Classifier Comparisons. - Gaurush Hiranandani; Shant Boodaghians; Ruta Mehta; Oluwasanmi Koyejo (AISTATS, 2019)

Multiclass Performance Metric Elicitation. - Gaurush Hiranandani; Shant Boodaghians; Ruta Mehta; Oluwasanmi Koyejo (NeurIPS, 2019)

Smoothed Complexity of 2-player Nash Equilibria. - Shant Boodaghians; Joshua Brakensiek; Samuel B. Hopkins 001; Aviad Rubinstein (FOCS, 2020)

Smoothed Efficient Algorithms and Reductions for Network Coordination Games. - Shant Boodaghians; Rucha Kulkarni; Ruta Mehta (ITCS, 2020)

Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets. - Gerardo Berbeglia; Shant Boodaghians; Adrian Vetta (Discret. Optim., 2021)

Search and optimization with randomness in computational economics: equilibria, pricing, and decisions - Shant Boodaghians (2021)

Polynomial Time Algorithms to Find an Approximate Competitive Equilibrium for Chores. - Shant Boodaghians; Bhaskar Ray Chaudhury; Ruta Mehta (SODA, 2022)

Online revenue maximization for server pricing. - Shant Boodaghians; Federico Fusco; Stefano Leonardi 001; Yishay Mansour; Ruta Mehta (Auton. Agents Multi Agent Syst., 2022)

Pandora's Box Problem with Order Constraints. - Shant Boodaghians; Federico Fusco; Philip Lazos; Stefano Leonardi 001 (Math. Oper. Res., 2023)