M. Bichler, S. Fadaei, and D. Kraft. A simple and fast algorithm for convex decomposition in relax-and-round mechanisms. Computers and Operations Research, 103:277–287, 2018. [ DOI | pdf ]

S. Fadaei and M. Bichler. Generalized assignment problem: Truthful mechanism design without money. Operations Research Letters, 45(1):72–76, 2017. [ pdf ]

S. Fadaei and M. Bichler. Truthfulness with value-maximizing bidders: On the limits of approximation in combinatorial markets. European Journal of Operational Research, 260(2):767–777, 2017. [ link | pdf ]

S. Fadaei and M. Bichler. A truthful mechanism for the generalized assignment problem. ACM Transactions on Economics and Computation (TEAC), 5(3):14, 2017. [ link | pdf ]

S. Fadaei and M. Bichler. Truthfulness and approximation with value-maximizing bidders. In Symposium on Algorithmic Game Theory, 2016. [ link ]

S. Fadaei and M. Bichler. A truthful-in-expectation mechanism for the generalized assignment problem. In Web and Internet Economics, pages 247–248. Springer, 2014. [ link | pdf ]

D. Kraft, S. Fadaei, and M. Bichler. Fast convex decomposition for truthful social welfare approximation. In Web and Internet Economics, pages 120–132. Springer, 2014. [ link | pdf ]