Maximizing Submodular Set Functions Subject to Different Constraints: Combined Algorithms - Salman Fadaei; MohammadAli Safari; MohammadAmin Fazli (CoRR, 2011)

Maximizing non-monotone submodular set functions subject to different constraints: Combined algorithms. - Salman Fadaei; MohammadAmin Fazli; MohammadAli Safari (Oper. Res. Lett., 2011)

A Truthful-in-Expectation Mechanism for the Generalized Assignment Problem. - Salman Fadaei; Martin Bichler (WINE, 2014)

Fast Convex Decomposition for Truthful Social Welfare Approximation. - Dennis Kraft 001; Salman Fadaei; Martin Bichler (WINE, 2014)

Mechanism Design via Dantzig-Wolfe Decomposition. - Salman Fadaei (CoRR, 2015)

Truthfulness and Approximation with Value-Maximizing Bidders. - Salman Fadaei; Martin Bichler (SAGT, 2016)

A Note on Relaxation and Rounding in Algorithmic Mechanism Design. - Salman Fadaei (CoRR, 2016)

Truthfulness with Value-Maximizing Bidders. - Salman Fadaei; Martin Bichler (CoRR, 2016)

Truthfulness with value-maximizing bidders: On the limits of approximation in combinatorial markets. - Salman Fadaei; Martin Bichler (Eur. J. Oper. Res., 2017)

Generalized assignment problem: Truthful mechanism design without money. - Salman Fadaei; Martin Bichler (Oper. Res. Lett., 2017)

A Truthful Mechanism for the Generalized Assignment Problem. - Salman Fadaei; Martin Bichler (ACM Trans. Economics and Comput., 2017)

A simple and fast algorithm for convex decomposition in relax-and-round mechanisms. - Martin Bichler; Salman Fadaei; Dennis Kraft 001 (Comput. Oper. Res., 2019)